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

Summary: hB-Pi-tree adapts the dimensionality-insensitive, multi-attribute hB-tree to Pi-tree protocols, correcting split/post flaws while enabling high-concurrency recovery through short atomic structural actions. Adds node consolidation, making it viable for general-purpose spatial and multidimensional DBMSs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h81b4385c796c8b53
Venue: VLDB
Year: 1995
Pagerank: 5.5230036e-05
Overall Rank: 7,454 | 49.89%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Georgios Evangelidis
2. David Lomet (Microsoft)
3. Betty Salzberg (Northeastern University)

BibTeX Citation

@article{evangelidis_vldb95,
        title = {{The hB-Pi-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation}},
        author = {Evangelidis, Georgios and Lomet, David and Salzberg, Betty},
        journal = {PVLDB},
        series = {{VLDB} '95},
        pages = {551},
        year = {1995}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
926	On Indexing Mobile Objects	1999	PODS	0.00013047723

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.001992968
44	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00045337853
264	A Class of Data Structures for Associative Searching	1984	PODS	0.00022757762
665	The Sequoia 2000 Storage Benchmark	1993	SIGMOD	0.00014990574
1,692	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	9.8570044e-05
3,170	Access Method Concurrency with Recovery	1992	SIGMOD	7.5691807e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,191	H-trees: A Dynamic Associative Search Index for OODB	1992	SIGMOD
2	7,816	B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases	2023	VLDB
3	2,263	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
4	7,831	The hcC-tree: An Efficient Index Structure For Object Oriented Databases	1994	VLDB
5	8,222	The HV-tree: a Memory Hierarchy Aware Version Index	2010	VLDB
6	6,584	Efficient Search of Multidimensional B-Trees	1995	VLDB
7	3,176	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS
8	3,375	A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms	2016	SIGMOD
9	13,326	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
10	3,170	Access Method Concurrency with Recovery	1992	SIGMOD