The BUB-Tree (bounding UB-Tree) dealing with dead space

Summary: BUB-Tree extends UB-Tree by storing Z-intervals (zstart, zend) in a B-Tree to reduce dead space on skewed multidimensional data. Region splits target the largest Z-gaps with min-fill and gap thresholds; range queries reuse NextJumpIn/Out traversal, yielding compact, dynamic indexes competitive with the R*-Tree. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8956
Venue: VLDB
Year: 2002
Pagerank: -
Overall Rank: 13,824 | 3.93%
DOI: -

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Robert Fenk

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,168	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB	4.380727e-05
8,764	Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes	2009	PODS	4.4520434e-05
9,114	R-Tree Based Indexing of Now-Relative Bitemporal Data	1998	VLDB	4.3887024e-05
639	On B-tree Indices for Skewed Distributions	1992	VLDB	0.00018782897
1,766	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB	0.00010611043
9,769	Adaptive Indexing of Objects with Spatial Extent	2023	VLDB	4.2815042e-05
12,302	Worst-Case Efficient Range Search Indexing	2009	PODS	4.1905499e-05
4,669	A General Solution of the n-dimensional B-tree Problem	1995	SIGMOD	6.0039237e-05
833	The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems	1990	VLDB	0.00016085787
2,492	Integrating the UB-Tree into a Database System Kernel	2000	VLDB	8.649434e-05