On the effectiveness of the minimization approach to the query optimization

N. A. Mendkovich

Modelirovanie i analiz informacionnyh sistem, Tome 23 (2016) no. 2, pp. 153-163.

Résumé

A standard problem of DBMSs usage is a lack of efficiency and high cost of the access to the stored data. The acceptable level of system performance may be achieved by query optimization technics that determine the most efficient way to execute a given query by its modification and considering possible query execution plans. The goal of this paper is to prove the efficiency of the query minimization algorithms based on minimization of the query restriction by elimination of the redundant conditions. The paper represents minimization algorithms based on the mathematical transformations, which detect and remove redundant conditions from query restriction to simplify it. It includes minimization algorithms based on “condition absorption”, prime implicants, and a set of linear inequalities minimization technics. The paper also includes theoretical justification of the efficiency of minimization approach to the query optimization based on restriction simplification. We also observe experimental results of the implementation of these optimization techniques and their influence on the query processing speed. In the end, we represent an observation of the query minimization impact on the whole optimization process.

Détail

Keywords: query optimization, lexical optimization.

Bibliographie

[1] Hall P. A. V., “Optimization of single expressions in a relational data base system”, IBM Journal of Research and Development, 20:3 (1976), 244–257 | DOI | Zbl

[2] Bellamkonda S. at al., “Enhanced Subquery Optimizations in Oracle”, Proceedings of the 35th international conference on Very large data base, August, 2009, v. 2, 2009, 1368

[3] “Optimization”, MySQL 5.5 Reference Manual, Chapter 7 http://dev.mysql.com/doc/refman/5.5/en/optimization.html

[4] PostgreSQL 8.3.3, postgresql-8.3.3/src/backend/optimizer/util/predtest.c

[5] Query Optimization in Oracle Database 10g Release 2, 9

[6] Seshadri P. at al., “Cost-Based Optimization for Magic: Algebra and Implementation”, ACM SIGMOD Record, 25:2 (1996) | DOI

[7] Faber W., Greco G., Leone N., “Sets and their application to data integration”, Journal of Computer and System Sciences, 73:4 (2007) | DOI | MR | Zbl

[8] Mendkovich N., Kuznetcov S., “New Algorithms for Lexical Query Optimization”, Proceedings of the 31st International Conference on Information Technology Interfaces (Cavtat/Dubrovnik, June 22–25, 2009), University of Zagreb, Zagreb, 2009, 187–192

[9] Kuznetsov S. D., Mendkovich N. A., “New algorithms for query modifications”, Modeling and Analysis of Information Systems, 16:4 (2009), 22–33 (in Russian)

[10] Kuznetsov S. D., Mendkovich N. A., “Optimization of queries containing conjunctions of conditions”, Modeling and Analysis of Information Systems, 18:3 (2011), 144–154 (in Russian)

[11] BNF Grammar for ISO/IEC 9075-2:2003 http://savage.net.au/SQL/sql-2003-2.bnf.html

[12] Khaitan P. at al., “Improved query plans for unnesting nested SQL queries”, Proceedings of 2nd International Conference on Computer Science and its Applications (December 10–12, Jeju Island, South Korea, 2009), IEEE, 2009, 147–152

[13] Muralikrishna M., “Improved unnesting algorithms for join aggregate SQL queries”, Proceedings of the 18th International Conference on Very Large Data Bases (August 23–27, Vancouver, Canada, 1992), Morgan Kaufmann Publishers Inc., San Francisco, 1992, 91–102

[14] Satoh K. at al., “Local and Global Query Optimization Mechanisms”, Proceedings of 11th International Conference on Very Large Data Bases (August 21–23, 1985, Stockholm, Sweden), Morgan Kaufmann, Berlin, 1985, 408–409

[15] Hellerstein J. M., Stonebraker M., “Predicate Migration: Optimizing Queries with Expensive Predicates”, ACM SIGMOD Record, 22:2 (1993), 267–276 | DOI

[16] Chaudhuri S., “Optimization of queries with user-defined predicates”, Journal ACM Transactions on Database Systems (TODS), 24:2 (1999), 177–228 | DOI

[17] Fontoura M. at al., “Efficiently Evaluating Complex Boolean Expressions”, Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, ACM, New York, 2010, 3–4 | DOI

[18] Vorwerk K., Paulley G. N., “On Implicate Discovery and Query Optimization”, Proceedings of the International Database Engineering and Applications Symposium, IDEAS 2002 (July 17–19, 2002, Edmonton, Canada), Computer Society, Los Alamitos, 2002, 2–12 | DOI

[19] Roy P. at al., “Efficient and extensible algorithms for multi-query optimization”, Proceedings of the 2000 ACM SIGMOD International Conference on Management of data, ACM, New York, NY, USA, 2000, 249–260

[20] Dalvia N. N. at al., “Pipelining in multi-query optimization”, Journal of Computer and System Science, 66:4 (2003) | MR

[21] Ioannidis Y. E., “Query Optimization”, ACM Computing Surveys (CSUR), 28:1 (1996), 121–123 | DOI

[22] Neumann T., “Query Simplification: Graceful Degradation for Join-Order Optimization”, SIGMOD'09 (June 29–July 2, 2009, Providence, Rhode Island, USA), 2009, 405–406

[23] Moerkotte G., Neumann T., “Dynamic programming strikes back”, Proceedings of SIGMOD Conference 2008 (June 9–12, 2008, Vancouver, BC, Canada), 2009