Multi-Table Search For B-Tree Files
Summary: Multi-table search method for B-tree index entries, optimized for variable-length keys produced by compression. Analysis shows significant space savings and reduced disk accesses, with search algorithms competitive with the best variable-length entry methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
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 |
|---|
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,226 | A High Performance, Universal, Key Associative Access Method | 1983 | SIGMOD | 6.3465691e-05 |
| 9,498 | Memory-Efficient Search Trees for Database Management Systems | 2021 | SIGMOD | 4.3341665e-05 |
| 4,672 | A General Solution of the n-dimensional B-tree Problem | 1995 | SIGMOD | 6.0085156e-05 |
| 5 | The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes | 1981 | SIGMOD | 0.0018397217 |
| 14,282 | Performance Comparison Of Index Structures For Multi-Key Retrieval | 1984 | SIGMOD | - |
| 4,324 | Compact B-Trees | 1979 | SIGMOD | 6.2885419e-05 |
| 9,404 | Revisiting B-tree Compression: An Experimental Study | 2024 | SIGMOD | 4.3441378e-05 |
| 14,278 | An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees | 1984 | SIGMOD | - |
| 8,773 | Compact O-Complete Trees | 1988 | VLDB | 4.456315e-05 |
| 6,480 | Efficient Search of Multidimensional B-Trees | 1995 | VLDB | 5.0475112e-05 |