Database Paper Browser

Back to papers

On the Performance of Bitmap Indices for High Cardinality Attributes

Summary: Systematic analysis of BBC and WAH bitmap compression for high-cardinality attributes; proposes a strategy to select the optimal scheme. Compressed bitmap indices remain smaller than B-trees and viable for both low and high cardinalities. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9181
Venue
VLDB
Year
2004
Pagerank
7.778912e-05
Overall Rank
2,986 | 79.23%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

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.

Rank Cited Paper Year Venue Pagerank
121 Improved Query Performance with Variant Indexes 1997 SIGMOD 0.00045447517
832 Bit Transposed Files 1985 VLDB 0.00016152615
1,035 Bitmap Index Design and Evaluation 1998 SIGMOD 0.00014532778
1,704 An Efficient Bitmap Encoding Scheme for Selection Queries 1999 SIGMOD 0.000108332
1,951 Performance Measurements of Compressed Bitmap Indices 1999 VLDB 9.9685919e-05
2,061 Optimizing Queries On Compressed Bitmaps 2000 VLDB 9.6529345e-05
Previous Page 1 / 1 Next

Semantically Similar Papers