Database Paper Browser

Back to papers

H-trees: A Dynamic Associative Search Index for OODB

Summary: H-tree is a dynamic associative index for OODB enabling both single-class retrieval and hierarchy-aware queries. Key novelty: encoding superclass-subclass relations for efficient hierarchy traversal; analyses and experiments validate efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
2579
Venue
SIGMOD
Year
1992
Pagerank
0.00012412548
Overall Rank
1,352 | 90.60%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank Citing Paper Year Venue Pagerank
2,003 Indexing for Data Models with Constraints and Classes (Extended Abstract) 1993 PODS 9.8126082e-05
2,013 Path Caching: A Technique for Optimal External Searching (Extended Abstract) 1994 PODS 9.7928688e-05
2,570 Extensible Buffer Management of Indexes 1992 VLDB 8.5214777e-05
3,795 OODB Indexing by Class-Division 1995 SIGMOD 6.7604747e-05
6,474 Indexing Multiple Sets 1994 VLDB 5.0500524e-05
7,507 Indexing and Selecting Hierarchical Business Logic 2015 VLDB 4.7180617e-05
7,550 The hcC-tree: An Efficient Index Structure For Object Oriented Databases 1994 VLDB 4.713674e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
187 Object and File Management in the EXODUS Extensible Database System 1986 VLDB 0.00036020812
1,719 Implementation Techniques of Complex Objects 1986 VLDB 0.00010787268
2,008 Access Support in Object Bases 1990 SIGMOD 9.8029112e-05
Previous Page 1 / 1 Next

Semantically Similar Papers