Indexing techniques for object-oriented databases.

by Frank Hing-Wah Luk.Thesis (M.Phil.)--Chinese University of Hong Kong, 1996.Includes bibliographical references (leaves 92-95).Abstract --- p.iiAcknowledgement --- p.iiiChapter 1 --- Introduction --- p.1Chapter 1.1 --- Motivation --- p.1Chapter 1.2 --- The Problem in Object-Oriented Database Indexing --- p.2Chapter 1.3 --- Contributions --- p.3Chapter 1.4 --- Thesis Organization --- p.4Chapter 2 --- Object-oriented Data Model --- p.5Chapter 2.1 --- Object-oriented Data Model --- p.5Chapter 2.2 --- Object and Object Identifiers --- p.6Chapter 2.3 --- Complex Attributes and Methods --- p.6Chapter 2.4 --- Class --- p.8Chapter 2.4.1 --- Inheritance Hierarchy --- p.8Chapter 2.4.2 --- Aggregation Hierarchy --- p.8Chapter 2.5 --- Sample Object-Oriented Database Schema --- p.9Chapter 3 --- Indexing in Object-Oriented Databases --- p.10Chapter 3.1 --- Introduction --- p.10Chapter 3.2 --- Indexing on Inheritance Hierarchy --- p.10Chapter 3.3 --- Indexing on Aggregation Hierarchy --- p.13Chapter 3.4 --- Indexing on Integrated Support --- p.16Chapter 3.5 --- Indexing on Method Invocation --- p.18Chapter 3.6 --- Indexing on Overlapping Path Expressions --- p.19Chapter 4 --- Triple Node Hierarchy --- p.23Chapter 4.1 --- Introduction --- p.23Chapter 4.2 --- Triple Node --- p.25Chapter 4.3 --- Triple Node Hierarchy --- p.26Chapter 4.3.1 --- Construction of the Triple Node Hierarchy --- p.26Chapter 4.3.2 --- Updates in the Triple Node Hierarchy --- p.31Chapter 4.4 --- Cost Model --- p.33Chapter 4.4.1 --- Storage --- p.33Chapter 4.4.2 --- Query Cost --- p.35Chapter 4.4.3 --- Update Cost --- p.35Chapter 4.5 --- Evaluation --- p.37Chapter 4.6 --- Summary --- p.42Chapter 5 --- Triple Node Hierarchy in Both Aggregation and Inheritance Hierarchies --- p.43Chapter 5.1 --- Introduction --- p.43Chapter 5.2 --- Preliminaries --- p.44Chapter 5.3 --- Class-Hierarchy Tree --- p.45Chapter 5.4 --- The Nested CH-tree --- p.47Chapter 5.4.1 --- Construction --- p.47Chapter 5.4.2 --- Retrieval --- p.48Chapter 5.4.3 --- Update --- p.48Chapter 5.5 --- Cost Model --- p.49Chapter 5.5.1 --- Assumptions --- p.51Chapter 5.5.2 --- Storage --- p.52Chapter 5.5.3 --- Query Cost --- p.52Chapter 5.5.4 --- Update Cost --- p.53Chapter 5.6 --- Evaluation --- p.55Chapter 5.6.1 --- Storage Cost --- p.55Chapter 5.6.2 --- Query Cost --- p.57Chapter 5.6.3 --- Update Cost --- p.62Chapter 5.7 --- Summary --- p.63Chapter 6 --- Decomposition of Path Expressions --- p.65Chapter 6.1 --- Introduction --- p.65Chapter 6.2 --- Configuration on Path Expressions --- p.67Chapter 6.2.1 --- Single Path Expression --- p.67Chapter 6.2.2 --- Overlapping Path Expressions --- p.68Chapter 6.3 --- New Algorithm --- p.70Chapter 6.3.1 --- Example --- p.72Chapter 6.4 --- Evaluation --- p.75Chapter 6.5 --- Summary --- p.76Chapter 7 --- Conclusion and Future Research --- p.77Chapter 7.1 --- Conclusion --- p.77Chapter 7.2 --- Future Research --- p.78Chapter A --- Evaluation of some Parameters in Chapter5 --- p.79Chapter B --- Cost Model for Nested-Inherited Index --- p.82Chapter B.1 --- Storage --- p.82Chapter B.2 --- Query Cost --- p.84Chapter B.3 --- Update --- p.84Chapter C --- Algorithm constructing a minimum auxiliary set of J Is --- p.87Chapter D --- Estimation on the number of possible combinations --- p.89Bibliography --- p.9