Abstract
In several database applications sets of related queries are submitted together to be processed as a single unit. In all these cases the queries usually have some degree of overlap, i.e. may have common subqueries. Therefore a significant performance improvement can be obtained by optimizing and executing the entire group of queries as a whole, thus avoiding to duplicate the optimization and processing effort for common parts. This has suggested an approach, termed multiquery optimization (MQO) that has been proposed and studied by several authors. In this paper we suggest a new approach to multiplequery optimization based on Genetic and Tabu Search algorithms that ensure the tractability of the problem even for very large size of the queries. To analyze the performance of the algorithms, we have run a set of experiments that allow to understand how the different approaches are sensitive to the main workload parameters.
This research is supported in part by Polish State Committee for Scientific Research, Grant 8T llC043-15
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
Chaudhuri S., Dayal U., An overview of data warehousing and OLAP technology, in: ACM SIGMOD Record (26), 1997, pp. 65–75.
Graefe G., Research Problems in Database Query Optimization, in: Proc. of the Intern. Workshop on Database Query Optimization, Portland, Oregon, 1989.
Hellerstein J.M., Haas J.P., Wang HJ., On-line Aggregation, in: Proc. of ACM-SIGMOD Conference on Management of Data, 1997, pp. 171–183.
Królikowski Z., Matysiak M., Morzy M., Salza S., A Combinatorial approach to the multiple-query optimization problem, in:Proc. COMAD’ 94, 1994, Bangalore.
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs, Spring Verlag (Second Edition), 1994.
Park J., Segev A., Using Common Subexpressions to Optimize Multiple Queries, in: Proc. of the 4th Intern. Conf. On Data Eng., Los Angeles, 1988, pp. 311–319.
Roy P., et al., Efficient and Extensible Algorithms for Multi Query Optimization, in: Proc. of the SIGMOD’ 2000 Intern. Conf., Dallas, 2000.
Sellis T., Multiple-Query Optimization, ACM TODS, 13(1), 1988, pp. 23–52.
Stillger M., Spiliopoulou M., Genetic Programming in Database Query Optimization, Research Rep.-ICS, Humboldt Univ. of Berlin, 1997.
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
Królikowski, Z., Morzy, T., Bębel, B. (2000). Comparison of Genetic and Tabu Search Algorithms in Multiquery Optimization in Advanced Database Systems. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2000. Lecture Notes in Computer Science, vol 1909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40888-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-40888-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41184-0
Online ISBN: 978-3-540-40888-8
eBook Packages: Springer Book Archive