Database Paper Browser

Back to papers

The hBII-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation

Summary: Introduces hBII-tree, a modified hB-tree integrating II-tree concurrency, recovery, and node consolidation. It corrects the hB-tree split/post flaws, enables robust multi-attribute and spatial indexing within a general-purpose DBMS. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
8298
Venue
VLDB
Year
1995
Pagerank
4.9330419e-05
Overall Rank
6,764 | 52.95%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
1,002 On Indexing Mobile Objects 1999 PODS 0.00014702555
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.0032169493
24 The R+-Tree: A Dynamic Index For Multi-Dimensional Objects 1987 VLDB 0.00083378538
216 A Class of Data Structures for Associative Searching 1984 PODS 0.00033542705
668 The Sequoia 2000 Storage Benchmark 1993 SIGMOD 0.00018430721
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
3,244 Access Method Concurrency with Recovery 1992 SIGMOD 7.3262881e-05
Previous Page 1 / 1 Next

Semantically Similar Papers