Abstract
Complex queries, with aggregates, views and nested subqueries are important in decision-support applications. Such queries are represented as multi-block queries where a query block may be a view definition containing aggregates or a correlated nested subquery. Beyond transformations that propagate predicates across blocks, the problem of optimizing such queries has not been addressed adequately. In this paper, we show how such queries can be optimized in a cost-based fashion. The crux of our solution is a careful treatment of group-by and aggregation operators that occur among views.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Chaudhuri and K. Shim. Including group-by in query optimization. In Proc. of the 20th VLDB Conference, Santiago, Chile, Sept 1994.
S. Chaudhuri and K. Shim. Complex queries: A unified approach. Technical report, Hewlett-Packard Laboratories, Palo Alto, In preparation, 1996.
U. Dayal. Of nests and trees: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proc. of the 13th VLDB Conference, Brighton, August 1987.
A. Gupta, V. Harinarayan, and D. Quass. Aggregate-query processing in data warehousing environments. In Proc. of the 21th VLDB Conference, Zurich, Sept 1995.
Richard A. Ganski and Harry K. T. Wong. Optimization of nested SQL queries revisited. In Proc. of the ACM SIGMOD, San Francisco, May 1987.
ISO. Database Language SQL ISO/IEC. Document ISO/IEC 9075, 1992.
W. Kim. On optimizing an SQL-Like nested query. ACM TODS, Sept 1982.
A. Y. Levy, I. S. Mumick, and Y. Sagiv. Query optimization by predicate move-around. In Proc. of the 20th VLDB Conference, Santiago, Chile, Sept 1994.
Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, and Raghu Ramakrishnan. Magic is relevant. In Proc. of the ACM SIGMOD, Atlantic City, May 1990.
M. Muralikrishna. Improved unnesting algorithms for join aggregate SQL queries. In Proc. of the 18th VLDB Conference, Vancouver, Canada, August 1992.
H. Pirahesh, Joseph M. Hellerstein, and Waqar Hasan. Extensible/rule based query optimization in starburst. In Proc. of the ACM SIGMOD, San Diego, May 1992.
P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In Proc. of the ACM SIGMOD, Boston, June 1979.
W. P. Yan and P. A. Larson. Performing group-by before join. In Proc. of International Conference on Data Engineering, Houston, Feb 1994.
W. P. Yan and P. A. Larson. Eager aggregation and lazy aggregation. In Proc. of the 21st VLDB Conference, Zurich, Sept 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhuri, S., Shim, K. (1996). Optimizing queries with aggregate views. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds) Advances in Database Technology — EDBT '96. EDBT 1996. Lecture Notes in Computer Science, vol 1057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014151
Download citation
DOI: https://doi.org/10.1007/BFb0014151
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61057-1
Online ISBN: 978-3-540-49943-5
eBook Packages: Springer Book Archive