One-to-one (data model)¶
A relationship cardinality in which each instance of either entity type is associated with at most one instance of the other, with optionality specified separately.
Core Idea¶
A one-to-one relationship in data modeling constrains two entity types so that each instance on either side is associated with at most one instance on the other. Minimum participation is separate, so a one-to-one relationship can be optional on one or both sides rather than a total mathematical bijection. Optionality is separate. Optionality is separate.
Scope of Application¶
The cardinality applies when domain rules make two entity identities correspond uniquely in both directions. The relationship applies when reciprocal uniqueness is a genuine domain rule and the schema can enforce it.
- Entity–relationship models. Diagram endpoints record maximum and minimum participation.
- Relational schemas. Unique foreign keys or shared primary keys enforce reciprocal uniqueness.
- Vertical decomposition. Rare or sensitive attributes can be separated while preserving one identity.
- Extension tables. A subtype-specific row corresponds to at most one base row.
- Data integration. Cross-system identifiers can be asserted one-to-one only after domain validation.
Clarity¶
State both directional maximums and both minimums. Define the entity types and time horizon precisely, because identity rules can change cardinality. Show how uniqueness, nullability, and foreign keys enforce the model. Test counterexamples from the real domain rather than inferring rules from current rows. The closest near miss sets the boundary: A bijection is the closest mathematical near miss or stronger case: it requires every A and B to participate exactly once, while database one-to-one often permits zero-or-one on one or both sides.
Manages Complexity¶
The abstraction compresses two reciprocal uniqueness constraints and optionality into a relationship signature. It helps decide whether entities should be merged, split into extension tables, or linked, while preventing temporary data regularities from becoming false domain rules. The central semantic rule–observed data tradeoff is this: A clean snapshot cannot prove the domain forbids future multiplicity. A second separate tables–single entity tension matters because One-to-one decomposition can isolate concerns but add joins and lifecycle coordination.
Abstract Reasoning¶
Use three linked moves: define A and B identities and the meaning of one instance on each side; ask the maximum number of B instances valid for one A, then reverse the question; specify minimum participation separately for each direction. As a collapse test, the case exits when either endpoint can validly relate to two or more instances of the other under the domain definition. A fourth check is to search domain history and edge cases for legitimate multiplicity. A final check is to implement and test uniqueness plus referential constraints matching the result.
Knowledge Transfer¶
Bidirectional maximum-one cardinality transfers across conceptual, logical, and physical models. The phrase becomes misleading when used for current row counts or one-way uniqueness only. No canonical parent prime is currently asserted; broader structural comparisons remain related-prime analogies until separately adjudicated in the DAG. Endpoint bounds classify the relationship. Schema rules preserve the modeled maximums.
Neighborhood in Abstraction Space¶
One-to-one (data model) sits in a moderately populated region (60th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.
Family — Property Ontology & Code Smells (18 abstractions)
Nearest neighbors
- Associative Entity — 0.86
- Data Model — 0.85
- Foreign key — 0.85
- Principal type — 0.84
- Unit of Work — 0.84
Computed from structural-signature embeddings · 2026-10-08