ACM Home Page
Please provide us with feedback. Feedback
Bitmap index design and evaluation
Full text PdfPdf (1.44 MB)
Source International Conference on Management of Data archive
Proceedings of the 1998 ACM SIGMOD international conference on Management of data table of contents
Seattle, Washington, United States
Pages: 355 - 366  
Year of Publication: 1998
ISBN:0-89791-995-5
Also published in ...
Authors
Chee-Yong Chan  Department of Computer Sciences, University of Wisconsin-Madison
Yannis E. Ioannidis  Department of Informatics, University of Athens, Hellas (Greece) and Department of Computer Sciences, University of Wisconsin-Madison
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 30,   Downloads (12 Months): 193,   Citation Count: 55
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276304.276336
What is a DOI?

ABSTRACT

Bitmap indexing has been touted as a promising approach for processing complex adhoc queries in read-mostly environments, like those of decision support systems. Nevertheless, only few possible bitmap schemes have been proposed in the past and very little is known about the space-time tradeoff that they offer. In this paper, we present a general framework to study the design space of bitmap indexes for selection queries and examine the disk-space and time characteristics that the various alternative index choices offer. In particular, we draw a parallel between bitmap indexing and number representation in different number systems, and define a space of two orthogonal dimensions that captures a wide array of bitmap indexes, both old and new. Within that space, we identify (analytically or experimentally) the following interesting points: (1) the time-optimal bitmap index; (2) the space-optimal bitmap index; (3) the bitmap index with the optimal space-time tradeoff (knee); and (4) the time-optimal bitmap index under a given disk-space constraint. Finally, we examine the impact of bitmap compression and bitmap buffering on the space-time tradeoffs among those indexes. As part of this work, we also describe a bitmap-index-based evaluation algorithm for selection queries that represents an improvement over earlier proposals. We believe that this study offers a useful first set of guidelines for physical database design using bitmap indexes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
AIPD Technical Publications. 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/siq 11201/iq_admin/l .toc.
 
2
C.Y. Chart and Y.E. Ioannidis. Bitmap Index Design and Evaluation. Computer Sciences Dept., University of Wisconsin-Madison, 1997. http ://www. cs. wis c.edu/~ cychan/paper 101 .ps.
3
 
4
Transaction Processing Performance Council, May 1995. http://www.tpc.org.
 
5
H. Edelstein. Faster Data Warehouses. Information Week, pages 77- 88, December 1995.
6
7
 
8
9
10
11
 
12
J. Winchelt. Rushmore's Bald Spot. DBMS, 4(10):58, September 1991.
 
13
H.K.T. Wong, J.Z. Li, F. Olken, D. Rotem, and L. Wong. Bit Tranposition for Very Large Scientific and Statistical Databases. Algorithmica, 1(3):289-309, 1986.
 
14
H.K.T. Wong, H-E Liu, E Olken, D. Rotem, and L. Wong. Bit Tranposed Files. In VLDB'85, pages 448-457, Stockholm, 1985.

CITED BY  55

Collaborative Colleagues:
Chee-Yong Chan: colleagues
Yannis E. Ioannidis: colleagues