Which database model enforces a one-to-many hierarchy where each child record type has exactly one parent, although a parent may have one or more children?

Introduction / Context:
Different logical data models impose different relationship constraints. Recognizing the model from a brief relationship description helps you match data structures to appropriate systems and query methods, especially when migrating from legacy systems to modern relational platforms.

Given Data / Assumptions:

• The relationship is strictly one-to-many.
• Each child has only one parent (no many-to-many at the child side).
• A parent can have multiple children.

Concept / Approach:

The hierarchical model organizes data as a tree. Each child node (record) links to exactly one parent, while parent nodes may have several children. This mirrors file-system-like structures and contrasts with the network model (which permits many-to-many via sets) and the relational model (which expresses relationships via keys without enforcing a single-parent rule).

Step-by-Step Solution:

Verification / Alternative check:

Classic hierarchical systems (e.g., IBM IMS) exemplify single-parent, one-to-many structures, confirming the mapping.

Why Other Options Are Wrong:

Network database: Allows many-to-many via owner/member sets.

Relational database: Does not constrain to one parent; relationships are flexible via keys.

Distributed database: Describes deployment topology, not logical model.

None: Incorrect because the hierarchical model matches exactly.

Common Pitfalls:

Confusing logical data model (hierarchical vs network vs relational) with physical distribution (distributed).

Final Answer:

Hierarchical database