Strategies for processing ad hoc queries on large data warehouses

ACM International Workshop on Data Warehousing and OLAP (DOLAP)

Volumn , Issue , 2002, Pages 72-79

  Stockinger, Kurt ^a   Wu, Kesheng ^b   Shoshani, Arie ^b  

^a CERN   (Switzerland)

^b LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DATA STRUCTURES; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL SYSTEMS; PERFORMANCE; QUERY LANGUAGES;

BITMAP INDEX; WORD ALIGNED HYBRID CODE;

DATA WAREHOUSES;

EID: 0242624765     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583890.583901     Document Type: Conference Paper

References (19)

1. S. Amer-Yahia and T. Johnson. Optimizing Queries on Compressed Bitmaps. In Proceedings of VLDB 2000, pages 329-338. Morgan Kaufmann, 2000.
2. G. Antoshenkov. Byte-Aligned Bitmap Compression. Technical Report, Oracle Corp., 1994. U.S. Patent number 5,363,098.
3. G. Antoshenkov and M. Ziauddin. Query Processing and Optimization in ORACLE RDB. The VLDB Journal, 5:229-237, 1996.
4. R. Bayer. The Universal B-tree for Multidimensional Indexing. In Proc. of Intl. Conf. on World-Wide Computing and Its Applications, pages 98-112. Springer-Verlag, 1997.
5. C.-Y. Chan and Y. E. Ioannidis. Bitmap Index Design and Evaluation. In Proceedings of SIGMOD 1998. ACM Press, 1998.
6. C. Y. Chan and Y. E. Ioannidis. An Efficient Bitmap Encoding Scheme for Selection Queries. In Proceedings of SIGMOD 1999. ACM Press, 1999.
7. S. Chaudhuri and U. Dayal. An Overview of Data Warehousing and OLAP Technology. ACM SIGMOD Record, 26(1):65-74, March 1997.
8. D. Comer. The Ubiquitous B-Tree. Computing Surveys, 11(2):121-137, 1979.
9. V. Gaede and O. Günther. Multidimension access methods. ACM Computing Surveys, 30(2):170-231, 1998.
10. T. Johnson. Performance Measurements of Compressed Bitmap Indices. In Proceedings of VLDB'99, pages 278-289. Morgan Kaufmann, 1999.
11. M. Jürgens and H.-J. Lenz. Tree Based Indexes vs. Bitmap Indexes - a Performance Study. International Journal of Cooperative Information Systems, 10(3):355-376, 2001.
12. V. Markl and R. Bayer. Processing Relational OLAP Queries with UB-Trees and Multidimensional Hierarchical Clustering. In Proceedings of DMDW 2000, June 5-6, 2000.
13. P. O'Neil. Model 204 Architecture and Performance. In 2nd International Workshop in High Performance Transaction Systems, Asilomar, CA, pages 40-59, September 1987.
14. P. O'Neil and D. Quass. Improved Query Performance With Variant Indices. In Proceedings of SIGMOD'97, pages 38-49. ACM Press, 1997.
15. A. Shoshani, L. M. Bernardo, H. Nordberg, D. Rotem, and A. Sim. Multidimensional Indexing and Query Coordination for Tertiary Storage Management. In Proceedings of SSDBM'99, pages 214-225. IEEE Computer Society Press, 1999.
16. K. Stockinger, D. Duellmann, W. Hoschek, and E. Schikuta. Improving the Performance of High-Energy Physics Analysis through Bitmap Indices. In DEXA 2000. Springer-Verlag 2000.
17. K. Stockinger. Bitmap Indices for Speeding Up High-Dimensional Data Analysis. In DEXA 2002. Springer-Verlag, 2002.
18. K. Wu, E. J. Otoo, and A. Shoshani. A Performance Comparison of Bitmap Indexes. In Proceedings of CIKM 2001, pages 559-561. ACM Press, 2001.
19. K. Wu, E. J. Otoo, A. Shoshani, and H. Nordberg. Notes on Design and Implementation of Compressed Bit Vectors. Technical Report LBNL/PUB-3161, Lawrence Berkeley National Laboratory, Berkeley, CA, 2001.