Joe Celko's Trees and Hierarchies in SQL for SmartiesElsevier, 01.06.2004 - 240 Seiten 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 related topics that should be of interest to the working database programmer. These topics include hierarchical encoding schemes, graphs, IMS, binary trees, and more. This book covers SQL-92 and SQL:1999. · Includes graph theory and programming techniques. · Running examples throughout the book help illustrate and tie concepts together. · Loads of code, available for download from www.mkp.com. |
Inhalt
| 1 | |
| 3 | |
| 17 | |
| 35 | |
| 45 | |
Chapter 5 Frequent Insertion Trees | 101 |
Chapter 6 The Linear Version of the Nested Sets Model | 137 |
Chapter 7 Binary Trees | 143 |
Chapter 8 Other Models for Trees | 157 |
Chapter 9 Proprietary Extensions for Trees | 169 |
Chapter 10 Hierarchies in Data Modeling | 175 |
Chapter 11 Hierarchical Encoding Schemes | 191 |
Chapter 12 Hierarchical Database Systems IMS | 199 |
Readings and Resources | 215 |
Index | 217 |
Andere Ausgaben - Alle anzeigen
Häufige Begriffe und Wortgruppen
adjacency list model Albert application approach Assemblies BEGIN Bert binary tree boss called CASCADE CHECK child Chuck clause College column compute CONNECT constraints contains COUNT course CREATE TABLE database defined DELETE denom depth Donna Eddie edges example EXISTS expression field Figure final Frammis Fred function gaps give given graph GROUP hierarchy includes INSERT INTEGER NOT NULL JOIN LANGUAGE SQL DETERMINISTIC leaf nodes leave look means method nested sets model node NULL PRIMARY KEY OrgChart pairs parent particular path Personnel_OrgChart position possible problem PROCEDURE programming query record recursive REFERENCES relational relationship remove represent result RETURN root segment SELECT sequence shift sibling simple spread standard statement string structure student subordinates subtree traversal UPDATE VALUES VIEW weight write
Beliebte Passagen
Seite 193 - On those remote pages it is written that animals are divided into (a) those that belong to the Emperor, (b) embalmed ones, (c) those that are trained, (d) suckling pigs, (e) mermaids, (f) fabulous ones, (g) stray dogs, (h) those that are included in this classification, (i) those that tremble as if they were mad, (j) innumerable ones, (k) those drawn with a very fine camel's hair brush, (1) others, (m) those that have just broken a flower vase, (n) those that resemble flies from a distance.
Seite 192 - ... delivery address. ZIP Code directories are available for use or sale at your local post office, or you can look up ZIP Codes on-line: www.usps.gov/ncsc/. In 1983. the Postal Service began to use an expanded ZIP Code called ZIP+4. It is composed of the original five-digit code plus a four-digit add-on. The four-digit add-on number identifies a geographic segment within the five-digit delivery area such as a city block, an office building, an individual high-volume receiver of mail, or any other...
Seite 194 - Computers, information, & general reference 100 Philosophy & psychology 200 Religion 300 Social sciences 400 Language 500 Science 600 Technology 700 Arts & recreation 800 Literature 900 History & geography Each major group (for example 600 to 699) is further and further broken down.
Seite 193 - These ambiguities, redundancies, and deficiencies recall those attributed by Dr. Franz Kuhn to a certain Chinese encyclopaedia entitled Celestial Emporium of Benevolent Knowledge. On those remote pages it is written that animals are divided into (a) those that belong to the Emperor, (b) embalmed ones, (c) those that are trained, (d) suckling pigs, (e) mermaids, (f) fabulous ones, (g) stray dogs, (h) those that...
Seite 143 - A binary tree can be either empty or a tree in which every node has either no children, a left child, a right child, or both a left and a right child. The fact that each child in a binary tree is designated as a left or right child, makes a binary tree different from a general tree.
Seite 194 - Differential & generic psychology 156 Comparative psychology 157 Abnormal & clinical psychologies 158 Applied psychology 159 Other aspects 160 Logic 161 Induction 162 Deduction 163 164 165 Fallacies & sources of error 166 Syllogisms 167 Hypotheses 168 Argument & persuasion 169 Analogy 170 Ethics (Moral philosophy) 171 Systems & doctrines 172 Political ethics 173 Ethics of family relationships 174 Professional & occupational ethics...
Verweise auf dieses Buch
Information Modeling and Relational Databases Terry Halpin,Tony Morgan Eingeschränkte Leseprobe - 2010 |
 |