Chee-Yong Chan
Yannis E. Ioannidis
ABSTRACT
Bitmap indexes are useful in processing complex queries in decision support systems, and they have been implemented in several commercial database systems. A key design parameter for bitmap indexes is the encoding scheme, which determines the bits that are set to 1 in each bitmap in an index. While the relative performance of the two existing bitmap encoding schemes for simple selection queries of the form “v1 ≤ A ≤ v2” is known (specifically, one of the encoding schemes is better for processing equality queries; i.e., v1 = v2, while the other is better for processing range queries; i.e., v1 < v2), it remains an open question whether these two encoding schemes are indeed optimal for their respective query classes in the sense that there is no other encoding scheme with better space-time tradeoff. In this paper, we establish a number of optimality results for the existing encoding schemes; in particular, we prove that neither of the two known schemes is optimal for the class of two-sided range queries. We also propose a new encoding scheme and prove that it is optimal for that class. Finally, we present an experimental study comparing the performance of the new encoding scheme with that of the existing ones as well as four hybrid encoding schemes for both simple selection queries and the more general class of membership queries of the form “A ∈ {v1, v2, .…, vk}”. These results demonstrate that the new encoding scheme has an overall better space-time performance than existing schemes.
- Ant93.G. Antoshenkov. Byte Aligned Data Compression. U.S. :Patent No: 142640, October 1993.Google Scholar
- CI98a.C.Y. China and Y.E. Ioannidis. An Efficient Bitmap Encoding Scheme for Selection Querlies. Computer Sciences Department, University of Wisconsin-Madison, 1998. http://www.cs.wisc.edu/~cychan/interval.ps.Google Scholar
- CI98b.C.Y. Chan and Y.E. Ioannidis. Bitmap Index Design and Evaluation. In Proceedings of the Intl. A CM SIGMOD Conference, pages 355- 366, Seattle, Washington, June 1998. Google ScholarDigital Library
- Ede95.H. Edelstein. Faster Data Warehouses. Information We,~k, pages 77-88, December 1995.Google Scholar
- Inf.informix Inc. informix Decision Support Indexing for the Enterprise Data Warehouse. http://www.informix.com/informix/corpinfo/_ zines/whiteidx.htm.Google Scholar
- Jak97.H. Jakobs,~on. Bitmap Indexing in Oracle Data Warehousing.Database seminar at Stanford University. http://wwwdb.stanford.edu/dbseminar/Archive/Fal197/_ slides/oracle/, October 1997.Google Scholar
- OG95.P. O'Neil and G. Graefe. Multi-Table Joins Through Bitmapped Join Indices. A CM 5IG- MOD Record, pages 8-11, September 1995. Google ScholarDigital Library
- O'N87.P. O'Neil. Model 204 Architecture and Performance. In Proceedings of the 2nd International Workshop on High Performance Tran,~actions Systems, pages 40-59, Asilomar, CA, 1987. Springer-Verlag. In Lecture Notes in Computer Science 359. Google ScholarDigital Library
- O'N97.P. O'Neil. Informix Indexing Support for Data Warehouses. Database Programming and Design, 10(2):38-43, February 1997.Google Scholar
- OQ97.P. O'Neil and D. Quass. Improved Query Performance with Variant Indexes. In Proceedings of the Intl. A CM SIGMOD Conference, pages 38-49, Tucson, Arizona, May 1997. Google ScholarDigital Library
- Syb97.Sybase Inc. Sybase IQ Indexes. In Sybase IQ Administration Guide, Sybase IQ Release 11.2 Collection, chapter 5. Sybase Inc., March 1997. http://sybooks.sybase.com/cgi-bin/nphdynaweb/siql1201/iq_admin/1.toc.Google Scholar
- WB98.M.C. Wu and A.P. Buchmann. Encoded Bitmap Indexing for Data Warehouses. In Proceeding~ of the In~l. Conference on Data Engineering, pages 220-230, Orlando, Florida, February 1998. Google ScholarDigital Library
- Win99.R. Winter. Indexing Goes a New Direction. Intelligent Enterprise, 2(2):70-73, January 199!).Google Scholar
- WLO+85.H.K.T. Wong, H-F. Liu, F. Olken, D. Rotem, and L. Wong. Bit Transposed Files. In Proceedings of the Intl. Conference on Very Large Data Bases, pages 448-457, Stockholm, 1985.Google Scholar
- WLO+86.H.K.T. Wong, J.Z. Li, F. Olken, D. Rotem, and L. Wong. Bit Transposition for Very Large Scientific and Statistical Databases. Algorithmica, 1(3):289-309, 1986.Google ScholarCross Ref
Index Terms
- An efficient bitmap encoding scheme for selection queries
Recommendations
Optimizing bitmap indices with efficient compression
Bitmap indices are efficient for answering queries on low-cardinality attributes. In this article, we present a new compression scheme called Word-Aligned Hybrid (WAH) code that makes compressed bitmap indices efficient even for high-cardinality ...
An efficient bitmap encoding scheme for selection queries
Bitmap indexes are useful in processing complex queries in decision support systems, and they have been implemented in several commercial database systems. A key design parameter for bitmap indexes is the encoding scheme, which determines the bits that ...
APPLE: a new compression scheme for bitmap indexes: poster abstract
SenSys '20: Proceedings of the 18th Conference on Embedded Networked Sensor SystemsCompressed bitmap indexes are increasingly used in databases and search engines. By exploiting bit-level parallelism and bitwise operations, e.g. AND/OR operations, they can significantly accelerate the development of many areas. The Word Aligned Hybrid ...
Comments