article

Free access

Query optimization for selections using bitmaps

Author:

Ming-Chuan WuAuthors Info & Claims

ACM SIGMOD Record, Volume 28, Issue 2

Pages 227 - 238

https://doi.org/10.1145/304181.304202

Published: 01 June 1999 Publication History

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. Both continuous and discrete selection 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.

References

[1]

R.E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Trans. on Computers, 35(6), 1986.

Digital Library

[2]

R.E. Bryant, Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams, ACM Computing Surveys, 24(3), 1992.

Digital Library

[3]

C.-Y. Chan, Y.E. Ioannidis, Bitmap Index Design a.~d Evaluation, SIGMOD Conf., Seattle, 1998.

Digital Library

[4]

C.-Y. Chan, Y.E. Ioannidis, Bitmap Index Design and Evaluation, CS Dept., Univ. of Wisconsin-Madison, http ://www. cs. wisc. edu/~ cychan/paperl Ol .ps, 1997.

[5]

J.-H. Chu, G.D. Knott, An Analysis of B-Trees and Their Variants, Information Systems, 14(5), 1989.

Digital Library

[6]

D. Comer, The Ubiquitous B-Tree, ACM Computing Surveys, 11(2), June 1979.

Digital Library

[7]

D.J. DeWitt, R. Katz, F. Olken, L. Shapiro, M. Stonebraker, D. Wood, Implementation Techniques for Main Memory database Systems, SIGMOD, New York, 1984.

Digital Library

[8]

J. Feigenbaum, S. Kannan, M.Y. Vardi, M. Viswanathan, Complexity of Problems on Graphs Represented as OBDDs, AT&T Technical Report: 97.1.1, 1996.

[9]

G. Graefe, Query Evaluation Techniques for Large Databases, ACM Computing Surveys, 25(2), 1993.

Digital Library

[10]

K. Kiispert, Storage Utilization in B*-Trees with a Generalized Overflow Technique, Acta Informatica, 19, 1983.

[11]

E.J. McCIuskey, Minimisation of Boolean functions, Bell System Technical Journal, 35(6), 1956.

[12]

P. O'Neil, Model 204 Architecture and Performance, Springer-Verlag LNCS 359, 2nd Intl. Workshop on High Performance Transactions Systems, Asilomar, CA, 1987.

Digital Library

[13]

P. O'Neil, G. Graefe, Multi-Table Joins Through Bitmapped Join Indices, SIGMOD Record, 24(3), 1995.

Digital Library

[14]

P. O'Neil, D. Quass, Improved Query Performance with Variant Indexes, SIGMOD, Tucson, Arizona, May 1997.

Digital Library

[15]

W.V. Quine, The Problem of Simplifying Truth Functions, American Mathematical Monthly, 59(8), 1952.

[16]

S. Sarawagi, Indexing OLAP Data, Bulletin of the Technical Committee on Data Eng., Vol. 20, No. 1, Mar 1997.

[17]

L.D. Shapiro, Join Processing in Database Systems with. Large Main Memories, ACM TODS, 11(3), 1986.

Digital Library

[18]

M.C. Wu, A. Buchmann, Encoded Bitmap Indexing for" Data Warehouses, 14th ICDE, Orlando, 1998.

Digital Library

[19]

M.C. Wu, Query Optimization .for Selections using Bitmaps, Tech. Report, DVS98-2, DVS1, CS Dept, Technische Universitiit Darmstadt, 1998.

[20]

K.L. Wu, P.S. Yu, Range-Based Bitmap Indexing for High Cardinality Attributes with Skew, Research Report, IBM Watson Research Center, May 1996.

Cited By

Ridani MAmnai MChoukri AFakhri YGherabi N(2023)Indexation techniques in decision support systems: Study and Evaluation2023 10th International Conference on Wireless Networks and Mobile Communications (WINCOM)10.1109/WINCOM59760.2023.10322993(1-7)Online publication date: 26-Oct-2023
https://doi.org/10.1109/WINCOM59760.2023.10322993
Toumi LUgur A(2021)Static and incremental dynamic approaches for multi-objective bitmap join indexes selection in data warehousesThe Journal of Supercomputing10.1007/s11227-020-03423-777:4(3933-3958)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s11227-020-03423-7
Xing HAgrawal GRamnath RCuicchi CQualters IKramer W(2020)MoHAProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.5555/3433701.3433810(1-16)Online publication date: 9-Nov-2020
https://dl.acm.org/doi/10.5555/3433701.3433810
Show More Cited By

Index Terms

Query optimization for selections using bitmaps

Recommendations

Query optimization for selections using bitmaps
SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data

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. Both continuous and discrete selection criteria are ...
Optimizing Druid with Roaring bitmaps
IDEAS '16: Proceedings of the 20th International Database Engineering & Applications Symposium

In the current Big Data era, systems for collecting, storing and efficiently exploiting huge amounts of data are continually introduced, such as Hadoop, Apache Spark, Dremel, etc. Druid is one of theses systems especially designed to manage such data ...
Compressed Hierarchical Bitmaps for Efficiently Processing Different Query Workloads
IC2E '15: Proceedings of the 2015 IEEE International Conference on Cloud Engineering

Today the amount of data that is being processed is growing manyfold. Fast and scalable data processing systems are the need of the hour because of the data deluge. Indexing is a very common mechanism used in data processing systems for fast and ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record

ACM SIGMOD Record Volume 28, Issue 2

June 1999

599 pages

ISSN:0163-5808

DOI:10.1145/304181

Chairmen:
Susan Davidson
Univ. of Pennsylvania
,
Christos Faloutsos
Carnegie Mellon Univ.

Issue’s Table of Contents

SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data
June 1999
604 pages
ISBN:1581130848
DOI:10.1145/304182
Chairmen:
Susan B. Davidson
Univ. of Pennsylvania, Philidelphia
,
Christos Faloutsos
Carnegie Mellon Univ., Pittsburgh

Copyright © 1999 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1999

Published in SIGMOD Volume 28, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
1,088
Total Downloads

Downloads (Last 12 months)70
Downloads (Last 6 weeks)14

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ridani MAmnai MChoukri AFakhri YGherabi N(2023)Indexation techniques in decision support systems: Study and Evaluation2023 10th International Conference on Wireless Networks and Mobile Communications (WINCOM)10.1109/WINCOM59760.2023.10322993(1-7)Online publication date: 26-Oct-2023
https://doi.org/10.1109/WINCOM59760.2023.10322993
Toumi LUgur A(2021)Static and incremental dynamic approaches for multi-objective bitmap join indexes selection in data warehousesThe Journal of Supercomputing10.1007/s11227-020-03423-777:4(3933-3958)Online publication date: 1-Apr-2021
https://dl.acm.org/doi/10.1007/s11227-020-03423-7
Xing HAgrawal GRamnath RCuicchi CQualters IKramer W(2020)MoHAProceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis10.5555/3433701.3433810(1-16)Online publication date: 9-Nov-2020
https://dl.acm.org/doi/10.5555/3433701.3433810
Kharkongor CNath B(2020)Set Representation of Itemset for Candidate Generation with Binary Search TechniqueAdvances in Computer, Communication and Computational Sciences10.1007/978-981-15-4409-5_46(509-520)Online publication date: 28-Oct-2020
https://doi.org/10.1007/978-981-15-4409-5_46
Chan C(2018)Bitmap IndexEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_749(311-315)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_749
Chan C(2017)Bitmap IndexEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_749-2(1-6)Online publication date: 21-Sep-2017
https://doi.org/10.1007/978-1-4899-7993-3_749-2
Zhu GWang YAgrawal G(2015)SciCSMProceedings of the 27th International Conference on Scientific and Statistical Database Management10.1145/2791347.2791361(1-6)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2791347.2791361
Wang YSu YAgrawal G(2015)A novel approach for approximate aggregations over arraysProceedings of the 27th International Conference on Scientific and Statistical Database Management10.1145/2791347.2791349(1-12)Online publication date: 29-Jun-2015
https://dl.acm.org/doi/10.1145/2791347.2791349
Ignatiev APreviti AMarques-Silva J(2015)SAT-Based Formula SimplificationTheory and Applications of Satisfiability Testing -- SAT 201510.1007/978-3-319-24318-4_21(287-298)Online publication date: 27-Oct-2015
https://doi.org/10.1007/978-3-319-24318-4_21
Chan C(2009)Bitmap IndexEncyclopedia of Database Systems10.1007/978-0-387-39940-9_749(244-248)Online publication date: 2009
https://doi.org/10.1007/978-0-387-39940-9_749
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents