Joe Celko's Trees and hierarchies in SQL for smarties
Joe Celko's Trees and Hierarchies in SQL is an intermediate to advanced-level practitioner's guide to mastering the two most challenging aspects of developing database applications in SQL. In this book, Celko illustrates several major approaches to representing trees and hierarchies and re...
| Autor principal: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; Boston :
Morgan Kaufmann
c2004.
|
| Edición: | 1st edition |
| Colección: | The Morgan Kaufmann Series in Data Management Systems
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627595506719 |
Tabla de Contenidos:
- Front Cover; Joe Celko's Trees and Hierarchies in SQL for Smarties; Copyright Page; Contents; Introduction; Chapter 1. Graphs, Trees, and Hierarchies; 1.1 Modeling a Graph in a Program; 1.2 Defining Trees and Hierarchies; 1.3 Note on Recursion; Chapter 2. Adjacency List Model; 2.1 The Simple Adjacency List Model; 2.2 The Simple Adjacency List Model Is Not Normalized; 2.3 Fixing the Adjacency List Model; 2.4 Navigation in Adjacency List Model; 2.5 Inserting Nodes in the Adjacency List Model; 2.6 Deleting Nodes in the Adjacency List Model; 2.7 Leveled Adjacency List Model
- Chapter 3. Path Enumeration Models3.1 Finding the Depth of the Tree; 3.2 Searching for Subordinates; 3.3 Searching for Superiors; 3.4 Deleting a Subtree; 3.5 Deleting a Single Node; 3.6 Inserting a New Node; 3.7 Splitting up a Path String; 3.8 The Edge Enumeration Model; 3.9 XPath and XML; Chapter 4. Nested Set 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 List4.10 Converting Adjacency List 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; 5.1 The Datatype of (lft, rgt); 5.2 Computing the Spread to Use; 5.3 Total Reorganization; 5.4 Rational Numbers and Nested Intervals Model; Chapter 6. The Linear Version of the Nested Sets Model; 6.1 Insertion and Deletion; 6.2 Finding Paths; 6.3 Finding Levels; 6.4 Summary; Chapter 7. Binary Trees; 7.1 Binary Tree Traversals
- 7.2 Binary Tree Queries7.3 Deletion from a Binary Tree; 7.4 Insertion into a Binary Tree; 7.5 Heaps; 7.6 Binary Tree Representation of Multiway Trees; 7.7 The Stern-Brocot Numbers; Chapter 8. Other Models for Trees; 8.1 Adjacency List with Self-references; 8.2 Subordinate Adjacency List; 8.3 Hybrid Models; 8.4 General Graphs; Chapter 9. Proprietary Extensions for Trees; 9.1 Oracle Tree Extensions; 9.2 XDB Tree Extension; 9.3 DB2 and the WITH Operator; 9.4 Date's EXPLODE Operator; 9.5 Tillquist and Kuo's Proposals; 9.6 Microsoft Extensions; 9.7 Other Methods
- Chapter 10. Hierarchies in Data Modeling10.1 Types of Hierarchies; 10.2 DDL Constraints; Chapter 11. Hierarchical Encoding Schemes; 11.1 ZIP codes; 11.2 Dewey Decimal Classification; 11.3 Strength and Weaknesses; 11.4 Shop Categories; 11.5 Statistical Tools for Decision Trees; Chapter 12. Hierarchical Database Systems (IMS); 12.1 Types of Databases; 12.2 Database History; 12.3 Sample Hierarchical Database; 12.4 Summary; Appendix: Readings and Resources; Index
