Abstract
Iceberg queries are a special case of SQL queries involving GROUP BY and HAVING clauses, wherein the answer set is small relative to the database size. We present here a performance framework and a detailed evaluation within this framework of the efficiency of various iceberg query processing techniques. Based on these results, we provide a simple recipe algorithm that can be implemented in a query optimizer to make appropriate algorithmic choices for processing iceberg queries.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
AQUA Project, http://www.bell-labs.com/project/aqua/papers.html
Bae, J., Lee, S.: Partitioning Algorithms for the Computation of Average Iceberg Queries. In: Kambayashi, Y., Mohania, M., Tjoa, A.M. (eds.) DaWaK 2000. LNCS, vol. 1874, p. 276. Springer, Heidelberg (2000)
Bitton, D., Dewitt, D.: Duplicate Record Elimination in Large Data Files. ACM Trans. on Database Systems 8(2), 255–265 (1983)
Fang, M., Shivakumar, N., Garcia-Molina, H., Motwani, R., Ullman, J.: Computing Iceberg Queries Efficiently. In: Proc. of 24th Intl. Conf. on Very Large Data Bases (1998)
Garcia-Molina, H., Ullman, J., Widom, J.: Database System Implementation. Prentice Hall, Englewood Cliffs (2000)
Gilbert, A., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Surfing wavelets on streams: onepass summaries for approximate aggregate queries. In: Proc. of 27th Intl. Conf. on Very Large Data Bases (2001)
Graefe, G.: Query Evaluation Techniques for Large Databases. ACM Comput. Surv. 25(2), 73–170 (1993)
Ioannidis, Y., Poosala, V.: Histogram-Based Solutions to Diverse Database Estimation Problems. IEEE Data Engineering 18(3), 10–18 (1995)
Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. In: Proc. of ACM SIGMOD Conf. (2001)
Leela, K., Tolani, P., Haritsa, J.: On Incorporating Iceberg Queries in Query Processors, Tech. Rep. TR-2002-01, DSL/SERC, Indian Institute of Science (February 2002)
Matias, Y., Segal, E.: Approximate iceberg queries”,Tech. Rep., Dept. of Computer Science, Tel Aviv University, Tel Aviv, Israel (1999)
Ramakrishnan, R., Gehrke, J.: Database Management Systems. McGraw-Hill, New York (2000)
Selinger, P., Astrahan, M., Chamberlin, D., Lorie, R., Price, T.: Access Path Selection in a Relational Database Management System. In: Proc. of ACM SIGMOD Conf. (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leela, K.P., Tolani, P.M., Haritsa, J.R. (2004). On Incorporating Iceberg Queries in Query Processors. In: Lee, Y., Li, J., Whang, KY., Lee, D. (eds) Database Systems for Advanced Applications. DASFAA 2004. Lecture Notes in Computer Science, vol 2973. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24571-1_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-24571-1_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21047-4
Online ISBN: 978-3-540-24571-1
eBook Packages: Springer Book Archive