Safe constraint queries

SIAM Journal on Computing

Volumn 29, Issue 5, 2000, Pages 1652-1682

  Benedikt, Michael ^a   Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; POLYNOMIALS; RELATIONAL DATABASE SYSTEMS;

CLASSICAL CHARACTERIZATION THEOREM; SAFE CONSTRAINT QUERIES;

QUERY LANGUAGES;

EID: 0034538209     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798342484     Document Type: Article

References (50)

1. S. ABITEBOUL, R. HULL, AND V. VIANU, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. F. AFRATI, S. COSMADAKIS, S., GRUMBACH, AND G. KUPER, Linear vs. polynomial constraints in database query languages, in Proceedings of Conference on Principles and Practice of Constraint Programming, Springer-Verlag, New York, 1994, pp. 181-192.
3. A. K. AILAMAZYAN, M. M. GILULA, A. P. STOLBOUSHKIN, AND G. F. SHVARTS, Reduction of a relational model with infinite domains to the finite-domain case, Dokl. Akad. Nauk SSSR, 286 (1986), pp. 308-311 (in Russian); Soviet Phys. Dokl., 31 (1986), pp. 11-13 (in English).
4. A. K. AILAMAZYAN, M. M. GILULA, A. P. STOLBOUSHKIN, AND G. F. SHVARTS, Reduction of a relational model with infinite domains to the finite-domain case, Dokl. Akad. Nauk SSSR, 286 (1986), pp. 308-311 (in Russian); Soviet Phys. Dokl., 31 (1986), pp. 11-13 (in English).
5. P. S. ALEKSANDROV, Combinatorial Topology, Graylock Press, Albany, NY, 1956.
6. A. AVRON AND J. HIRSHFELD, On first order database query languages, in Proceedings of IEEE Logic in Computer Science, IEEE Press, Piscataway, NJ, 1991, pp. 226-231.
7. M. BENEDIKT, G. DONG, L. LIBKIN, AND L. WONG, Relational expressive power of constraint query languages, J. Assoc. Comput. Mach., 45 (1998), pp. 1-34.
8. M. BENEDIKT AND L. LIBKIN, On the structure of queries in constraint query languages, in Proceedings of IEEE Logic in Computer Science, IEEE Press, Piscataway, NJ, 1996, pp. 25-34.
9. M. BENEDIKT AND L. LIBKIN, Languages for relational databases over interpreted structures, in Proceedings of ACM Symposium on Principles of Databases Systems, ACM, New York, 1997, pp. 87-98.
10. M. BENEDIKT AND L. LIBKIN, Safe constraint queries, in Proceedings of ACM Symposium on Principles of Databases Systems, ACM, New York, 1998, pp. 99-108.
11. H. BIERI AND W. NEF, Elementary set operations with d-dimensional polyhedra, in Proc. Workshop on Computational Geometry (CG'88), Lecture Notes in Comput. Sci. 333, Springer-Verlag, New York, pp. 97-112.
12. C. C. CHANG AND H. J. KEISLER, Model Theory, North-Holland, Amsterdam, 1990.
13. M. DAVIS, On the number of solutions of Diophantine equations, Proc. Amer. Math. Soc., 35 (1972), pp. 552-554.
14. F. DUMORTIER, M. GYSSENS, L. VANDEURZEN, AND D. VAN GUCHT, On the decidability of semi-linearity of semi-algebraic sets, and its implications for spatial databases, in Proceedings of ACM Symposium on Principles of Databases Systems, ACM, New York, 1997, pp. 68-77.
15. M. ESCOBAR-MOLANO, R. HULL, AND D. JACOBS, Safety and translation of calculus queries with scalar functions, in Proceedings of ACM Symposium on Principles of Databases Systems, ACM, New York, 1993, pp. 253-264.
16. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New York, 1993.
17. S. GRUMBACH AND J. SU, Finitely representable databases, J. Comput. System Sci., 55 (1997), pp. 273-298.
18. S. GRUMBACH, J. SU, AND C. TOLLU, Linear constraint database, in Proceedings of Logic and Computational Complexity, Springer-Verlag, New York, 1994, pp. 426-446
19. R. HULL AND J. SU, Domain independence and the relational calculus, Acta Inform., 31 (1994), pp. 513-524.
20. O. H. IBARRA AND J. SU, On the containment and equivalence of database queries with linear constraints, in Proceedings of ACM Symposium on Principles of Databases Systems, ACM, New York, 1997, pp. 32-43.
21. P. KANELLAKIS, G. KUPER, AND P. REVESZ, Constraint query languages, J. Comput. System Sci., 51 (1995), pp. 26-52; extended abstract in PODS'90, pp. 299-313.
22. P. KANELLAKIS, G. KUPER, AND P. REVESZ, Constraint query languages, J. Comput. System Sci., 51 (1995), pp. 26-52; extended abstract in PODS'90, pp. 299-313.
23. M. KIFER, On safety, domain independence, and capturability of database queries, in Proc. Data and Knowledge Base, Morgan Kaufmann, Jerusalem, 1988, pp. 405-415.
24. M. KIFER, R. RAMAKRISHNAN, AND A. SILBERSCHATZ, An axiomatic approach to deciding query safety in deductive databases, in Proceedings of the ACM Symposium on Principles of Database Systems, ACM, New York, 1988, pp. 52-60.
25. D. MARKER, M. MESSMER, AND A. PILLAY. Model Theory of Fields, Springer-Verlag, New York, 1996.
26. A. LEVY AND D. SUCIU, Deciding containment for queries with complex objects, in Proceedings of the ACM Symposium on Principles of Database Systems, ACM, New York, 1997, pp. 20-31.
27. W. NEF, Beiträge zur Theorie der Polyeder, Herbert Lang, ed., Bern, Switzerland, 1978.
28. J. O'ROURKE, Computational Geometry in C, Cambridge University Press, Cambridge, UK, 1994.
29. J. PAREDAENS, J. VAN DEN BUSSCHE, AND D. VAN GUCHT, Towards a theory of spatial database queries, in Proceedings of ACM Symposium on Principles of Database Systems, ACM, New York, 1994, pp. 279-288.
30. J. PAREDAENS, J. VAN DEN BUSSCHE, AND D. VAN GUCHT, First-order queries on finite structures over the reals, SIAM J. Comput., 27 (1998), pp. 1747-1763.
31. J. PAREDAENS, B. KUIJPERS, G. KUPER, AND L. VANDEURZEN, Euclid, Tarski and Engeler encompassed, in Proceedings of Database Programming Languages, Lecture Notes in Comput. Sci. 1369, Springer-Verlag, New York, 1998, pp. 1-24.
32. A. PILLAY AND C. STEINHORN, Definable sets in ordered structures. III, Trans. Amer. Math. Soc., 309 (1988), pp. 469-476.
33. R. RAMAKRISHNAN, F. BANCILHOV, AND A. SILBERSCHATZ, Safety of recursive Horn clauses with infinite relations, in Proceedings of ACM Symposium on Principles of Database Systems, ACM, New York, 1987, pp. 328-339.
34. P. REVESZ, Safe query languages for constraint databases, ACM Trans. Database Systems, 23 (1998), pp. 58-99.
35. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
36. J. RUPPERT AND R. SEIDEL, On the difficulty of triangulating three-dimensional nonconvex polyhedra, Discrete Computat. Geom., 7 (1992), pp. 227-254.
37. Y. SAGIV AND M. YANNAKAKIS, Equivalence among relational expressions with the union and difference operators, J. Assoc. Comput. Mach., 27 (1980), pp. 633-655.
38. A. STOLBOUSHKIN AND M. TSAITLIN, Finite queries do not have effective syntax, Inform. and Comput., 153 (1999), pp. 99-116.
39. A. STOLBOUSHKIN AND M. TSAITLIN, Linear vs. order constraint queries over rational databases, in Proceedings of ACM Symposium on Principles of Database Systems, ACM, New York, 1996, pp. 17-27.
40. A. STOLBOUSHKIN AND M. TSAITLIN, Safe stratified datalog with integer order does not have syntax, ACM Trans. Database Systems, 23 (1998), pp. 100-109.
41. J. D. ULLMAN, Principles of Database and Knowledge-Base Systems, Computer Science Press, Rockville, MD, 1988.
42. J. D. ULLMAN, Information integration using logical views, in Proceedings of International Conference on Database Theory, Lecture Notes in Comput. Sci. 1186, Springer, Berlin, 1997, pp. 19-40.
43. L. VAN DEN DRIES, Remarks on Tarski's problem, concerning (R.+.*,exp), in Logic Colloquium '82, North-Holland, Amsterdam, 1984, pp. 97-121.
44. L. VAN DEN DRIES, Tame Topology and O-Minimal Structures, Cambridge University Press, Cambridge, UK, 1998.
45. L. VANDEURZEN, M. GYSSENS, AND D. VAN GUCHT, On the desirability and limitations of linear spatial database models, Lecture Notes in Comput. Sci. 951, Springer, New York, 1995, pp. 14-28.
46. L. VANDEURZEN, M. GYSSENS, AND D. VAN GUCHT, On query languages for linear queries definable with polynomial constraints, in Proc. Principles and Practice of Constraint Programming, Lecture Notes in Comput. Sci. 1118, Springer-Verlag, 1996, pp. 468-481.
47. L. VANDEURZEN, M. GYSSENS, AND D. VAN GUCHT, An expressive language for linear spatial database queries, in Proceedings of ACM Symposium on Principles of Database Systems, ACM, New York, 1998, pp. 109-118.
48. A. VAN GELDER AND R. TOPOR, Safety and translation of relational calculus queries, ACM Trans. Database Systems, 16 (1991), pp. 235-278.
49. M. Y. VARDI, The decision problem for database dependencies, Inform. Process. Lett., 12 (1981), pp. 251-254.
50. A. J. WILKIE, Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function, J. Amer. Math. Soc., 9 (1996), pp. 1051-1094.