Joe Celko's Trees and Hierarchies in SQL for Smarties
Search in google:
In his previous book, (SQL for Smarties, 2e, MK, 1999) Joe Celko wrote two chapters on programming techniques for representing trees and hierarchies in SQL. Ever since then, he has been bombarded with questions requesting more explanation of these topics. Joe has decided to meet the demand for this information by addressing the topic in depth in his new full-length book. Trees and hierarchies are a way to organize information and appear everywhere in computer science, from indexing structures (i.e. B-Tree indexing) to encoding schemes (i.e. Dewey Decimal system for libraries) to hierarchical databases. Even XML and related markup languages-which interact with databases-are based on tree structures. Every SQL programmer is faced with the challenge of creating these structures, which are not easy to master and have far-reaching programmatic effects.
1Graphs, trees, and hierarchies32Adjacency list model173Path enumeration models354Nested set model of hierarchies455Frequent insertion trees1016The linear version of the nested sets model1377Binary trees1438Other models for trees1579Proprietary extensions for trees16910Hierarchies in data modeling17511Hierarchical encoding schemes19112Hierarchical database systems (IMS)199
![SQL Queries for Mere Mortals: A Hands-on Guide to Data Manipulation in SQL [For Mere Mortals Series]](/application/data/covers/44/31/9780321444431.jpg "SQL Queries for Mere Mortals: A Hands-on Guide to Data Manipulation in SQL [For Mere Mortals Series]")
