Hierarchical databases organize information as a tree: a single root record branches into child records, and each child has exactly one parent. This structure was the dominant approach in early commercial database systems such as IBM's IMS, and it still shapes how we think about nested data today — think of file systems, organizational charts, or XML and JSON documents. Because relationships are built directly into the storage structure through parent-child links, navigating a hierarchical database means following those links from the root downward rather than writing a declarative query.
In this course, hierarchical databases matter for two reasons. First, they give you historical context: understanding what came before the relational model makes it much clearer why tables, keys, and SQL were such an important advance. Second, they sharpen your ability to compare models — hierarchical databases are fast and predictable for queries that follow the tree, but awkward or impossible for many-to-many relationships and for questions the designer did not anticipate.
As you watch, look for three things: how the tree structure and parent-child rule are defined, how data access and navigation differ from relational querying, and where each model's strengths and limitations show up. Note that the third video shifts from data models to B-trees, an internal tree structure used inside modern database engines — keep that distinction clear in your notes, since a tree-shaped index is not the same thing as a hierarchical data model.
A short survey of the major DBMS data models — hierarchical, network, relational, and object-oriented — presented with simple examples. The hierarchical segment should introduce the tree-based layout and parent-child relationships, then place that model alongside the alternatives that followed it. Expect definitions and comparisons rather than hands-on implementation.
Because it covers four models in one pass, it is an efficient way to see where hierarchical databases sit historically and structurally relative to the relational model you will study next.
A lecture-style walkthrough of the relational, network, and hierarchical data models, framed as question-and-answer practice. At fifteen minutes it has room to go deeper on how each model represents relationships, which should include the single-parent rule of hierarchies and the contrast with the network model's multiple parents. The Q-and-A framing means you will likely hear the kinds of exam questions asked about these models.
The longer, slower treatment reinforces the distinctions from the first video and gives you practice articulating the strengths and limitations of each model in your own words.
An animated explanation of B-trees, the balanced tree data structure widely used for indexing in databases and file systems. The video should show how a B-tree keeps data sorted and searchable, how nodes split as data grows, and why this keeps lookups fast on very large datasets. This is about internal storage and indexing, not about the hierarchical data model.
Spanning Tree is a well-regarded explainer channel, and this video builds your intuition for tree-based organization and navigation — useful background that also helps you avoid confusing a tree-shaped index with a hierarchical database model.
Together these videos support MO2 and MO3 most directly: the first two place the hierarchical model side by side with the relational and network models so you can distinguish them by structural organization and by how they express data relationships, and then compare them on query capability, flexibility, and data integrity. The vocabulary introduced across both lectures — records, parent and child segments, schema, keys — reinforces MO1. Understanding why hierarchical access paths are rigid and why relational querying is more flexible gives you the reasoning you need for MO4 and MO5, where you must justify a database choice for a given application or industry. The B-tree video adds depth on tree-based navigation and performance at scale, which strengthens the scalability dimension of MO3.
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.