Integrating the UB-Tree into a Database System Kernel
Summary: Integrating the UB-Tree into a DBMS kernel leverages the B-Tree base to reduce complexity and enable tight coupling with the query optimizer. Real-world data warehouse experiments show kernel integration outperforming prototypes and competing access methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Frank Ramsak (Bayerisches Forschungszentrum für Wissensbasierte Systeme)
- 2. Volker Markl (Bayerisches Forschungszentrum für Wissensbasierte Systeme)
- 3. Robert Fenk (Bayerisches Forschungszentrum für Wissensbasierte Systeme)
- 4. Martin Zirkel (Technical University of Munich)
- 5. Klaus Elhardt (TransAction Software GmbH)
- 6. Rudolf Bayer (Bayerisches Forschungszentrum für Wissensbasierte Systeme; Technical University of Munich)
BibTeX Citation
@article{ramsak_vldb00,
title = {{Integrating the UB-Tree into a Database System Kernel}},
author = {Ramsak, Frank and Markl, Volker and Fenk, Robert and Zirkel, Martin and Elhardt, Klaus and Bayer, Rudolf},
journal = {PVLDB},
series = {{VLDB} '00},
pages = {263},
year = {2000}
}
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 101 | Selectivity Estimation Without the Attribute Value Independence Assumption | 1997 | VLDB | 0.00034376651 |
| 202 | Generalized Search Trees for Database Systems (Extended Abstract) | 1995 | VLDB | 0.00025454884 |
| 253 | A Class of Data Structures for Associative Searching | 1984 | PODS | 0.00023200431 |
| 1,053 | Multi-dimensional Selectivity Estimation Using Compressed Histogram Information | 1999 | SIGMOD | 0.00012401532 |
| 3,057 | High-Concurrency Locking in R-Trees | 1995 | VLDB | 7.807389e-05 |
| 5,173 | High-Performance Extensible Indexing | 1999 | VLDB | 6.3341007e-05 |
| 6,605 | High Level Indexing of User-Defined Types | 1999 | VLDB | 5.8240191e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,901 | A Generic Approach to Bulk Loading Multidimensional Index Structures | 1997 | VLDB |
| 2 | 1,551 | Updatable Learned Index with Precise Positions | 2021 | VLDB |
| 3 | 12,757 | Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases | 2005 | VLDB |
| 4 | 2,396 | A Novel Index Supporting High Volume Data Warehouse Insertions | 1999 | VLDB |
| 5 | 5,423 | Updatable Learned Indexes Meet Disk-Resident DBMS - From Evaluations to Design Choices | 2023 | SIGMOD |
| 6 | 1,486 | Indexing Multi-Dimensional Uncertain Data with Arbitrary Probability Density Functions | 2005 | VLDB |
| 7 | 14,011 | The BUB-Tree (bounding UB-Tree): dealing with dead space | 2002 | VLDB |
| 8 | 2,020 | Query and Update Efficient B+-Tree Based Indexing of Moving Objects | 2004 | VLDB |
| 9 | 8,937 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 10 | 6,451 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |