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: 8489
Venue: VLDB
Year: 1995
Pagerank: 5.6494751e-05
Overall Rank: 7,310 | 49.85%
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
896	On Indexing Mobile Objects	1999	PODS	0.0001334014

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.0020210012
42	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00046170812
253	A Class of Data Structures for Associative Searching	1984	PODS	0.00023200431
650	The Sequoia 2000 Storage Benchmark	1993	SIGMOD	0.00015319951
1,663	Performance of B-Tree Concurrency Control Algorithms	1991	SIGMOD	0.00010073735
3,114	Access Method Concurrency with Recovery	1992	SIGMOD	7.7405805e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,020	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB
2	8,255	B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases	2023	VLDB
3	2,227	Concurrency and Recovery in Generalized Search Trees	1997	SIGMOD
4	7,678	The hcC-tree: An Efficient Index Structure For Object Oriented Databases	1994	VLDB
5	8,207	The HV-tree: a Memory Hierarchy Aware Version Index	2010	VLDB
6	6,451	Efficient Search of Multidimensional B-Trees	1995	VLDB
7	3,115	Extendible Hashing for Concurrent Operations and Distributed Data	1983	PODS
8	13,036	New Concurrency Control Algorithms for Accessing and Compacting B-Trees	1994	VLDB
9	3,378	A Hybrid B+-tree as Solution for In-Memory Indexing on CPU-GPU Heterogeneous Computing Platforms	2016	SIGMOD
10	3,114	Access Method Concurrency with Recovery	1992	SIGMOD