The process of establishing explicit correspondences between entities, relations, constraints, and roles in one conceptual or data structure and those in another, so that relational patterns can be translated, compared, or reused; characterized by identifying homomorphisms, partial correspondences, and permitted transformations rather than by mere analogy or metaphor.

Principle

Schema mapping operates by preserving relational structure (mappings of nodes and edges, constraints and operations) to the extent allowed by domain semantics; valid mappings are those that maintain the functions or inferences associated with mapped relations.

Demonstration

Illustrative scenario — Situation: A designer wants to reuse a hierarchical category schema from a library catalogue to structure an online image collection. Recognition: The designer identifies analogous entity types (work, author, subject), hierarchical relations, and provenance constraints. Action: She defines mappings for equivalent fields, specifies transforms for nonmatching fields (e.g., subjects → tags), and declares where only partial mapping is possible. Consequence: The image collection acquires searchable categories and retains provenance links, while queries requiring catalogue‑only fields return partial or transformed results.

Misapplication

Treating an evocative similarity as a complete mapping (e.g., mapping ‘author’ to ‘creator’ without checking rights, provenance rules, or multiplicity) produces category errors; the semantic mistake is conflating lexical resemblance with preserved relational semantics.

Consequence

Effective schema mapping enables reuse of tools, cross‑domain querying, and interoperable architectures; incorrect mapping yields incorrect inferences, data loss, broken constraints, and misleading analytics.

Reversal

When target and source domains lack isomorphic relations or when critical constraints (legal, semantic, functional) cannot be represented, mapping is necessarily partial, heuristic, or inadvisable; in some cases, building a mediating schema or redesigning models is required.

Boundary

Clearly within: defining field‑to‑field correspondences and transform rules between two database schemas for inventory systems. Boundary case: drawing an advisory analogy between a social network graph and a transportation network (useful heuristics but limited structural equivalence). Clearly outside: using a poetic metaphor about ‘networks’ without any definable entity–relation correspondences.

Semantic Tension

Fidelity versus utility — strict, lossless mappings preserve semantic fidelity but may be impractical; pragmatic, lossy mappings increase usability but risk semantic distortion.

Synthesis

Schema Mapping is a formal relational translation task: it demands explicit specification of correspondences, permitted transforms, and limits so that relational operations and inferences remain interpretable across domains rather than relying on informal analogy.