Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition > Chapter 4: Nested Sets Model of Hierarchies > 4.1 Finding Root and Leaf Nodes - Pg. 64: Safari Books Online

Table of Contents

Download Safari Books Online apps: Apple iOS | Android

Entire Site

Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.

This Book

Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition

Joe Celko's Trees and Hierarchies in SQL for Smarties, 2nd Edition

Search

Contents

Table of Contents

Joe Celko's: Trees and Hierarchies in Sql for Smarties

Chapter 1: Graphs, Trees, and Hierarchies

Chapter 2: Adjacency List Model

Chapter 3: Path Enumeration Models

Chapter 4: Nested Sets Model of Hierarchies

4.1 Finding Root and Leaf Nodes

4.2 Finding Subtrees

4.3 Finding Levels and Paths in a Tree

4.4 Functions in the Nested Sets Model

4.5 Deleting Nodes and Subtrees

4.6 Closing Gaps in the Tree

4.7 Summary Functions on Trees

4.8 Inserting and Updating Trees

4.9 Converting Nested Sets Model to Adjacency List Model

4.10 Converting Adjacency List Model to Nested Sets Model

4.11 Separation of Edges and Nodes

4.12 Comparing Nodes and Structure

4.13 Nested Sets Code in Other Languages

Chapter 5: Frequent Insertion Trees

Chapter 6: Linear Version of the Nested Sets Model

Chapter 7: Binary Trees

Chapter 8: Other Models for Trees

Chapter 9: Proprietary Extensions for Trees

Chapter 10: Hierarchies in Data Modeling

Chapter 11: Hierarchical Encoding Schemes

Chapter 12: Graphs in SQL

Chapter 13: Petri Nets

Chapter 14: State Transition Graphs

Chapter 15: Hierarchical Database Systems (IMS)

URL

Help

4.1 Finding Root and Leaf Nodes 51 Albert Chuck Donna Eddie Fred Bert As nested circles Figure 4.2 Albert 9 10