Affiliation:
1. Database Research Group, Computer Science Department, Technische Universität Darmstadt, Germany
Abstract
Bitmaps are popular indexes for data warehouse (DW) applications and most database management systems offer them today. This paper proposes query optimization strategies for selections using bitmaps. Bothcontinuousanddiscreteselection criteria are considered. Query optimization strategies are categorized into static and dynamic. Static optimization strategies discussed are the optimal design of bitmaps, and algorithms based on tree and logical reduction. The dynamic optimization discussed is the approach of inclusion and exclusion for both bit-sliced indexes and encoded bitmap indexes.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Indexation techniques in decision support systems: Study and Evaluation;2023 10th International Conference on Wireless Networks and Mobile Communications (WINCOM);2023-10-26
2. MoHA: A Composable System for Efficient In-Situ Analytics on Heterogeneous HPC Systems;SC20: International Conference for High Performance Computing, Networking, Storage and Analysis;2020-11
3. Set Representation of Itemset for Candidate Generation with Binary Search Technique;Advances in Computer, Communication and Computational Sciences;2020-10-28
4. Static and incremental dynamic approaches for multi-objective bitmap join indexes selection in data warehouses;The Journal of Supercomputing;2020-09-10
5. Bitmap Index;Encyclopedia of Database Systems;2018