Article

Free access

Query optimization for selections using bitmaps

Author:

Ming-Chuan WuAuthors Info & Claims

SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of data

Pages 227 - 238

https://doi.org/10.1145/304182.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

Xing HAgrawal GRamnath R(2020)MoHA: A Composable System for Efficient In-Situ Analytics on Heterogeneous HPC SystemsSC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00086(1-16)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00086
Wah TA. B. Z(2017)Query Processing Techniques in Data Warehousing Using Cost ModelTHE ELECTRONIC JOURNAL OF INFORMATION SYSTEMS IN DEVELOPING COUNTRIES10.1002/j.1681-4835.2000.tb00020.x3:1(1-9)Online publication date: 5-Dec-2017
https://doi.org/10.1002/j.1681-4835.2000.tb00020.x
He HZhang YRen JRen JHu C(2009)An improved OLAP join and aggregate algorithm based on dimension hierarchyProceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 510.5555/1801874.1801912(169-172)Online publication date: 14-Aug-2009
https://dl.acm.org/doi/10.5555/1801874.1801912
Show More Cited By

Index Terms

Query optimization for selections using bitmaps

Recommendations

Query optimization for selections using bitmaps

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 Conferences

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

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

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS99

Sponsor:

SIGMOD/PODS99: International Conference on Management of Data and Symposium on Principles of Database Systems

May 31 - June 3, 1999

Pennsylvania, Philadelphia, USA

Acceptance Rates

Overall Acceptance Rate 785 of 4,003 submissions, 20%

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

Xing HAgrawal GRamnath R(2020)MoHA: A Composable System for Efficient In-Situ Analytics on Heterogeneous HPC SystemsSC20: International Conference for High Performance Computing, Networking, Storage and Analysis10.1109/SC41405.2020.00086(1-16)Online publication date: Nov-2020
https://doi.org/10.1109/SC41405.2020.00086
Wah TA. B. Z(2017)Query Processing Techniques in Data Warehousing Using Cost ModelTHE ELECTRONIC JOURNAL OF INFORMATION SYSTEMS IN DEVELOPING COUNTRIES10.1002/j.1681-4835.2000.tb00020.x3:1(1-9)Online publication date: 5-Dec-2017
https://doi.org/10.1002/j.1681-4835.2000.tb00020.x
He HZhang YRen JRen JHu C(2009)An improved OLAP join and aggregate algorithm based on dimension hierarchyProceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 510.5555/1801874.1801912(169-172)Online publication date: 14-Aug-2009
https://dl.acm.org/doi/10.5555/1801874.1801912
Aouiche KDarmont J(2009)Data mining-based materialized view and index selection in data warehousesJournal of Intelligent Information Systems10.1007/s10844-009-0080-033:1(65-93)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1007/s10844-009-0080-0
Sinha RWinslett MWu K(2009)Finding Regions of Interest in Large Scientific DatasetsProceedings of the 21st International Conference on Scientific and Statistical Database Management10.1007/978-3-642-02279-1_10(130-147)Online publication date: 2-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-02279-1_10
Wu KShoshani AStockinger K(2008)Analyses of multi-level and multi-component compressed bitmap indexesACM Transactions on Database Systems10.1145/1670243.167024535:1(1-52)Online publication date: 15-Feb-2008
https://dl.acm.org/doi/10.1145/1670243.1670245
Rinfret DDesai B(2008)Answering preference queries with bit-sliced index arithmeticProceedings of the 2008 C3S2E conference10.1145/1370256.1370286(173-185)Online publication date: 12-May-2008
https://dl.acm.org/doi/10.1145/1370256.1370286
Tosun A(2007)Space-efficient structures for detecting port scansProceedings of the 18th international conference on Database and Expert Systems Applications10.5555/2395856.2395873(120-129)Online publication date: 3-Sep-2007
https://dl.acm.org/doi/10.5555/2395856.2395873
Sinha RWinslett M(2007)Multi-resolution bitmap indexes for scientific dataACM Transactions on Database Systems10.1145/1272743.127274632:3(16-es)Online publication date: 1-Aug-2007
https://dl.acm.org/doi/10.1145/1272743.1272746
Hu KGong ZDa Q(2007)A Rapid Grouping Aggregation Algorithm Based on the Multi-Dimension Hierarchical EncodingProceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 0210.1109/SNPD.2007.88(368-373)Online publication date: 30-Jul-2007
https://dl.acm.org/doi/10.1109/SNPD.2007.88
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 Table of Contents