Topic: network and hierarchical databases

Summary

Before relational databases became practical, the dominant models were network databases and hierarchical databases. A network database uses pointers to interrelate data records while a hierarchical database used a tree of data records. The two models were frequently combined, with a tree used for one-many relations and pointers used for one-one relations.

Access was record-at-a-time. If your application matched the structure of the database, access and update operations were fast and space efficient. (cbb 8/06)

Subtopic: network/hierarchical model

Quote: the network/hierarchical model is good for large-scale databases because of efficient access to most commonly accessed relationships [»rohdWF12_1979]

Quote: the network/hierarchical model requires programmer knowledge of the database structure [»rohdWF12_1979]

Subtopic: history

Quote: the Integrated Data Store moves list processing to disk with circular chains of links from master records; maybe basis for information algebra [»bachCW_1964]

Subtopic: no order to relations

Quote: no "nextness" for rows or columns of a relation; both are position-independent [»coddEF_1990]

Related Topics

Topic: graphs (18 items)
Topic: hierarchical structures (46 items)
Topic: representing a relationship
(28 items)