Geodesic
New algorithms for query modifications
Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 4, pp. 22-33.

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

New algorithms for query modifications are proposed. These algorithms involve the lexical optimization based on the mathematical transformations that have never been used for the query optimization before.
Keywords: query optimization, lexical optimization. 
@article{MAIS_2009_16_4_a2,
     author = {S. D. Kuznetsov and N. A. Mendkovich},
     title = {New algorithms for query modifications},
     journal = {Modelirovanie i analiz informacionnyh sistem},
     pages = {22--33},
     publisher = {mathdoc},
     volume = {16},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MAIS_2009_16_4_a2/}
}
TY  - JOUR
AU  - S. D. Kuznetsov
AU  - N. A. Mendkovich
TI  - New algorithms for query modifications
JO  - Modelirovanie i analiz informacionnyh sistem
PY  - 2009
SP  - 22
EP  - 33
VL  - 16
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MAIS_2009_16_4_a2/
LA  - ru
ID  - MAIS_2009_16_4_a2
ER  - 
%0 Journal Article
%A S. D. Kuznetsov
%A N. A. Mendkovich
%T New algorithms for query modifications
%J Modelirovanie i analiz informacionnyh sistem
%D 2009
%P 22-33
%V 16
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MAIS_2009_16_4_a2/
%G ru
%F MAIS_2009_16_4_a2
S. D. Kuznetsov; N. A. Mendkovich. New algorithms for query modifications. Modelirovanie i analiz informacionnyh sistem, Tome 16 (2009) no. 4, pp. 22-33. http://geodesic.mathdoc.fr/item/MAIS_2009_16_4_a2/

[1] M. Jarke, J. Koch, “Query Optimization in Database Systems”, ACM Computer Survey, 16:2 (1984), 111–152 | MR

[2] K. Dzh. Deit, Vvedenie v sistemy baz dannykh, Vilyams, Moskva–Sankt-Peterburg–Kiev, 2001, 642 pp.

[3] Query Optimization in Oracle Database 10g Release 2, An Oracle White Paper, June, 2005

[4] S. Chaudkhari, “Metody optimizatsii zaprosov v relyatsionnykh sistemakh”, SUBD, 1998, no. 3

[5] S. D. Kuznetsov http://www.citforum.ru/database/articles/art_26.shtml

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

[7] W. Kim, “On optimizing an SQL-Like Nested Query”, ACM TODS, 1982, September, 447, 449, 450

[8] L. Baekgaard, L. Mark, “Incremental Computation of Nested Relational Query Expressions”, ACM TODS, 20:2 (1995) | DOI

[9] I. S. Mumick, S. J. Finkelsteint, H. Pirahesh, R. Ramakrishnan, “Magic is Relevant”, Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data (May 23-25, 1990; Atlantic City, NJ, USA), ed. Garcia-Molina H. Jagadish, ACM, 1990, 247–258

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

[11] S. N. Smirnov, I. S. Zadvorev, Rabotaem s Oracle, Uchebnoe posobie, Gelios ARV, M., 2002, 417–445

[12] V. Markl, G. M. Lohman, V. Raman, “LEO: An autonomic query optimizer for DB2”, IBM System Journal, 42:1 (2003) | DOI | MR

[13] 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), eds. Vesna Luzar-Stiffler, Iva Jarec, Zoran Bekic, Technical Editor Boris Grinfeld, 187–192

[14] K. E. Samuilov, L. A. Sevastyanov, S. S. Spesivov, Lektsii po diskretnoi matematike. Chast I: logika, RUDN, M., 2000, 26 pp.

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

[16] S. V. Yablonskii, Vvedenie v diskretnuyu matematiku, M., 1979, 231 pp. | MR | Zbl

[17] P. F. Tarasenko, M. F. Bukharova, “Tekhnologiya “The Reporter” dlya postroeniya otchetov po bazam dannykh”, Vestnik Tomskogo Gosudarstvennogo Universiteta, 2002, no. 275, Aprel, 171–172