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

Summary: BUB-Tree mitigates UB-Tree dead space by storing populated Z-intervals in a B-Tree rather than Z-separators. Dynamic Z-distance/dead-space splitting and NextJumpIn/Out queries preserve logarithmic operations while rivaling or outperforming R*-Trees. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 9146
Venue: VLDB
Year: 2002
Pagerank: -
Overall Rank: 14,062 | 3.86%
DOI: -

Incoming Non-self Citations Over Time

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

Authors

1. Robert Fenk (Bavarian Research Center for Knowledge-Based Systems)

BibTeX Citation

@article{fenk_vldb02,
        title = {{The BUB-Tree (bounding UB-Tree): dealing with dead space}},
        author = {Fenk, Robert},
        journal = {PVLDB},
        series = {{VLDB} '02},
        year = {2002}
}

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
1	9,365	Main-Memory Operation Buffering for Efficient R-Tree Update	2007	VLDB
2	8,968	Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes	2009	PODS
3	9,383	R-Tree Based Indexing of Now-Relative Bitemporal Data	1998	VLDB
4	1,066	On B-tree Indices for Skewed Distributions	1992	VLDB
5	2,034	Query and Update Efficient B+-Tree Based Indexing of Moving Objects	2004	VLDB
6	9,931	Adaptive Indexing of Objects with Spatial Extent	2023	VLDB
7	12,542	Worst-Case Efficient Range Search Indexing	2009	PODS
8	4,934	A General Solution of the n-dimensional B-tree Problem	1995	SIGMOD
9	944	The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems	1990	VLDB
10	2,164	Integrating the UB-Tree into a Database System Kernel	2000	VLDB