Compressing bitmap indices by data reorganization

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 310-321

  Pinar, Ali ^a   Tao, Tao ^b   Ferhatosmanoglu, Hakan ^c  

^a LAWRENCE BERKELEY NATIONAL LABORATORY   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BITMAP INDICES; GRAY CODE ORDERING; REAL DATA SETS; SCIENTIFIC APPLICATIONS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMPRESSION; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; INDEXING (OF INFORMATION);

NATURAL SCIENCES COMPUTING;

EID: 28444450446     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.35     Document Type: Conference Paper

References (30)

1. S. Amer-Yahia and T. Johnson. Optimizing queries on compressed bitmaps. In VLDB, pages 329-338, 2000.
2. G. Antoshenkov. Byte-aligned bitmap compression. Technical Report, Oracle Corp., 1994. U.S. Patent number 5,363,098.
3. A.Shoshani, L.M.Bernardo, H.Nordberg, D.Rotem, and A.Sim. Multidimensinal indexing and query coordination for tertiary storage management. In SSDBM, pages 214-225, 1999.
4. S. Berchtold, C. Bohm, D. Keim, and H. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proc. ACM Symp. on Principles of Database Systems, pages 78-86, Tuscon, Arizona, June 1997.
5. S. Berchtold, D. Keim, and H. Kriegel. The X-tree: An index structure for high-dimensional data. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 28-39, Bombay, India, 1996.
6. C. Bohm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33:322-373, 2001.
7. K. Chakrabarti and S. Mehrotra. The hybrid tree: An index structure for high dimensional feature spaces. In Proc. Int. Conf. Data Engineering, pages 440-447, Sydney, Australia, 1999.
8. C.-Y Chan and Y. E. Ioannidis. Bitmap index design and evaluation. In SIGMOD, pages 355-366, 1998.
9. C.-Y Chan and Y. E. Ioannidis. An efficient bitmap encoding scheme for selection queries. In SIGMOD, pages 215-226, 1999.
10. V. Gaede and O. Gunther. Multidimensional access methods. ACM Computing Surveys, 30:170-231, 1998.
11. David S. Johnson, Shankar Krishnan, Jatin Chhugani, Subodh Kumar, and Suresh Venkatasubramanian. Compressing large boolean matrices using reordering techniques. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 13-23, 2004.
12. T. Johnson. Performance measurement of compressed bitmap indices. In VLDB, pages 278-289, 1999.
13. K. Lin, H. V. Jagadish, and C. Faloutsos. The TV-tree: An index structure for high-dimensional data. VLDB Journal, 3:517-542, 1995.
14. D. B. Lomet and B. Salzberg. The hb-tree: A multi-attribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625-658, December 1990.
15. P. O'Neil. Model 204 architecture and performance. In 2nd International Workshop in High Performance Transaction Systems, pages 40-59, Asilomar, CA, September 1987.
16. Ekow J. Otoo, Arie Shoshani, and Seung won Hwang. Clustering high dimensional massive scientific dataset. In SSDBM, pages 147-157, Fairfax, Virginia, July 2001.
17. A. Pinar and M. Heath. Improving performance of sparse matrix-vector multiplication. In Proc. of Supercomputing 99, 1999.
18. G. Reinelt. The traveling salesman: computational solutions for TSP applications. Springer-Verlag, Lecture Notes in Computer Science, Vol: 840, 1994.
19. D. Richards. Data compression and gray-code sorting. Information Processing Letters, 22:201-205, 1986.
20. D. Salomon. Data Compression 2nd edition. Springer Verlag, New York, 2000.
21. H. Samet. The Design and Analysis of Spatial Structures. Addison Wesley Publishing Company, Inc., Massachusetts, 1989.
22. SciDAC. Scientific data management center. http://sdm.lbl.gov/sdmcenter/, 2002.
23. SNAP. Supernova acceleration probe. http://snap.lbl.gov/, 2004.
24. K. Stockinger. Bitmap indices for speeding up high-dimensional data analysis. In DEXA, 2002.
25. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the Int. Conf. on Very Large Data Bases, pages 194-205, New York City, New York, August 1998.
26. K. Wu, E. J. Otoo, and A. Shoshani. A performance comparison of bitmap indexes. In Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, pages 559-561, Atlanta, Georgia, November 2001.
27. Kesheng Wu, Ekow J. Otoo, and Arie Shoshani. Compressing bitmap indexes for faster search operations. In SSDBM, pages 99-108, Edinburgh, Scotland, UK, July 2002.
28. Kesheng Wu, Ekow J. Otoo, and Arie Shoshani. An efficient compression scheme for bitmap indices. Technical Report 49626, LBNL, April 2004.
29. Kesheng Wu, Ekow J. Otoo, and Arie Shoshani. On the performance of bitmap indices for high cardinality attributes. Technical Report 54673, LBNL, March 2004.
30. M. J. Zaki and J. T. L. Wang. Special issue on bioinformatics and biological data management. Information Systems, 28:241-367, 2003.