Multi-resolution bitmap indexes for scientific data

ACM Transactions on Database Systems

Volumn 32, Issue 3, 2007, Pages

  Sinha, Rishi Rakesh ^a,b   Winslett, Marianne ^a,b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b University of Illinois at Urbana Champaign

Author keywords

Bitmap index; Parallel index; Query processing; Scientific data management

Indexed keywords

ENCODING (SYMBOLS); NATURAL SCIENCES COMPUTING; PROBLEM SOLVING; QUERY PROCESSING; STORAGE ALLOCATION (COMPUTER); VIRTUAL REALITY;

BITMAP INDEX; PARALLEL INDEX; SCIENTIFIC DATA MANAGEMENT; SCIENTIFIC WORKLOADS;

INDEXING (OF INFORMATION);

EID: 34548455871     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1272743.1272746     Document Type: Article

References (37)

1. AMER-YAHIA, S. AND JOHNSON, T. 2000. Optimizing queries on compressed bitmaps. In Proceedings of the Very Large Data Bases Conference. 329-338.
2. ANTOSHENKOV, G. 1995. Byte-aligned bitmap compression. In DCC '95: Proceedings of the Conference on Data Compression (Washington, DC). IEEE Computer Society Press, Los Alamitos, CA, 476.
3. CHA, G.-H. 2003. Bitmap indexing method for complex similarity queries with relevance feedback. In Proceedings of ACM International Workshop on Multimedia Databases. ACM, New York, 55-62.
4. CHAN, C. AND IOANNIDIS, Y. 1999. An efficient bitmap encoding scheme for selection queries. In Proceedings of the ACM Conference on Management of Data (SIGMOD). ACM, New York, 215-226.
5. CHAN, C. Y. AND IOANNIDIS, Y. E. 1998. Bitmap index design and evaluation. In Proceedings of the ACM Conference on Management of Data (SIGMOD). ACM, New York, 355-366.
6. COPELAND, G. P. AND KHOSHAFIAN, S. 1985. A decomposition storage model. In Proceedings of the ACM Conference on Management of Data (SIGMOD), S. B. Navathe, Ed. ACM, New York, 268-279.
7. GORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2002. Introduction to Algorithms, Second ed. McGraw Hill, New York.
8. COVER, T. M. AND THOMAS, J. A. 2002. Elements of Information Theory, Second ed. Wiley-Interscience, New York,
9. DEPARTMENT OF ENERGY 2004. The Department of Energy Office of Science Data Management Challenge. http://www.sc.doe.gov/ascr/Final- report-v26.pdf.
10. GAEDE, V. AND GÜNTHER, O. 1998. Multidimensional access methods. ACM Comput. Surv. 30, 2, 170-231.
11. GUTTMAN, A. 1984. R-trees: A dynamic indexing structure for spatial searching. In Proceedings of the ACM Conference on Management of Data (SIGMOD). 47-57.
12. JEONG, J. AND NANG, J. 2004. An efficient bitmap indexing method for similarity search in high dimensional multimedia databases. In Proceedings of the IEEE International Conference on Multimedia and Expo. IEEE Computer Society Press, Los Alamitos, CA, 815-818.
13. JOHNSON, T. 1999. Performance measurements of compressed bitmap indices. In Proceedings of the Very Large Data Bases Conference. 278-289.
14. JÜRGENS, M. AND LENZ, H.-J. 2001. Tree based indexes versus bitmap indexes: A performance study. Int. J. Cooperat. Inf. Syst. 10, 3, 355-376.
15. KOUDAS, N. 2000. Space efficient bitmap indexing. In Proceedings of the Conference on Information and Knowledge Management. 194-201.
16. MITRA, S., SINHA, R. R., WINSLETT, M., AND JIAO, X. 2005. An efficient, non intrusive, log based I/O mechanism for scientific simulations on clusters. In Proceedings of the IEEE Cluster Conference. IEEE Computer Society Press, Los Alamitos, CA.
17. MORZY, M., MORZY, T., NANOPOULOS, A., AND MANOLOPOULOS, Y. 2003. Hierarchical bitmap index: An efficient and scalable indexing technique for set-valued attributes. In Proceedings of the East-European Conference on Advances in Databases and Information Systems. 236-252.
18. O'NEIL, P. 1987. Model 204 architecture and performance. In Proceedings of Conference on High Performance Transaction Systems. 40-59.
19. O'NEIL, P. AND QUASS, D. 1997. Improved query performance with variant indexes. In Proceedings of the ACM Conference on Management of Data (SIGMOD). ACM, New York, 38-49.
20. ROMIO. Romio: A high-performance, portable MPI-10 implementation. www.mcs.anl.gov/romio.
21. ROTEM, D., STOCKINGER, K., AND WU, K. 2005a. Optimizing candidate check costs for bitmap indices. In Proceedings of the Conference on Information and Knowledge Management. 648-655.
22. ROTEM, D., STOCKINGER, K., AND WU, K. 2005b. Optimizing I/O costs of multi-dimensional queries using bitmap indices. In Proceedings of the International Conference on Database and Expert System Applications. 220-229.
23. SINHA, R. R., MITRA, S., AND WINSLETT, M. 2006. Bitmap indexes for large scientific data sets: A case study. In Proceedings of the IEEE International Parallel & Distributed Proceessing Symposium. IEEE Computer Society Press, Los Alamitos, CA.
24. STOCKINGER, K. 2001. Design and implementation of bitmap indices for scientific data. In Proceedings of the International Database Engineering & Applications Symposium. 47-57.
25. STOCKINGER, K., DÜLLMANN, D., HOSCHEK, W., AND SCHIKUTA, E. 2000. Improving the performance of high-energy physics analysis through bitmap indices. In Proceedings of the International Conference on Database and Expert System Applications. 835-845.
26. STOCKINGER, K., WU, K., AND SHOSHANI, A. 2004. Evaluation strategies for bitmap indices with binning. In Proceedings of the International Conference on Database and Expert System Applications. 120-129.
27. VTune. http://www.intel.com/cd/software/products/asmo-na/eng/239144.htm.
28. WONG, H. K. T., LI, J., OLKEN, F., ROTEM, D., AND WONG, L. 1986. Bit transposition for very large scientific and statistical databases. Algorithmica 1, 3, 289-309.
29. WONG, H. K. T., LIU, H.-F., OLKEN, F., ROTEM, D., AND WONG, L. 1985. Bit transposed files. In Proceedings of the Very Large Data Bases Conference. 448-457.
30. WU, C.-L., KOH, J.-L., AND AN, P.-Y. 2005. Improved sequential pattern mining using an extended bitmap representation. In Proceedings of the International Conference on Database and Expert System Applications. 776-785.
31. WU, K., OTOO, E. J., AND SHOSHANI, A. 2002a. Compressing bitmap indexes for faster search operations. In Proceedings of the International Scientific and Statistical Database Management Conference. 99-108.
32. WU, K., OTOO, E. J., AND SHOSHANI, A. 2004. On the performance of bitmap indices for high cardinality attributes. In Proceedings of the Conference on Very Large Data Bases. 24-35.
33. WU, K., OTOO, E. J., AND SHOSHANI, A. 2006. Optimizing bitmap indices with efficient compression. ACM Trans. Datab. Syst. 31, 2, 1-38.
34. WU, K., OTOO, E. J., SHOSHANI, A., AND NORDBERG, H. 2002b. Notes on design and implementation of compressed bit vectors. Tech. Rep. LBNL/PUB-3161, Lawrence Berkeley National Laboratory.
35. WU, K.-L. AND YU, P. S. 1998. Range-based bitmap indexing for high cardinality attributes with skew. In Proceedings of the International Computer Software and Applications Conference. 61-67.
36. WU, M.-C. 1999. Query optimization for selections using bitmaps. In Proceedings of the ACM Conference on Management of Data (SIGMOD). ACM, New York, 227-238.
37. WU, M.-C. AND BUCHMANN, A. P. 1998. Encoded bitmap indexing for data warehouses. In Proceedings of the International Conference on Data Engineering. IEEE Computer Society Press, Los Alamitos, CA, 220-230.