Uniform indexing scheme for object-oriented databases

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations


The performance of Object-oriented databases (OODB) is a critical factor hindering their current use. Several indexing schemes have been proposed in the literature for enhancing OODB performance and they are briefly reviewed here. In this paper a new and uniform indexing scheme is proposed. This scheme is based on a single B-tree and combines both the hierarchical and nested indexing schemes. The uniformity of this scheme enables compact and optimized code dealing with a large range of queries on the one hand, and flexibility in adding and removing indexed paths on the other hand. The performance of the scheme is about the same as existing schemes for single-class, exact match or range queries, and much better for multi-class and other complex queries and update.

Original languageEnglish
Number of pages9
StatePublished - 1 Jan 1996
EventProceedings of the 1996 IEEE 12th International Conference on Data Engineering - New Orleans, LA, USA
Duration: 26 Feb 19961 Mar 1996


ConferenceProceedings of the 1996 IEEE 12th International Conference on Data Engineering
CityNew Orleans, LA, USA

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems


Dive into the research topics of 'Uniform indexing scheme for object-oriented databases'. Together they form a unique fingerprint.

Cite this