Schema Mapping Relation¶

Bridge two independently governed classification schemes with an explicit, typed assertion — source concept, target concept, and a fidelity grade (exact / close / broader / narrower / related) — so consumers know exactly what the bridge guarantees without merging the schemes.

Core Idea¶

A schema mapping relation is an explicit, typed assertion that a concept in one governed classification scheme corresponds, in a stated way, to a concept in another. Its five-part commitment names a source scheme and concept, a target scheme and concept, and a correspondence type grading fidelity — in SKOS, one of exactMatch, closeMatch, broadMatch, narrowMatch, or relatedMatch. This bridges sovereign vocabularies without merging them: each keeps its own governance while the graded, revocable mapping records serve as connective tissue.

Scope of Application¶

The relation applies wherever two separately-governed vocabularies must be jointly queryable.

Library and museum knowledge-organization — SKOS-graded bridges between thesauri, classifications, and structured vocabularies.
Healthcare terminology crosswalks — ICD-9 ↔ ICD-10, ICD ↔ SNOMED-CT, where declared precision carries clinical consequence.
Bioinformatics ontology alignment — Gene Ontology ↔ Disease Ontology, cross-species orthology mappings.
Data engineering — ETL field mappings and type-system bridges, with fidelity propagated across hops.
Regulatory equivalency — FDA ↔ EMA and SEC ↔ ESMA mutual-recognition declarations at a stated fidelity.

Clarity¶

The typed grade makes legible a distinction interoperability practice collapses: a bridge existing and a bridge being safe to substitute across are different facts. The correspondence type forces three apart at declaration time — correspondence (a link exists), interchangeability (substitution is safe here), and equivalence (loss-free for all purposes) — so a curator can ask what fidelity a bridge claims rather than guessing a guarantee it never made.

Manages Complexity¶

Interoperating n governed schemes is otherwise a combinatorial mess demanding either a politically impossible master vocabulary or an undifferentiated tangle of crosswalk rows. The relation collapses "how do these vocabularies relate, and what may I do with it?" to a small tuple: source concept, target concept, one-of-five grade. The consumer reads the grade against their use, propagates the weakest link across chains, and tracks the gap inventory of unmatched concepts.

Abstract Reasoning¶

The relation separates correspondence, interchangeability, and equivalence, reasoning from a bridge's grade to what it claims. It supports directional inference — each grade licensing and forbidding a specific routing (climb but not descend, browse but never substitute). It enables weakest-link composition — computing a multi-hop route's guarantee arithmetically. And gap-as-signal reasoning treats a missing target as a first-class curatorial fact.

Knowledge Transfer¶

Within knowledge organization the relation transfers as full mechanism — the grade ladder, routing rules, weakest-link composition, and gap inventory all carry across library, healthcare, bioinformatics, data-engineering, and regulatory crosswalks. Beyond that substrate a shared abstract mechanism travels but the named machinery does not: the portable content is the parent — a typed, fidelity-graded function_mapping between sovereign systems, recurring in unit conversions and API translation layers. The SKOS five-value ladder and governance apparatus stay home. dag_edges:

Relationships to Other Abstractions¶

Current abstraction Schema Mapping Relation Domain-specific

Parents (6) — more general patterns this builds on

Schema Mapping Relation is a kind of Governed Relation Vocabulary Domain-specific

exact/close/broad/narrow/related is the cross-scheme fidelity species of a governed relation vocabulary, with inference limits and traversal action per grade.
Schema Mapping Relation is a kind of Relation Prime

Schema Mapping Relation is a binary Relation specialized by cross-scheme endpoints, a governed five-grade vocabulary, and per-grade inference limits.
Schema Mapping Relation is part of, conditional Hierarchy Prime

Broad and narrow mapping grades contain a Hierarchy relation that licenses climbing or descending across schemes in exactly one direction.
Schema Mapping Relation is part of Versioning Prime

Versioning is a strict constituent of the governed mapping artifact: every bridge is assertable, reviewable, revocable, replaceable, and historically queryable.
Schema Mapping Relation is a decomposition of Network Prime

Removing vocabulary semantics leaves a typed cross-scheme graph whose paths, weakest-link grades, reachability, and unmapped nodes remain first-class.
Schema Mapping Relation is a decomposition of Translation and Conceptual Bridging Prime

Removing controlled-vocabulary standards leaves a maintained bridge that carries concepts between incommensurable frameworks while naming fidelity loss.

Children (2) — more specific cases that build on this

Declared Equivalence Mapping Domain-specific is a kind of Schema Mapping Relation

Declared Equivalence Mapping is the exactMatch species of Schema Mapping Relation, fixing the bridge grade at purpose-bounded loss-free substitution.
Near-equivalence Mapping Domain-specific is a kind of Schema Mapping Relation

Near-equivalence Mapping is the closeMatch species of Schema Mapping Relation, fixing the bridge grade at useful correspondence with explicit loss risk.

Hierarchy paths (11) — routes to 8 parentless roots

Schema Mapping Relation → Governed Relation Vocabulary → Schema → Abstraction

Neighborhood in Abstraction Space¶

Schema Mapping Relation sits in a sparse region of the domain-specific corpus (65^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Authority Control & Identity (11 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12