Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 846-857

  Apaydin, Tan ^a   Canahuate, Guadalupe ^a   Ferhatosmanoglu, Hakan ^a   Tosun, Ali Şaman ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; ECONOMIC AND SOCIAL EFFECTS; ENCODING (SYMBOLS); SIGNAL ENCODING;

APPROXIMATE RESULTS; BIT MAPS; BITMAP INDEXES; COMPRESSION TECHNIQUES; ENCODING SCHEMES; ENCODINGS; MULTIPLE HASHING; ROW-COLUMN; RUN-LENGTH ENCODING; STORAGE PERFORMANCE;

QUERY PROCESSING;

EID: 85134366247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. S. Amer-Yahia and T. Johnson. Optimizing queries on compressed bitmaps. In The VLDB Journal, pages 329–338, 2000.
2. G. Antoshenkov. Byte-aligned bitmap compression. Technical Report, Oracle Corp., 1994. U.S. Patent number 5,363,098.
3. G. Antoshenkov. Byte-aligned bitmap compression. In Data Compression Conference, Nashua, NH, 1995. Oracle Corp.
4. G. Antoshenkov and M. Ziauddin. Query processing and optimization in oracle rdb. The VLDB Journal, 1996.
5. B. Bloom. Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM, 13(7):422–426, July 1970.
6. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey. In Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, pages 636–646, 2002.
7. J. Byers, J. Considine, M. Mitzenmacher, and S. Rost. Informed content delivery across adaptive overlay networks. Proceedings of ACM SIGCOMM, August 2002, pp. 47-60, August 2002.
8. C.Y. Chan and Y.E. Ioannidis. Bitmap index design and evaluation. In Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pages 355–366. ACM Press, 1998.
9. C.Y. Chan and Y.E. Ioannidis. An efficient bitmap encoding scheme for selection queries. SIGMOD Rec., 28(2):215–226, 1999.
10. Wu chang Feng, D.D. Kandlur, D. Saha, and K.G. Shin. Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. In Proc. of INFOCOM, volume 3, pages 1520 – 1529, April 2001.
11. B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal. Compactly encoding a function with static support in order to support approximate evaluations queries. Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 2004.
12. H. Edelstein. Faster data warehouses. Information Week, December 1995.
13. L. Fan, P. Cao, J. Almeida, and A. Broder. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. In IEEE/ACM Transactions on Networking, Canada, 2000.
14. L. Fan, P. Cao, J. Almeida, and A. Broder. Web cache sharing. Collaborating Web caches use bloom filter to represent local set of cached files to reduce the netwrok traffic. In IEEE/ACM Transactions on Networking, 2000.
15. Informix Inc. Informix decision support indexing for the enterprise data warehouse. http://www.informix.com/informix/corpinfo/zines/whiteidx.htm.
16. Sybase Inc. Sybase IQ Indexes, chapter 5: Sybase IQ Release 11.2 Collection. March 1997.
17. D. Johnson, S. Krishnan, J. Chhugani, S. Kumar, and S. Venkatasubramanian. Compressing large boolean matrices using reordering techniques. In VLDB 2004.
18. T. Johnson. Performance measurement of compressed bitmap indices. In VLDB, pages 278–289, 1999.
19. J. Chen K. Wu, W. Koegler and A. Shoshani. Using bitmap index for interactive exploration of large datasets. In Proceedings of SSDBM, 2003.
20. N. Koudas. Space efficient bitmap indexing. In Proceedings of the ninth international conference on Information and knowledge management, pages 194–201. ACM Press, 2000.
21. A. Kumar, J.J. Xu, and J. Wang L. Li. Algorithms: Space-code bloom filter for efficient traffic flow measurement. In Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, October 2003.
22. A. Kumar, J.J. Xu, L. Li, and J. Wang. Measuring approximately yet reasonably accurate per-flow accounting without maintaining per-flow state. Proceedings of the 2003 ACM SIGCOMM conference on Internet measurement, 2003 October.
23. P. Mishra and M.H. Eich. Join processing in relational databases. In ACM Computing Surveys (CSUR), March 1992.
24. A. Moffat and J. Zobel. Parameterized compression of sparse bitmaps. In SIGIR Conference on Information Retrieval, 1992.
25. J.K. Mullin. Estimating the size of joins in distributed databases where communication cost must be maintained low. In IEEE Transactions on Software Engineering, 1990.
26. J.K. Mullin. Optimal semijoins for distributed database systems. In IEEE Transactions on Software Engineering, volume 16, pages 558 – 560, 1990.
27. P.E. O’Neil. Model 204 architecture and performance. In Proceedings of the 2nd International Workshop on High Performance Transaction Systems, pages 40–59. Springer-Verlag, 1989.
28. P.E. O’Neil. Informix and indexing support for data warehouses, 1997.
29. P.E. O’Neil and D. Quass. Improved query performance with variant indexes. In Proceedings of the 1997 ACM SIGMOD international conference on Management of data, pages 38–49. ACM Press, 1997.
30. A. Partow. General purpose hash function algorithms library. http://www.partow.net/programming/hashfunctions/index.html, 2002.
31. A. Pinar, T. Tao, and H. Ferhatosmanoglu. Compressing bitmap indices by data reorganization. ICDE, pages 310–321, 2005.
32. M.V. Ramakrishna. In Indexing Goes a New Direction., volume 2, page 70, 1999.
33. M.J.B. Robshaw. Md2, md4, md5, sha and other hash functions. technical report tr-101, version 4.0. RSA Laboratories, July 1995.
34. 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.
35. A.C. Snoeren. Hash-based IP traceback. In ACM SIGCOMM Computer Communication Review, 2001.
36. A.C. Snoeren, C. Partridge, L.A. Sanchez, C.E. Jones, F. Tchakountio, B. Schwartz, S.T. Kent, and W.T. Strayer. IP Traceback to record packet digests traffic forwarded by the routers. IEEE/ACM Transactions on Networking (TON), December 2002.
37. K. Stockinger. Bitmap indices for speeding up high-dimensional data analysis. In Proceedings of the 13th International Conference on Database and Expert Systems Applications, pages 881–890. Springer-Verlag, 2002.
38. K. Stockinger, J. Shalf, W. Bethel, and K. Wu. Dex: Increasing the capability of scientific data analysis pipelines by using efficient bitmap indices to accelerate scientific visualization. In Proceedings of SSDBM, 2005.
39. K. Stockinger and K. Wu. Improved searching for spatial features in spatio-temporal data. In Technical Report. Lawrence Berkeley National Laboratory. Paper LBNL-56376. http://repositories.cdlib.org/lbnl/LBNL-56376, September 2004.
40. J. Wang. Caching proxy servers on the world wide web to improve performance and reduce traffic, October 1999.
41. A. Whitaker and D. Wetherall. Detecting loops in small networks. 5th IEEE Conference on Open Architectures and Network Programming (OPENARCH), June 2002.
42. K. Wu, E.J. Otoo, and A. Shoshani. A performance comparison of bitmap indexes. In Proc. Conf. on 10th International Conference on Information and Knowledge Management, pages 559–561. ACM Press, 2001.
43. K. Wu, E.J. Otoo, and A. Shoshani. Compressing bitmap indexes for faster search operations. In SSDBM, pages 99–108, Edinburgh, Scotland, UK, July 2002.
44. K. Wu, E.J. Otoo, and A. Shoshani. An efficient compression scheme for bitmap indices. Technical Report 49626, LBNL, April 2004.
45. K. Wu, E.J. Otoo, and A. Shoshani. On the performance of bitmap indices for high cardinality attributes. Technical Report LBNL-54673, Lawrence Berkeley National Laboratory, March 2004.
46. K. Wu, E.J. Otoo, and A. Shoshani. Optimizing bitmap indexes with efficient compression. ACM Transactions on Database Systems (To appear), 2006.
47. 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, 2001.
48. M.C. Wu. Query optimization for selections using bitmaps. In Proceedings of the 1999 ACM SIGMOD international conference on Management of data, pages 227–238. ACM Press, 1999.