Skip to main content
SpringerLink
Log in

Comparison of expressive power of some query languages for databases

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

To outstanding mathematician and great person Sergei Ivanovich Adian on the occasion of his 80th birthday

Abstract

A version of the SQL language and a version of the stratified Datalog are considered, and it is proved that each of these languages can be translated into the other.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1995).

    MATH  Google Scholar 

  2. S. Abiteboul, M. Y. Vardi, and V. Vianu, “Fixpoint Logics, Relational Machines, and Computational Complexity,” in Structure in Complexity Theory: Proc. 7th Annu. Conf., Boston, 1992 (IEEE Comput. Soc. Press, Los Alamitos, CA, 1992), pp. 156–168.

    Chapter  Google Scholar 

  3. S. Abiteboul and V. Vianu, “Fixpoint Extensions of First-Order Logic and Datalog-like Languages,” in Logic in Computer Science: Proc. 4th Annu. Symp., Pacific Grove, CA, USA, 1989 (IEEE Comput. Soc. Press, Washington, DC, 1989), pp. 71–79.

    Chapter  Google Scholar 

  4. F. Afrati, S. S. Cosmadakis, and M. Yannakakis, “On Datalog vs. Polynomial Time,” in Principles of Database Systems: Proc. 10th ACM SIGACT-SIGMOD-SOGART Symp., Denver, 1991 (Assoc. Comput. Mach., New York, 1991), pp. 13–25.

    Chapter  Google Scholar 

  5. M. Ajtai and Y. Gurevich, “DATALOG vs. First-Order Logic,” in Foundations of Computer Science: Proc. 30th Annu. Symp. (IEEE Comput. Soc. Press, Los Alamitos, CA, 1989), pp. 142–146.

    Chapter  Google Scholar 

  6. O. V. Belegradek, A. P. Stolboushkin, and M. A. Taitslin, “On Problems of Databases over a Fixed Infinite Universe,” in Logic, Algebra, and Computer Science: Helena Rasiowa in Memoriam (Pol. Acad. Sci., Inst. Math., Warszawa, 1999), Banach Center Publ. 46, pp. 23–62.

    Google Scholar 

  7. A. Blass and Y. Gurevich, “Existential Fixed-Point Logic,” in Computation Theory and Logic, Ed. by E. Börger (Springer, Berlin, 1987), Lect. Notes Comput. Sci. 270, pp. 20–36.

    Google Scholar 

  8. A. Chandra and D. Harel, “Structure and Complexity of Relational Queries,” J. Comput. Syst. Sci. 25, 99–128 (1982).

    Article  MATH  Google Scholar 

  9. E. F. Codd, “A Relational Model of Data for Large Shared Data Banks,” Commun. ACM 13, 377–387 (1970).

    Article  MATH  Google Scholar 

  10. E. F. Codd, “Relational Completeness of Data Base Sublanguages,” in Data Base Systems, Ed. by R. Rustin (Prentice-Hall, Englewood Cliffs, NJ, 1972), pp. 65–98.

    Google Scholar 

  11. N. Immerman, “Relational Queries Computable in Polynomial Time,” Inf. Control 68, 86–104 (1986).

    Article  MathSciNet  MATH  Google Scholar 

  12. N. Immerman, “Languages That Capture Complexity Classes,” SIAM J. Comput. 16, 760–778 (1987).

    Article  MathSciNet  MATH  Google Scholar 

  13. P. C. Kanellakis and D. Q. Goldin, “Constraint Programming and Database Query Languages,” in Theoretical Aspects of Computer Software: Proc. 2nd Int. Symp. TACS’94 (Springer, Berlin, 1994), Lect. Notes Comput. Sci. 789, pp. 96–120.

    Google Scholar 

  14. P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz, “Constraint Query Languages,” J. Comput. Syst. Sci. 51(1), 26–52 (1995).

    Article  MathSciNet  Google Scholar 

  15. L. Libkin, Elements of Finite Model Theory (Springer, Berlin, 2004).

    MATH  Google Scholar 

  16. Y. N. Moschovakis, Elementary Induction on Abstract Structures (North-Holland, Amsterdam, 1974).

    MATH  Google Scholar 

  17. A. P. Stolboushkin and M. A. Taitslin, “Safe Stratified Datalog with Integer Order Does Not Have Syntax,” ACM Trans. Database Syst. 23(1), 100–109 (1998).

    Article  MathSciNet  Google Scholar 

  18. C. J. Date, An Introduction to Database Systems, 8th ed. (Pearson Education, Boston, MA, 2003; Vil’yams, Moscow, 2005).

    MATH  Google Scholar 

  19. S. M. Dudakov and M. A. Taitslin, “Collapse Results for Query Languages in Database Theory,” Usp. Mat. Nauk 61(2), 3–66 (2006) [Russ. Math. Surv. 61, 195–253 (2006)].

    MathSciNet  Google Scholar 

  20. K. E. Kline, SQL: In a Nutshell. A Desktop Quick Reference, 2nd ed. (O’Reilly, Sebastopol, CA, 2004; Kudits-Obraz, Moscow, 2006).

    Google Scholar 

  21. P. Wilton and J. Colby, Beginning SQL (Wiley, Indianapolis, IN, 2005; Dialektika, Moscow, 2006).

    Google Scholar 

  22. B. Forta, Sams Teach Yourself SQL in 10 Minutes, 3rd ed. (Sams Publ., Indianapolis, IN, 2004; Vil’yams, Moscow, 2005).

    Google Scholar 

  23. S. M. Dudakov, “SQL,” http://homepages.tversu.ru/~p000101/dudakov.pdf

Download references

Author information

Authors and Affiliations

  1. Chair of Informatics, Faculty of Applied Mathematics and Cybernetics, Tver State University, Sadovyi per. 35, Tver, 170004, Russia

    M. A. Taitslin

Authors
  1. M. A. Taitslin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Taitslin.

Additional information

Original Russian Text © M. A. Taitslin, 2011, published in Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2011, Vol. 274, pp. 297–313.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Taitslin, M.A. Comparison of expressive power of some query languages for databases. Proc. Steklov Inst. Math. 274, 273–288 (2011). https://doi.org/10.1134/S0081543811060174

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543811060174

Keywords

Search

Navigation