Database Paper Browser

Back to papers

Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes

Summary: Gives the first I/O‑optimal secondary index for a string x over ordered alphabet Σ: answers alphabet‑range queries reading (with internal memory (|Σ| log n)^δ blocks) within a constant factor of the information‑theoretic minimum. Uses O(n log|Σ|) bits (0th‑order entropy bound), supports update time–space tradeoffs, and an approximate variant that reduces query I/O to O(|I[a_l,a_r]| log(1/ε)) bits with false‑positive probability ε. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1490
Venue
PODS
Year
2009
Pagerank
4.1945683e-05
Overall Rank
12,295 | 14.47%
DOI
-

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 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers