Optimizing I/O costs of multi-dimensional queries using bitmap indices

Lecture Notes in Computer Science

Volumn 3588, Issue , 2005, Pages 220-229

  Rotem, Doron ^a   Stockinger, Kurt ^a   Wu, Kesheng ^a  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA REDUCTION; DATA STRUCTURES; DATA WAREHOUSES; OPTIMIZATION; QUERY LANGUAGES; VECTORS; BINS; COSTS; DATA HANDLING; EXPERT SYSTEMS; SORTING;

BITMAP INDICES; MULTI-DIMENSIONAL QUERIES; QUERY DISTRIBUTION; QUERY SELECTIVITY; BINNING STRATEGY; EFFICIENT DATA STRUCTURES; QUERY CONSTRAINTS; QUERY DISTRIBUTIONS; SCIENTIFIC DATA ANALYSIS; WAREHOUSE APPLICATIONS;

INPUT OUTPUT PROGRAMS; QUERY PROCESSING;

EID: 26844475424     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11546924_22     Document Type: Conference Paper

References (14)

1. C. Y. Chan and Y. E. loannidis. An Efficient Bitmap Encoding Scheme for Selection Queries. In SIGMOD, Philadelphia, Pennsylvania, USA, June 1999. ACM Press.
2. S. Chaudhuri and U. Dayal. An Overview of Data wharehousing and OLAP Technology. ACM SIGMOD Record, 26(1):65-74, March 1997.
3. S. Guha, N. Koudas, and D. Srivastava. Fast Algorithms For Hierarchical Range Histogram Construction. In PODS 2002, Madison, Wisconsin, USA, June 2002. ACM Press.
4. T. Johnson. Performance Measurements of Compressed Bitmap Indices. In International Conference on Very Large Data Bases, Edinburgh, Scotland, September 1999. Morgan Kaufmann.
5. N. Koudas. Space Efficient Bitmap Indexing. In International Conference on Information and Knowledge Management, McLean, Virginia, USA, November 2000. ACM Press.
6. N. Koudas, S. Muthukrishnan, and D. Srivastava. Optimal Histograms for Hierarchical Range Queries. In PODS, Dallas, Texas, USA, 2000. ACM Press.
7. A. E. Mohr. Bit Allocation in Sub-linear Time and the Multiple-Choice Knapsack Problem. In Data Compression Conference, Snao Bird, Utah, USA, March 2002. IEEE Computer Society Press.
8. P. O'Neil. Model 204 Architecture and Performance. In 2nd International Workshop in High Performance Transaction Systems, Asilomar, California, USA, 1987. Springer-Verlag.
9. P. O'Neil and D. Quass. Improved Query Performance with Variant Indexes. In Proceedings ACM SIGMOD International Conference on Management of Data, Tucson, Arizona, USA, May 1997. ACM Press.
10. D. Rotem, K. Stockinger, and K. Wu. Efficient Binning for Bitmap Indices on High-Cardinality Attributes. Technical report, Berkeley Lab, November 2004.
11. K. Stockinger, K. Wu, and A. Shoshani. Evaluation Strategies for Bitmap Indices with Binning. In International Conference on Database and Expert Systems Applications (DEXA), Zaragoza, Spain, September 2004. Springer-Verlag.
12. K. Wu, E. J. Otoo, and A. Shoshani. On the Performance of Bitmap Indices for High Cardinality Attributes. In International Conference on Very Large Data Bases, Toronto, Canada, September 2004. Morgan Kaufmann.
13. K.-L. Wu and P.S. Yu. Range-Based Bitmap Indexing for High-Cardinality Attributes with Skew. Technical report, IBM Watson Research Center, May 1996.
14. M.-C. Wu and A. P. Buchmann. Encoded Bitmap Indexing for Data Warehouses. In International Conference on Data Engineering, Orlando, Florida, USA, February 1998. IEEE Computer Society Press.