Optimizing candidate check costs for bitmap indices

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2005, Pages 648-655

  Rotem, Doron ^a   Stockinger, Kurt ^a   Wu, Kesheng ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bitmap Index; Dynamic Programming; Query Processing

Indexed keywords

ALGORITHMS; COSTS; DATA ACQUISITION; SURVEYS;

BITMAP INDEX; QUERY PROCESSING; SLOAN DIGITAL SKY SURVEY; TOTAL QUERY PROCESSING TIME;

DYNAMIC PROGRAMMING;

EID: 33745782351     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1099554.1099718     Document Type: Conference Paper

References (20)

1. S. Amer-Yahia and T. Johnson. Optimizing Queries on Compressed Bitmaps. In VLDB 2000, Cairo, Egypt, Sept. 2000. Morgan Kaufmann.
2. G. Antoshenkov. Byte-aligned Bitmap Compression. Technical report, Oracle Corp., 1994. U.S. Patent number 5,363,098.
3. R. E. Bellman. Dynamic Programming. Dover Publications, Incorporated, 2003.
4. C. Y. Chan and Y. E. Ioannidis. An Efficient Bitmap Encoding Scheme for Selection Queries. In SIGMOD 1999. Philadelphia, Pennsylvania, USA, June 1999. ACM Press.
5. S. Chaudhuri and U. Dayal. An Overview of Data Warehousing and OLAP Technology. ACM SIGMOD Record, 26(1):65-74, March 1997.
6. S. Guha, N. Koudas, and D. Srivastava. Fast Algorithms For Hierarchical Range Histogram Construction. In PODS 2002, Madison, Wisconsin, USA, June 2002. ACM Press.
7. T. Johnson. Performance Measurements of Compressed Bitmap Indices. In VLDB 1999, Edinburgh, Scotland, Sept. 1999. Morgan Kaufmann.
8. N. Koudas. Space Efficient Bitmap Indexing. In CIKM 2000. McLean, Virginia, USA, Nov. 2000. ACM Press.
9. N. Koudas, S. Muthukrishnan, and D. Srivastava. Optimal Histograms for Hierarchical Range Queries. In PODS 2000, Dallas, Texas, USA, 2000. ACM Press.
10. P. O'Neil. Model 204 Architecture and Performance. In 2nd International Workshop in High Performance Transaction Systems, Asilomar, California, USA, 1987. Springer-Verlag.
11. P. O'Neil and D. Quass. Improved Query Performance with Variant Indexes. In SIGMOD 1997, Tucson, Arizona, USA, May 1997. ACM Press.
12. D. Rotem, K. Stockinger, and K. Wu. Efficient Binning for Bitmap Indices on High-Cardinality Attributes. Technical Report LBNL-56936, Berkeley Lab, Berkeley, California, USA, Nov. 2004.
13. Sloan Digital Sky Survey. http://www.sdss.org/dr1/.
14. K. Stockinger, K. Wu, R. Brun, and P. Canal. Bitmap Indices for Fast End-User Physics Analysis in ROOT. In Nuclear Instruments and Methods in Physics Research. Elsevier. to appear.
15. K. Stockinger, K. Wu, and A. Shoshani. Evaluation Strategies for Bitmap Indices with Binning. In International Conference on Database and Expert Systems Applications (DEXA 2004), Zaragoza, Spain, Sept. 2004. Springer-Verlag.
16. A. Szalay, P. Kunszt, A. Thakar, J. Gray, and D. Slutz. Designing and Mining Multi-Terabyte Astronomy Archives: The Sloan Digital Sky Survey. In SIGMOD 2000, Dallas, Texas, USA, May 2000. ACM Press.
17. K. Wu, E. J. Otoo, and A. Shoshani. On the Performance of Bitmap Indices for High Cardinality Attributes. In VLDB 2004, Toronto, Canada, Sept. 2004. Morgan Kaufmann.
18. K. Wu, W.-M. Zhang, V. Perevoztchikov, J. Lauret, and A. Shoshani. The Grid Collector: Using an Event Catalog to Speedup User Analysis in Distributed Environment. In Computing in High Energy and Nuclear Physics, (CHEP 2004), Interlaken, Switzerland, Sept. 2004.
19. K.-L. Wu and P.S. Yu. Range-Based Bitmap Indexing for High-Cardinality Attributes with Skew. Technical report, IBM Watson Research Center, May 1996.
20. M.-C. Wu and A. P. Buchmann. Encoded Bitmap Indexing for Data Warehouses. In ICDE 1998, Orlando, Florida, USA, Feb. 1998. IEEE Computer Society Press.