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
- 1. Christos Faloutsos (University of Maryland)
- 2. H. V. Jagadish (AT&T)
BibTeX Citation
@article{faloutsos_vldb92,
title = {{On B-tree Indices for Skewed Distributions}},
author = {Faloutsos, Christos and Jagadish, H. V.},
journal = {PVLDB},
series = {{VLDB} '92},
pages = {363},
year = {1992}
}
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 |
|---|---|---|---|---|
| 89 | On the Propagation of Errors in the Size of Join Results | 1991 | SIGMOD | 0.00035031529 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,451 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB |
| 2 | 6,246 | Compact B-Trees | 1979 | SIGMOD |
| 3 | 1,492 | BF-Tree: Approximate Tree Indexing | 2014 | VLDB |
| 4 | 5,120 | Multi-Disk B-trees | 1991 | SIGMOD |
| 5 | 9,518 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD |
| 6 | 14,549 | Multi-Table Search For B-Tree Files | 1979 | SIGMOD |
| 7 | 9,810 | B-Trees Are Back: Engineering Fast and Pageable Node Layouts | 2025 | SIGMOD |
| 8 | 13,274 | Experiments With B-Tree Reorganization | 1980 | SIGMOD |
| 9 | 8,016 | Two is Better Than One: The Case for 2-Tree for Skewed Data Sets | 2023 | CIDR |
| 10 | 4,914 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD |