Abstract
Query optimization has long been one of the prime research areas associated to the relational database model. Most of the research assumed that users would pose unrelated questions, at relatively large time intervals. Recently, however, applications were discovered where a database is issued a multitude of queries simultaneously, while the queries themselves are somehow related to each other. One such application is data mining. The topic of the Ph.D. research presented in this paper is the study of formal systems that make multi query optimization —independent of the database instance — possible.
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
L. Brunie and H. Kosch. ModParOpt: A Modular Query Optimizer for Multi-Query Parallel Databases. In ADBIS 1997, pages 97–106.
H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Executing query packs in ILP. In Proc. of the 10th International Conference on Inductive Logic Programming, Lecture Notes in Artificial Intelligence, vol. 1866, pages 60–77, London, UK, July 2000.
S. Dekeyser and J. Paredaens. Query Pack Trees for Multi Query Optimization. Technical Report 01-04, University of Antwerp, 2001. ftp://wins.uia.ac.be/pub/dekeyser/qpt.ps
S. Dekeyser and J. Paredaens. A Sound and Complete Set of Axioms for the Deduction of Comparison Formulas. Technical Report 01-05, University of Antwerp, 2001. ftp://wins.uia.ac.be/pub/dekeyser/axioms.ps
C. Galindo-Legaria, A. Pellenkoft, and M. Kersten. Fast, Randomized Join-Order Selection. In Proc. of the Int’l. Conf. on Very Large Databases, pages 95–95, Santiago, Chile, 1994.
Y. Ioannidis. Query Optimization. In The Computer Science and Engineering Handbook 1997, pages 1038–1057.
Y. Ioannidis and Y. Kang. Randomized Algorithms for Optimizing Large Join Queries. In Proc. of the ACM Int’l. Conf. on Management of Data, pages 312–321, Atlantic City, 1990.
M. Jarke. Common Subexpression Isolation in Multiple Query Optimization. In Query Processing in Database Systems, pages 191–205, 1985.
M. Jeusfeld and M. Staudt Query Optimization in Deductive Object Bases. In Dagstuhl Query Processing Workshop, pages 145–176, 1991.
D. Kountanis and H. Xue A Better Approximation Algorithm for the Query Optimization Problem. In ACM Conference on Computer Science, pages 15–21, 1994.
S. Manegold, A. Pellenkoft, and M. Kersten. A Multi-query Optimizer for Monet. In BNCOD 2000, pages 36–50.
P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access Path Selection in a Relational Database Management System. In Proc. of the ACM Int’l. Conf. on Management of Data, pages 23–34, Boston, 1979.
T. Sellis. Multiple-Query Optimization. In TODS 13(1): 23–52, 1988.
J. Ullman. Principles of Database and Knowledge-base Systems —Volume II, pages 885–889. Computer Science Press, Rockville, MD, 1989.
B. Vance and D. Maier. Rapid Bushy Join-order Optimization with Cartesian Products. In Proc. of the ACM Int’l. Conf. on Management of Data, pages 35–46, Montreal, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dekeyser, S. (2002). Multi Query Optimization Using Query Pack Trees. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds) XML-Based Data Management and Multimedia Engineering — EDBT 2002 Workshops. EDBT 2002. Lecture Notes in Computer Science, vol 2490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36128-6_34
Download citation
DOI: https://doi.org/10.1007/3-540-36128-6_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00130-0
Online ISBN: 978-3-540-36128-2
eBook Packages: Springer Book Archive