H-trees: A Dynamic Associative Search Index for OODB.
Chee Chin Low, Beng Chin Ooi, Hongjun Lu:
H-trees: A Dynamic Associative Search Index for OODB.
SIGMOD Conference 1992: 134-143@inproceedings{DBLP:conf/sigmod/LowOL92,
author = {Chee Chin Low and
Beng Chin Ooi and
Hongjun Lu},
editor = {Michael Stonebraker},
title = {H-trees: A Dynamic Associative Search Index for OODB},
booktitle = {Proceedings of the 1992 ACM SIGMOD International Conference on
Management of Data, San Diego, California, June 2-5, 1992},
publisher = {ACM Press},
year = {1992},
pages = {134-143},
ee = {http://doi.acm.org/10.1145/130283.130307, db/conf/sigmod/LowOL92.html},
crossref = {DBLP:conf/sigmod/92},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
The support of the superclass-subclass concept in
object-oriented databases (OODB) makes an instance
of a subclass also an instance of its superclass. As a
result, the access scope of a query against a class in
general includes the access scope of all its subclasses,
unless specified otherwise. To support the superclass-subclass
relationship efficiently, the index must achieve
two objectives. First, the index must support efficient
retrieval of instances from a single class. Second, it must
also support efficient retrieval of instances from classes
in a hierarchy of classes. In this paper, we propose a new
index called the H-tree that supports efficient retrieval
of instances of a single class as well as retrieval of instances
of a class and its subclasses. The unique feature
of H-trees is that they capture the superclass-subclass
relationships. A performance analysis is conducted and
both experimental and analytical results indicate that
the H-tree is an efficient indexing structure for 00DB.
Copyright © 1992 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Online Version (ACM WWW Account required): Full Text in PDF Format
CDROM Version: Load the CDROM "Volume 1 Issue 2, SIGMOD '75-'92" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
Printed Edition
Michael Stonebraker (Ed.):
Proceedings of the 1992 ACM SIGMOD International Conference on Management of Data, San Diego, California, June 2-5, 1992.
ACM Press 1992 BibTeX
,
SIGMOD Record 21(2),
June 1992
Contents
[Abstract and Index Terms]
[Full Text in PDF Format, 1037 KB]
References
- [BeK89]
- Elisa Bertino, Won Kim:
Indexing Techniques for Queries on Nested Objects.
IEEE Trans. Knowl. Data Eng. 1(2): 196-214(1989) BibTeX
- [CDR86]
- Michael J. Carey, David J. DeWitt, Joel E. Richardson, Eugene J. Shekita:
Object and File Management in the EXODUS Extensible Database System.
VLDB 1986: 91-100 BibTeX
- [Com79]
- Douglas Comer:
The Ubiquitous B-Tree.
ACM Comput. Surv. 11(2): 121-137(1979) BibTeX
- [KeM90]
- Alfons Kemper, Guido Moerkotte:
Access Support in Object Bases.
SIGMOD Conference 1990: 364-374 BibTeX
- [KKD89]
- ...
- [LLO91]
- Chee Chin Low, Hongjun Lu, Beng Chin Ooi, Jiawei Han:
Efficient Access Methods in Deductive and Object-Oriented Databases.
DOOD 1991: 68-84 BibTeX
- [MeS86]
- David Maier, Jacob Stein:
Indexing in an Object-Oriented DBMS.
OODBS 1986: 171-182 BibTeX
- [SuO82]
- Peter Scheuermann, Aris M. Ouksel:
Multidimensional B-trees for associative searching in database systems.
Inf. Syst. 7(2): 123-137(1982) BibTeX
- [VKC86]
- Patrick Valduriez, Setrag Khoshafian, George P. Copeland:
Implementation Techniques of Complex Objects.
VLDB 1986: 101-110 BibTeX
Referenced by
- Thomas A. Mück, Martin L. Polaschek:
A Configrable Type Hierarchy Index for OODB.
VLDB J. 6(4): 312-332(1997)
- Thomas A. Mück, Martin L. Polaschek:
The Multikey Type Index for Persistent Object Sets.
ICDE 1997: 22-31
- Chee Yong Chan, Cheng Hian Goh, Beng Chin Ooi:
Indexing OODB Instances based on Access Proximity.
ICDE 1997: 14-21
- Thomas A. Mück, Martin L. Polaschek:
Optimal Type Hierarchy Linearization for Queries in OODB.
DASFAA 1997: 225-234
- Beng Chin Ooi, Jiawei Han, Hongjun Lu, Kian-Lee Tan:
Index Nesting - An Efficient Approach to Indexing in Object-Oriented Databases.
VLDB J. 5(3): 215-228(1996)
- Boris Shidlovsky, Elisa Bertino:
A Graph-Theoretic Approach to Indexing in Object-Oriented Databases.
ICDE 1996: 230-237
- Ehud Gudes:
A Uniform Indexing Scheme for Object-Oriented Databases.
ICDE 1996: 238-246
- Sridhar Ramaswamy, Paris C. Kanellakis:
OODB Indexing by Class-Division.
SIGMOD Conference 1995: 139-150
- B. Sreenath, S. Seshadri:
The hcC-tree: An Efficient Index Structure for Object Oriented Databases.
VLDB 1994: 203-213
- Christoph Kilger, Guido Moerkotte:
Indexing Multiple Sets.
VLDB 1994: 180-191
- Sridhar Ramaswamy, Sairam Subramanian:
Path Caching: A Technique for Optimal External Searching.
PODS 1994: 25-35
- Paris C. Kanellakis, Sridhar Ramaswamy, Darren Erik Vengroff, Jeffrey Scott Vitter:
Indexing for Data Models with Constraints and Classes.
PODS 1993: 233-243
- Chee Yong Chan, Beng Chin Ooi, Hongjun Lu:
Extensible Buffer Management of Indexes.
VLDB 1992: 444-454
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:40:10 2009