A Compact B-tree
Summary: Patricia-tree on-page inside a B-tree for OLTP workloads, replacing the per-page sorted key array with a local Patricia index for compact node storage. Prototype in iAnywhere ASA 8.0 shows substantial space savings and performance gains over existing ASA indexes. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Peter Bumbulis (iAnywhere Solutions)
- 2. Ivan T. Bowman
BibTeX Citation
@inproceedings{bumbulis_sigmod02,
title = {{A Compact B-tree}},
author = {Bumbulis, Peter and Bowman, Ivan T.},
series = {{SIGMOD} '02},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/564691.564753},
url = {https://dl.acm.org/doi/10.1145/564691.564753},
year = {2002}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 5.256602e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 430 | A Fast Index for Semistructured Data | 2001 | VLDB | 0.00018600166 |
| 1,813 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD | 9.6941032e-05 |
| 2,648 | On Effective Multi-Dimensional Indexing for Strings | 2000 | SIGMOD | 8.2957097e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,813 | Main-Memory Index Structures with Fixed-Size Partial Keys | 2001 | SIGMOD |
| 2 | 6,879 | Oracle8i Index-Organized Table and its Application to New Domains | 2000 | VLDB |
| 3 | 13,036 | New Concurrency Control Algorithms for Accessing and Compacting B-Trees | 1994 | VLDB |
| 4 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 5 | 14,549 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD |
| 6 | 7,189 | BP-tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-trees | 2023 | VLDB |
| 7 | 8,943 | Compact O-Complete Trees | 1988 | VLDB |
| 8 | 14,479 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD |
| 9 | 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD |
| 10 | 6,246 | Compact B-Trees | 1979 | SIGMOD |