Indexing Techniques for Object-Oriented Databases

Object Oriented Database systems (OODBs) need e cient indexing techniques just like other Database systems. However, B+-trees which work very well for Relational Database systems are not good enough for OODBs. Several alternate indexing techniques have been proposed, amongst them H-trees. This report analyses indexing techniques for OODBs, in particular H-trees.

[1]  Douglas Comer,et al.  Ubiquitous B-Tree , 1979, CSUR.

[2]  Elisa Bertino,et al.  An indexing techniques for object-oriented databases , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.