Geodesic
Optimization of queries containing conjunctions of conditions
Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 3, pp. 144-154.

Voir la notice de l'article provenant de la source Math-Net.Ru

A new algorithm for query optimization is proposed. This algorithm simplifies queries restriction containing multi-attribute conditions. It also solves the problem of “Condition AND Conjunction of conditions” expressions.
Keywords: query optimization, lexical optimization. 
@article{MAIS_2011_18_3_a11,
     author = {S. D. Kuznetsov and N. A. Mendkovich},
     title = {Optimization of queries containing conjunctions of conditions},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {144--154},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2011_18_3_a11/}
}
TY  - JOUR
AU  - S. D. Kuznetsov
AU  - N. A. Mendkovich
TI  - Optimization of queries containing conjunctions of conditions
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2011
SP  - 144
EP  - 154
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2011_18_3_a11/
LA  - ru
ID  - MAIS_2011_18_3_a11
ER  - 
%0 Journal Article
%A S. D. Kuznetsov
%A N. A. Mendkovich
%T Optimization of queries containing conjunctions of conditions
%J Modelirovanie i analiz informacionnyh sistem
%D 2011
%P 144-154
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2011_18_3_a11/
%G ru
%F MAIS_2011_18_3_a11
S. D. Kuznetsov; N. A. Mendkovich. Optimization of queries containing conjunctions of conditions. Modelirovanie i analiz informacionnyh sistem, Tome 18 (2011) no. 3, pp. 144-154. http://geodesic.mathdoc.fr/item/MAIS_2011_18_3_a11/

[1] S. Chaudhuri, “Query Optimizers: Time to Rethink the Contract?”, Proceedings of the ACM SIGMOD International Conference on Management of Data (Providence, Rhode Island, USA, June 29 – July 2, 2009)

[2] Y. E. Ionnidis, “Query Optimization”, The Computer Science and Engineering Handbook, CRC Press, Boca Raton, 1996

[3] S. Chaudhari, “An Overview of Query Optimization in Relational Systems”, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of Database Systems (June 1–3, 1998), 1998

[4] S. D. Kuznetsov, Metody optimizatsii vypolneniya zaprosov v relyatsionnykh SUBD (Dostup 10 iyunya 2011 goda) http://www.citforum.ru/database/articles/art_26.shtml

[5] M. Muralikrishna, “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)

[6] P. Khaitan, K. M. Satish, S. B. Korra, S. K. Jena, “Improved Query Plans for Unnesting Nested SQL Queries”, Proceedings of 2nd International Conference on Computer Science and its Applications (December 10–12, South Korea, 2009)

[7] K. Dzh. Deit, Vvedenie v sistemy baz dannykh, Moskva; Sankt-Peterburg; Kiev, 2001

[8] N. May, S. Helmer, G. Moerkotte, “Strategies for Query Unnesting in XML Databases”, ACM Transactions on Database Systems, 2006, no. 331(3)

[9] S. Bellamkonda, R. Ahmed, A. Witkowski, A. Amor, M. Zait, C.-C. Lin, “Enhanced Subquery Optimizations in Oracle”, Proceedings of the 35th international conference on Very large data base (Lyon, France, August 28, 2009)

[10] N. Mendkovich, S. Kuznetcov, “New Algorithms for Lexical Query Optimization”, Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces (June 22–25, 2009, Cavtat/Dubrovnik, Croatia), Edited by Vesna Luzar-Stiffler, Iva Jarec, Zoran Bekic. Technical Editor Boris Grinfeld

[11] S. D. Kuznetsov, N. A. Mendkovich, “Novye algoritmy leksicheskoi optimizatsii zaprosov”, Modelirovanie i analiz informatsionnykh sistem, 16:4 (2009), 22–33

[12] W. V. Quin, “O cores and prime implicants of truth functions”, American Mathematics Monthly, 66:9 (1959) | MR | Zbl

[13] E. J. McCluskey, “Minimization of Boolean Functions”, The Bell System Technical Journal, 35:5, November (1956) | MR