Abstract
The Group-By operation is widely used in relational Data Warehouses for the aggregation and presentation of results according to user-defined criteria. Rearranging Group-By and join operations has been proposed as an optimization technique that reduces the size of the input relation. Pipelining is another optimization technique that promotes intra-query parallelism by transfering intermediate results to the next operation without materializing them. In Data Warehouses and environments in which exploratory on-line queries are common, pipelining can be used both for optimizing joins and for the reduction of response time by presenting partial results to the user. Efficient pipelining often depends on the order of the intermediate results. Order dependent operations, such as Group-By, typically require the complete result set before ordering it, thereby making efficient pipelining impossible. In this paper we exploit bitmap indexing to implement Group-By in a manner that can be used for pipelining. Algorithms are presented for different assumptions about buffer availability and for different sort orders.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Y. Chan, Y. E. Ioannidis, Bitmap Index Design and Evaluation, Proc. of the ACM SIGMOD Conference on Management of Data, Seattle, June 1998.
C. Y. Chan, Y. E. Ioannidis, An E cient Bitmap Encoding Scheme for Selection Queries, Proc. of the ACM SIGMOD Conference on Management of Data, Philadelphia, June 1999.
S. Chaudhuri, K. Shim, Including Group-By in Query Optimization, Proc. of the 20th International Conference on Very Large Data Bases, Santiago, Chile, Sept. 1994.
G. Graefe, Query Evaluation Techniques for Large Databases, ACM Computing Surveys, 25(2):73–170, June 1993.
J. M. Hellerstein, P. J. Haas, H. J. Wang Online Aggregation, Proc. of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona, May 1997.
P. O’ Neil, D. Quass, Improved Query Performance with Variant Indexes, Proc. of the ACM SIGMOD Conference on Management of Data, Tucson, Arizona, May 1997.
M. C. Wu, A. Buchmann, Encoded Bitmap Indexing for Data Warehouses, Proc. of the 14th International Conference on Data Eengineering, Orlando, Feb. 1998.
M.-C. Wu, Query Optimization for Selections Using Bitmaps, Proc. of the ACM SIGMOD Conference on Management of Data, Philadelphia, June, 1999.
Weipeng P. Yan, Per-Lke Larson, Performing Group-By before Join, Proc. of the 10th International Conference on Data Engineering, Houston, Feb. 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berin Heidelberg
About this paper
Cite this paper
Buchmann, A.P., Wu, MC. (1999). Supporting Group-By and Pipelining in Bitmap-Enabled Query Processors. In: Pavelka, J., Tel, G., Bartošek, M. (eds) SOFSEM’99: Theory and Practice of Informatics. SOFSEM 1999. Lecture Notes in Computer Science, vol 1725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47849-3_14
Download citation
DOI: https://doi.org/10.1007/3-540-47849-3_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66694-3
Online ISBN: 978-3-540-47849-2
eBook Packages: Springer Book Archive