Sorting improves word-aligned bitmap indexes

Data and Knowledge Engineering

Volumn 69, Issue 1, 2010, Pages 3-28

  Lemire, Daniel ^a   Kaser, Owen ^b   Aouiche, Kamel ^a  

^a UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

^b UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

Compression; Gray codes; Indexing; Multidimensional databases

Indexed keywords

BIT MAPS; BITMAP INDEXES; EFFICIENT ALGORITHM; GRAY CODES; INPUT/OUTPUT; LOGICAL OPERATIONS; MULTIDIMENSIONAL DATABASE; RUN-LENGTH ENCODING; WORD LENGTH;

ALGORITHMS; COST REDUCTION; PROGRAM PROCESSORS;

INDEXING (OF INFORMATION);

EID: 71649087409     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.08.006     Document Type: Article

References (48)

1. Bellatreche L., Missaoui R., Necir H., and Drias H. Selection and pruning algorithms for bitmap index selection problem using data mining. DaWaK 2007. LNCS vol. 4654 (2007), Springer 221-230
2. Davis K., and Gupta A. Data Warehouses and OLAP: Concepts, Architectures, and Solutions (2007), IRM Press (Chapter Indexing in Data Warehouses)
3. Wu K., Otoo E.J., and Shoshani A. Optimizing bitmap indices with efficient compression. ACM Transactions on Database Systems 31 1 (2006) 1-38
4. C.Y. Chan, Y.E. Ioannidis, Bitmap index design and evaluation, in: SIGMOD'98, 1998, pp. 355-366.
5. G. Antoshenkov, Byte-aligned bitmap compression, in: DCC'95, 1995, p. 476.
6. K. Wu, E.J. Otoo, A. Shoshani, A performance comparison of bitmap indexes, in: CIKM '01, 2001, pp. 559-561.
7. Sharma Y., and Goyal N. An efficient multi-component indexing embedded bitmap compression for data reorganization. Information Technology Journal 7 1 (2008) 160-164
8. T. Apaydin, A. Şaman Tosun, H. Ferhatosmanoglu, Analysis of basic data reordering techniques, in: SSDBM 2008, LNCS, vol. 5096, 2008, pp. 517-524.
9. A. Pinar, T. Tao, H. Ferhatosmanoglu, Compressing bitmap indices by data reorganization, in: ICDE'05, 2005, pp. 310-321.
10. G. Canahuate, H. Ferhatosmanoglu, A. Pinar, Improving bitmap index compression by data reorganization, (checked 2008-12-15), 2006. .
11. O. Kaser, D. Lemire, K. Aouiche, Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes, in: DOLAP '08, 2008.
12. P.E. O'Neil, Model 204 architecture and performance, in: 2nd International Workshop on High Performance Transaction Systems, 1989, pp. 40-59.
13. Hammer J., and Fu L. CubiST++: evaluating ad-hoc CUBE queries using statistics trees. Distributed and Parallel Databases 14 3 (2003) 221-254
14. V. Sharma, Bitmap index vs. b-tree index: Which and when? March 2005. .
15. R. Weber, H.-J. Schek, S. Blott, A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces, in: VLDB '98, 1998, pp. 194-205.
16. K. Aouiche, D. Lemire, A comparison of five probabilistic view-size estimation techniques in OLAP, in: DOLAP'07, 2007, pp. 17-24.
17. H.K.T. Wong, H.F. Liu, F. Olken, D. Rotem, L. Wong, Bit transposed files, in: VLDB 85, 1985, pp. 448-457.
18. N. Koudas, Space efficient bitmap indexing, in: CIKM '00, 2000, pp. 194-201.
19. D. Rotem, K. Stockinger, K. Wu, Minimizing I/O costs of multi-dimensional queries with bitmap indices, in: SSDBM '06, 2006, pp. 33-44.
20. K. Stockinger, K. Wu, A. Shoshani, Evaluation strategies for bitmap indices with binning, in: DEXA '04, 2004.
21. R. Darira, K.C. Davis, J. Grommon-Litton, Heuristic design of property maps, in: DOLAP'06, 2006, pp. 91-98.
22. Sinha R.R., and Winslett M. Multi-resolution bitmap indexes for scientific data. ACM Transaction Database System 32 3 (2007) 16
23. R. Pagh, S.S. Rao, Secondary indexing in one dimension: Beyond b-trees and bitmap indexes, 2008. .
24. K. Stockinger, K. Wu, A. Shoshani, Strategies for processing ad hoc queries on large data warehouses, in: DOLAP'02, 2002, pp. 72-79.
25. K. Wu, E.J. Otoo, A. Shoshani, H. Nordberg, Notes on design and implementation of compressed bit vectors, Tech. Rep. LBNL/PUB-3161, Lawrence Berkeley National Laboratory, 2001. .
26. Jurgens M., and Lenz H.J. Tree based indexes versus bitmap indexes: a performance study. International Journal of Cooperative Information Systems 10 3 (2001) 355-376
27. K. Wu, E. Otoo, A. Shoshani, On the performance of bitmap indices for high cardinality attributes, in: VLDB'04, 2004, pp. 24-35.
28. N. Christofides, Worst-case analysis of a new heuristic for the travelling salesman problem, Tech. Rep. 388, Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
29. A. Pinar, M.T. Heath, Improving performance of sparse matrix-vector multiplication, in: Supercomputing '99, 1999.
30. Graefe G. Implementing sorting in database systems. ACM Computer Survey 38 3 (2006) 10
31. Yiannis J., and Zobel J. Compression techniques for fast external sorting. The VLDB Journal 16 2 (2007) 269-291
32. Cai J., and Paige R. Using multiset discrimination to solve language processing problems without hashing. Theoretical Computer Science 145 1-2 (1995) 189-228
33. Ernvall J. On the construction of spanning paths by Gray-code in compression of files. TSI. Technique et Science Informatiques 3 6 (1984) 411-414
34. Richards D. Data compression and Gray-code sorting. Information Processing Letters 22 4 (1986) 201-205
35. M. Hirabayashi, QDBM: Quick database manager, (checked 2008-02-22), 2006. http://qdbm.sourceforge.net.
36. Knuth D.E. The Art of Computer Programming vol. 4 (2005), Addison Wesley (Chapter, fascicle 2)
37. Goddyn L., and Gvozdjak P. Binary gray codes with long bit runs. Electronic Journal of Combinatorics 10 R27 (2003) 1-10
38. Savage C., and Winkler P. Monotone gray codes and the middle levels problem. Journal of Combinatorial Theory A 70 2 (1995) 230-248
39. Hitachi Global Storage Technologies, Deskstar P7K500 (last checked 2008-12-21). .
40. Dell, Specifications: Hitachi Deskstar P7K500 User's Guide (last checked 2008-12-21). .
41. S. Hettich, S.D. Bay, The UCI KDD archive (checked 2008-04-28), 2000. .
42. TPC, DBGEN 2.4.0 (checked 2007-12-4), 2006. .
43. Netflix, Inc., Nexflix prize (checked 2008-04-28), 2007. .
44. Project Gutenberg Literary Archive Foundation, Project Gutenberg (checked 2007-05-30), 2007. http://www.gutenberg.org.
45. Porter M.F. An algorithm for suffix stripping. Readings in Information Retrieval (1997), Morgan-Kaufmann 313-316
46. O. Kaser, S. Keith, D. Lemire, The LitOLAP project: Data warehousing with literature, in: CaSTA'06, 2006. .
47. M. Stonebraker, D.J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O'Neil, P. O'Neil, A. Rasin, N. Tran, S. Zdonik, C-store: a column-oriented DBMS, in: VLDB'05, 2005, pp. 553-564.
48. D. Abadi, S. Madden, M. Ferreira, Integrating compression and execution in column-oriented database systems, in: SIGMOD '06, 2006, pp. 671-682.