Optimizing candidate check costs for bitmap indices
- 31 October 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 648-655
- https://doi.org/10.1145/1099554.1099718
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast algorithms for hierarchical range histogram constructionPublished by Association for Computing Machinery (ACM) ,2002
- Space efficient bitmap indexingPublished by Association for Computing Machinery (ACM) ,2000
- Designing and mining multi-terabyte astronomy archivesPublished by Association for Computing Machinery (ACM) ,2000
- Optimal histograms for hierarchical range queries (extended abstract)Published by Association for Computing Machinery (ACM) ,2000
- An efficient bitmap encoding scheme for selection queriesPublished by Association for Computing Machinery (ACM) ,1999
- An overview of data warehousing and OLAP technologyACM SIGMOD Record, 1997
- Improved query performance with variant indexesPublished by Association for Computing Machinery (ACM) ,1997