Range-Based Bitmap Indexing for High Cardinality Attributes with Skew

  title={Range-Based Bitmap Indexing for High Cardinality Attributes with Skew},
  author={Kun-Lung Wu and Philip S. Yu},
Bitmap indexing, though e ective for low cardinality attributes, can be rather costly in storage overhead for high cardinality attributes. Range-based bitmap (RBM) indexing can be used to reduce this storage overhead. The attribute values are partitioned into ranges and a bitmap vector is used to represent a range. With RBM, however, the number of records assigned to di erent ranges can be highly uneven, resulting in non-uniform search times for di erent queries. We present and evaluate a… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS


Publications citing this paper.

73 Citations

Citations per Year
Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 16 references

Range-based bitmap indexing for high cardinality attributes with skew,

  • K.-L. Wu, P. S. Yu
  • tech. rep., IBM Research Report,
  • 1996
2 Excerpts

\One size ts all" database architectures do not work for DSS,

  • C. D. French
  • in Proc. of ACM SIGMOD Int. Conf. on Management…
  • 1995
2 Excerpts

and M

  • M. Kitsuregawa, M. Nakayama
  • Takagi, \The e ect of bucket size tuning in the…
  • 1990
2 Excerpts

and C

  • T. Sellis, N. Roussopoulos
  • Faloutsos, \The R-tree: A dynamic index for multi…
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…