On B-tree Indices for Skewed Distributions
Summary: Geometric growth for postings in B-tree indices under skewed distributions. Achieves 1-disk-access searches and uses 55–66% of the space of fixed-length postings lists, outperforming straightforward approaches. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 100 | On the Propagation of Errors in the Size of Join Results | 1991 | SIGMOD | 0.00050033475 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,473 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0427056e-05 |
| 4,317 | Compact B-Trees | 1979 | SIGMOD | 6.2824978e-05 |
| 1,909 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB | 0.00010123661 |
| 5,217 | Multi-Disk B-trees | 1991 | SIGMOD | 5.621547e-05 |
| 9,410 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3399748e-05 |
| 14,362 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD | - |
| 10,380 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD | 4.1905499e-05 |
| 13,086 | Experiments With B-Tree Reorganization | 1980 | SIGMOD | 4.1905499e-05 |
| 8,185 | Two is Better Than One: The Case for 2-Tree for Skewed Data Sets | 2023 | CIDR | 4.5614825e-05 |
| 4,669 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0039237e-05 |