Query Safety with Constraints

  • Michael Benedikt
  • Leonid Libkin
Chapter

Abstract

The power of classical query languages is linked to the fact that they express a restricted class of declarative programs. The class of semantic objects expressible through queries in the relational calculus, for example, is limited in a number of ways: They have PTIME data complexity, and their expressiveness is well understood. Although relational calculus queries may not return finite results, a natural subclass of the relational calculus does; namely the class of range-restricted queries. This class gives guarantees of finite output, and is complete in this respect, capturing all relational calculus queries whose outputs are always finite, the safe queries.

Keywords

Hull Decid Tame 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Notes

  1. [AHV95]
    S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases.Addison-Wesley, 1995.Google Scholar
  2. [U1188]
    J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume I. Computer Science Press, 1988.Google Scholar
  3. [Di 69]
    R. A. Di Paola. The recursive unsolvability of the decision problem for a class of definite formulas. Journal of the ACM (JACM),16(2):324327, 1969.Google Scholar
  4. [Var81]
    M. Y. Vardi. The decision problem for database dependencies. Information Processing Letters (IPL), 12 (5): 251–254, 1981.MathSciNetMATHCrossRefGoogle Scholar
  5. [Top91]
    R. Topor. Safe database queries with arithmetic relations. In Proceedings of the 14th Australian Computer Science Conference, pages 1–13. Australian Computer Science Communications, 1991.Google Scholar
  6. [EMHJ93]
    M. Escobar-Molano, R. Hull, and D. Jacobs. Safety and translation of calculus queries with scalar functions. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’93), pages 253–264. ACM Press, 1993.Google Scholar
  7. [VT91]
    A. Van Gelder and R. W. Topor. Safety and translation of relational calculus queries. ACM Transactions on Databases Systems (TODS), 16 (2): 235–278, 1991.CrossRefGoogle Scholar
  8. [AGSS86]
    A. K. Aylamazyan, M. M. Gilula, A. P. Stolboushkin, and G. F. Schwartz. Reduction of the relational model with infinite domains to the case of finite domains. Doklady Akademii Nauk SSSR,286(2):308311, 1986. In Russian.Google Scholar
  9. [AH91]
    A. Avron and Y. Hirshfeld. On first order database query languages. In Proceedings 6th IEEE Symposium on Logic in Computer Science (LICS’91), pages 226–231, 1991.CrossRefGoogle Scholar
  10. [BL97]
    M. Benedikt and L. Libkin. Languages for relational databases over interpreted structures. In Proceedings of the 16th ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 87–98. ACM Press, 1997.Google Scholar
  11. [ST95]
    A. P. Stolboushkin and M. A. Taitslin. Finite queries do not have effective syntax. In Proceedings of the 14th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS’95), pages 277–285. ACM Press, 1995.Google Scholar
  12. [BL98]
    M. Benedikt and L. Libkin. Safe constraint queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98),pages 99–108. ACM Press, 1998. Full version to appear in SIAM Journal on Computing.Google Scholar
  13. [RBS87]
    R. Ramakrishnan, F. Bancilhon, and A. Silberschatz. Safety of recursive Horn clauses with infinite relations. In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’87)pages 328–339. ACM Press, 1987. Google Scholar
  14. [MMP96]
    D. Marker, M. Messmer, and A. Pillay. Model Theory of Fields. Springer-Verlag, 1996.Google Scholar
  15. [IS97]
    O. H. Ibarra and J. Su. On the containment and equivalence of database queries with linear constraints. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 32–43. ACM Press, 1997.Google Scholar
  16. [CM77]
    A. K. Chandra and P. M. Merlin. Optimal implementations of conjunctive queries in relational data bases. In Proceedings of the 9th ACM Symposium on Theory of Computing (STOC’77), pages 77–90, 1977.Google Scholar
  17. [SY80]
    Y. Sagiv and M. Yannakakis. Equivalence among relational expressions with the union and difference operators. Journal of the ACM (JACM), 27 (4): 633–655, 1980.MathSciNetMATHCrossRefGoogle Scholar
  18. [DGVV97]
    F. Dumortier, M. Gyssens, L. Vandeurzen, and D. Van Gucht. On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’97), pages 68–77. ACM Press, 1997.Google Scholar
  19. [Roc70]
    R. T. Rockafellar. Convex Analysis. Princeton University Press, 1970.Google Scholar
  20. [Nef78]
    W. Nef. Beiträge zur Theorie der Polyeder mit Anwendungen in der Computergrahik. Verlag Herbert Lang and Cie. AG, 1978.Google Scholar
  21. [RS92]
    J. Ruppert and R. Seidel. On the difficulty of triangulating three-dimensional nonconvex polyhedra. GEOMETRY: Discrete and Computational Geometry, 7: 227–253, 1992.MathSciNetMATHCrossRefGoogle Scholar
  22. [VGV98]
    L. Vandeurzen, M. Gyssens, and D. Van Gucht. An expressive language for linear spatial database queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’98), pages 109–118. ACM Press, 1998.Google Scholar
  23. [Rev98d]
    Transactions on Databases Systems (TODS),23(1):58–99, 1998.Google Scholar
  24. [ST98]
    A. P. Stolboushkin and M. A. Taitslin. Safe stratified Datalog with integer order does not have syntax. ACM Transactions on Databases Systems (TODS), 23 (1): 100–109, 1998.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Michael Benedikt
  • Leonid Libkin

There are no affiliations available

Personalised recommendations