Abstract
Database systems allow for concurrent use of several applications (and query interfaces). Each application generates an “optimal” plan—a sequence of low-level database operators—for accessing the database. The queries posed by users through the same application can be optimized together using traditional multi-query optimization techniques. However, the commonalities among queries of different applications are not exploited.
In this paper we present an efficient inter-application multi-query optimizer that re-uses previously computed (intermediate) results and eliminates redundant work. Experimental results on a single CPU system and a parallel system show that the inter-application multi-query optimizer improves the query evaluation performance significantly.
This work has been supported by the HPCN-CONQUER project.
This is a preview of subscription content, log in via an institution to check access.
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
J. R. Alsabbagh and V. V. Raghavan. A Framework for Multiple-Query Optimization. In Proc. Research Issues on Data Eng.: Transaction and Query Processing, Tempe, AZ, USA, February 1992.
P. Boncz and M. Kersten. Monet: An Impressionist Sketch of an Advanced Database System. In Proc. Basque International Workshop on Information Technology, San Sebastian, Spain, July 1995.
P. Boncz and M. Kersten. MIL Primitives For Querying a Fragmented World. The VLDB Journal, 8(2), October 1999.
P. Boncz, S. Manegold, and M. Kersten. Database Architecture Optimized for the New Bottleneck: Memory Access. In Proc. of the Int’l. Conf. on Very Large Data Bases, pages 54–65, Edinburgh, Scotland, UK, September 1999.
P. Boncz, T. Rühl, and F. Kwakkel. The Drill Down Benchmark. In Proc. of the Int’l. Conf. on Very Large Data Bases, pages 628–632, New York, NY, USA, June 1998.
F.-C. F. Chen and M. H. Dunham. Common Subexpression Processing in Multiple Query Processing. IEEE Trans. on Knowledge and Data Eng., 10(3):493–499, May/June 1998.
G. P. Copeland and S. Khoshafian. A Decomposition Storage Model. In Proc. of the ACM SIGMOD Int’l. Conf. on Management of Data, pages 268–279, Austin, TX, USA, May 1985.
U. S. Chakravarthy and J. Minker. Multiple Query Processing in Deductive Databases using Query Graphs. In Proc. of the Int’l. Conf. on Very Large Data Bases, pages 384–390, Kyoto, Japan, August 1986.
S. J. Finkelstein. Common Expression Analysis in Database Applications. In Proc. of the ACM SIGMOD Int’l. Conf. on Management of Data, pages 235–245, Orlando, FL, USA, June 1982.
C. A. Galindo-Legaria, A. Pellenkoft, and M. Kersten. Fast, Randomized Join-Order Selection-Why Use Transformations? In Proc. of the Int’l. Conf. on Very Large Data Bases, pages 85–95, Santiago, Chile, September 1994.
T. Ibaraki and T. Kameda. Optimal Nesting for Computation N-Relational Joins. ACM Trans. on Database Systems, 9(3), September 1984.
Y. E. Ioannidis and Y. C. Kang. Randomized Algorithms for Optimizing Large Join Queries. In Proc. of the ACM SIGMOD Int’l. Conf. on Management of Data, pages 312–321, Atlantic City, NJ, USA, May 1990.
M. Jarke. Common Subexpression Isolation in Multiple Query Optimization. In W. Kim, D. S. Reiner, and D. S. Batory, editors, Query Processing in Database Systems, pages 191–205. Springer-Verlag, 1985.
M. H. Kang, H. G. Dietz, and B. Bhargava. Multiple-query optimization at algorithm-level. Data and Knowledge Engineering, 14(1), November 1994.
A. Rosenthal and S. Chakravarthy. Anatomy of a Modular Multiple Query Optimizer. Proc. of the Int’l. Conf. on Very Large Data Bases, pages 230–239, 1988.
[SAC+79]_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 Int’l. Conf. on Management of Data, pages 23–34, Boston, MA, USA, May 1979.
T. K. Sellis. Multiple-Query Optimization. ACM Trans. on Database Systems, 13(1), March 1988.
T. Sellis and S. Ghosh. On the Multiple-Query Optimization Problem. IEEE Trans. on Knowledge and Data Eng., 2(2):262–266, Jun 1990.
W. Scheufele and G. Moerkotte. On the Complexity of Generating Optimal Plans with Cross Products. In Proc. of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 238–248, Tucson, AZ, USA, May 1997.
K. Shim, T. Sellis, and D. Nau. Improvements on a Heuristic Algorithm for Multiple-Query Optimization. Data and Knowledge Engineering, 12(2):197–222, March 1994.
B. Vance and D. Maier. Rapid Bushy Join-order Optimization with Cartesian Products. In Proc. of the ACM SIGMOD Int’l. Conf. on Management of Data, pages 35–46, Montreal, Canada, June 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manegold, S., Pellenkoft, A., Kersten, M. (2000). A Multi-Query Optimizer for Monet. In: Lings, B., Jeffery, K. (eds) Advances in Databases. BNCOD 2000. Lecture Notes in Computer Science, vol 1832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45033-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-45033-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67743-7
Online ISBN: 978-3-540-45033-7
eBook Packages: Springer Book Archive