Voir la notice de l'article provenant de la source Math-Net.Ru
@article{TM_2011_274_a16,
author = {M. A. Taitslin},
title = {Comparison of expressive power of some query languages for databases},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {297--313},
publisher = {mathdoc},
volume = {274},
year = {2011},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TM_2011_274_a16/}
}
M. A. Taitslin. Comparison of expressive power of some query languages for databases. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Algorithmic aspects of algebra and logic, Tome 274 (2011), pp. 297-313. http://geodesic.mathdoc.fr/item/TM_2011_274_a16/
[1] Abiteboul S., Hull R., Vianu V., Foundations of databases, Addison-Wesley, Reading, MA, 1995 | Zbl
[2] Abiteboul S., Vardi M.Y., Vianu V., “Fixpoint logics, relational machines, and computational complexity”, Structure in complexity theory, Proc. 7th Annu. Conf., Boston, 1992., IEEE Comput. Soc. Press, Los Alamitos, CA, 1992, 156–168. | MR
[3] Abiteboul S., Vianu V., “Fixpoint extensions of first-order logic and Datalog-like languages”, Logic in computer science, Proc. 4th Annu. Symp., Pacific Grove, CA (USA), 1989, IEEE Comput. Soc. Press, Washington, DC, 1989, 71–79
[4] Afrati F., Cosmadakis S.S., Yannakakis M., “On Datalog vs. polynomial time”, Principles of database systems, Proc. 10th ACM SIGACT–SIGMOD–SOGART Symp., Denver, 1991, Assoc. Comput. Mach., New York, 1991, 13–25
[5] Ajtai M., Gurevich Y., “DATALOG vs. first-order logic”, Foundations of computer science, Proc. 30th Annu. Symp., IEEE Comput. Soc. Press, Los Alamitos, CA, 1989, 142–146
[6] Belegradek O.V., Stolboushkin A.P., Taitslin M.A., “On problems of databases over a fixed infinite universe”, Logic, algebra, and computer science, Helena Rasiowa in memoriam, Banach Center Publ., 46, Pol. Acad. Sci., Inst. Math., Warszawa, 1999, 23–62 | MR | Zbl
[7] Blass A., Gurevich Y., “Existential fixed-point logic”, Computation theory and logic, Lect. Notes Comput. Sci., 270, eds. E. Börger, Springer, Berlin, 1987, 20–36 | DOI | MR
[8] Chandra A., Harel D., “Structure and complexity of relational queries”, J. Comput. and Syst. Sci., 25 (1982), 99–128 | DOI | Zbl
[9] Codd E.F., “A relational model of data for large shared data banks”, Commun. ACM, 13 (1970), 377–387 | DOI | Zbl
[10] Codd E.F., “Relational completeness of data base sublanguages”, Data base systems, eds. R. Rustin, Prentice-Hall, Englewood Cliffs, NJ, 1972, 65–98
[11] Immerman N., “Relational queries computable in polynomial time”, Inf. and Control., 68 (1986), 86–104 | DOI | MR | Zbl
[12] Immerman N., “Languages that capture complexity classes”, SIAM J. Comput., 16 (1987), 760–778 | DOI | MR | Zbl
[13] Kanellakis P.C., Goldin D.Q., “Constraint programming and database query languages”, Theoretical aspects of computer software, Proc. 2nd Intern. Symp. TACS'94, Lect. Notes Comput. Sci., 789, Springer, Berlin, 1994, 96–120 | DOI | Zbl
[14] Kanellakis P.C., Kuper G.M., Revesz P.Z., “Constraint query languages”, J. Comput. and Syst. Sci., 51:1 (1995), 26–52 | DOI | MR
[15] Libkin L., Elements of finite model theory, Springer, Berlin, 2004 | MR
[16] Moschovakis Y.N., Elementary induction on abstract structures, North-Holland, Amsterdam, 1974 | MR | Zbl
[17] Stolboushkin A.P., Taitslin M.A., “Safe stratified Datalog with integer order does not have syntax”, ACM Trans. Database Syst., 23:1 (1998), 100–109 | DOI | MR
[18] Deit K.Dzh., Vvedenie v sistemy baz dannykh, 8-e izd, Vilyams, M., 2005
[19] Dudakov S.M., Taitslin M.A., “Translyatsionnye rezultaty dlya yazykov zaprosov v teorii baz dannykh”, UMN., 61:2 (2006), 3–66 | DOI | MR | Zbl
[20] Klain K., SQL. Spravochnik, Kudits-Obraz, M., 2006
[21] Uilton P., Kolbi Dzh., SQL dlya nachinayuschikh, Dialektika, M., 2006
[22] Forta B., Osvoi samostoyatelno SQL. 10 minut na urok, 3-e izd., Vilyams, M., 2005
[23] Dudakov S.M., SQL, http://homepages.tversu.ru/~p000101/dudakov.pdf