Chapter 2. Adjacency List Model
In the early days of System “R” at IBM, one of the arguments against a relational database was that SQL could not handle hierarchies like IMS could and would therefore not be practical for large databases. It might have a future as an ad hoc query language, but that was the best that could be expected of it.
Keywords: subtree, anomalies, NULLs, navigation, traversal, self-joins, aggregation
In the early days of System “R” at IBM, one of the arguments against a relational database was that SQL could not handle hierarchies like IMS could and would therefore not be practical for large databases. It might have a future as an ad hoc query language, but that was the best that could be expected of it.
In a short paper, Dr. ...
Get Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
