Relational expressive power of constraint query languages

Journal of the ACM

Volumn 45, Issue 1, 1998, Pages 1-34

  Benedikt, Michael ^a   Dong, Guozhu ^b   Libkin, Leonid ^a   Wong, Limsoon ^c,d  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^d BioInformatics Center   (United States)

Author keywords

Constraint query language; Constraints; Database; Expressive power; F.4.1 Mathematical logic and formal languages : Model theory; H.2.3 Database managemnet : Query languages; Languages; Relational calculus; Theory

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL LINGUISTICS; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; RELATIONAL DATABASE SYSTEMS; THEOREM PROVING;

CONSTRAINT QUERY LANGUAGES; POLYNOMIAL INEQUALITY; RELATIONAL CALCULUS;

QUERY LANGUAGES;

EID: 0031655172     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/273865.273870     Document Type: Article

References (40)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
2. AFRATI, F., ANDRONIKOS, T., AND KAVALIEROS, T. 1995. On the expressiveness of first-order constraint languages. In Proceedings of the 1st Workshop on Constraints Databases and Their Applications. Springer-Verlag, New York, pp. 22-39.
3. AFRATI, F., COSMADAKIS, S., GRUMBACH, S., AND KUPER, G. 1994. Linear vs. polynomial constraints in database query languages. In Proceedings of Conference on Principles and Practice of Constraint Programming. Springer-Verlag, New York, pp. 181-195.
4. AHO, A. V., AND ULLMAN, J. D. 1979. Universality of data retrieval languages. In Proceedings of the 6th Symposium on Principles of Programming Languages (Texas, Jan.). DIMACS, Rutgers Univ., New Brunswick, N.J., pp. 110-120.
5. BELEGRADEK, O. V., STOLBOUSHKIN, A. P., AND TAITSLIN, M. A. 1995. On order-generic queries. DIMACS Tech. Rep. 95-56. Dec.
6. BENEDIKT, M., DONG, G., LIBKIN, L., AND WONG, L. 1996. Relational expressive power of constraint query languages. In Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Montreal, Que., Canada, June 3-5). ACM, New York, pp. 5-16.
7. BENEDIKT, M., AND KEISLER, H. J. 1997. On the expressive power of unary counters. In Proceedings of the International Conference on Database Theory. Lecture Notes on Computer Science, vol. 1186. Springer-Verlag, New York, pp. 291-305.
8. BENEDIKT, M., AND LIBKIN, L. 1996. On the structure of queries in constraint query languages. In Proceedings of IEEE Symposium on Logic in Computer Science. IEEE, New York, pp. 25-34.
9. BENEDIKT, M., AND LIBKIN, L. 1997. Languages for relational databases over interpreted structures. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Tucson, Az., May 12-14). ACM, New York, pp. 87-98.
10. CHANDRA, A., AND HAREL, D. 1980. Computable queries for relational databases. J. Comput. Syst. Sci. 21, 2, 156-178.
11. CHANG, C. C., AND KEISLER, H. J. 1990. Model Theory. North-Holland, Amsterdam, The Netherlands.
12. EBBINGHAUS, H.-D., AND FLUM, J. 1995. Finite Model Theory. Springer-Verlag, New York.
13. FAGIN, R. 1976. Probabilities on finite models. J. Symb. Logic 41, 1, 50-58.
14. GAIFMAN, H. 1982. On local and non-local properties. In Proceedings of the Herbrand Symposium. Logic Colloquium '81. North-Holland, Amsterdam, The Netherlands, pp. 105-135.
15. GRAHAM, R. L., ROTHSCHILD, B. L., AND SPENCER, J. H. 1990. Ramsey Theory. Wiley, New York.
16. GRUMBACH, S., AND Su, J. 1994. Finitely representable databases. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Minneapolis, Minn., May 24-26). ACM, New York, pp. 289-300.
17. GRUMBACH, S., AND Su, J. 1995. First-order definability over constraint databases. In Proceedings of Principles and Practice of Constraint Programming. Springer-Verlag, New York, pp. 121-136.
18. GRUMBACH, S., Su, J., AND TOLLU, C. 1994. Linear constraint databases. In Proceedings of Logic and Computational Complexity. Springer-Verlag, New York, pp. 426-446.
19. HENSON, C. W. 1974. The isomorphism property in nonstandard analysis and its use in the theory of Banach spaces. J. Symb. Logic 39, 717-731.
20. HULL, R., AND Su, J. 1994. Domain independence and the relational calculus. Acta Inf. 31, 513-524.
21. HULL, R., AND YAP, C. K. 1984. The format model: A theory of database organization. J. ACM 31, 3 (July), 518-537.
22. KANELLAKIS, P. 1995. Constraint programming and database languages: A tutorial. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (San Jose, Calif., May 22-25). ACM, New York, pp. 46-53.
23. KANELLAKIS, P., KUPER, G., AND REVESZ, P. 1990. Constraint query languages. J. Comput. Syst. Sci. 51, 26-52.
24. KNIGHT, J. F., PILLAY, A., AND STEINHORN, C. I. 1986. Definable sets in ordered structures II. Trans. AMS 295, 593-605.
25. KUPER, G. 1990. On the expressive power of the relational calculus with arithmetic constraints. In Proceedings of the International Conference on Database Theory. Springer-Verlag, New York, pp. 201-211.
26. MARKER, D. 1996. Model theory and exponentiation. Not. AMS 43, 753-759.
27. NARASIMHA, R. 1971. Several Complex Variables. University of Chicago, Press, Chicago, Ill.
28. OTTO, M., AND VAN DEN BUSSCHE, J. 1996. First-order queries on databases embedded in an infinite structure. Inf. Proc. Lett. 14, 37-41.
29. PAREDAENS, J., VAN DEN BUSCHE, J., AND VAN GUCHT, D. 1994. Towards a theory of spatial database queries. In Proceedings of the 13th ACM Symposium on Principles of Database Systems (Minneapolis, Minn., May 24-26). ACM, New York, pp. 279-288.
30. PAREDAENS, J., VAN DEN BUSCHE, J., AND VAN GUCHT, D. 1995. First-order queries on finite structures over the reals. In Proceedings of the 10th IEEE Symposium on Logic in Computer Science (San Diego, Calif.). IEEE, New York, pp. 79-87. (Full paper to appear in SIAM J. Comput.)
31. PILLAY, A., AND STEINHORN, C. 1984. Definable sets in ordered structures. Bull. AMS 11, 159-162.
32. PILLAY, A., AND STEINHORN, C. 1988. Definable sets in ordered structures. III. Trans. AMS 309, 469-476.
33. REVESZ, P. 1998. Constraint databases: A survey. In Proceedings of the Workshop on Semantics in Databases (Prague, Czech Republic). Springer-Verlag, New York.
34. ROSENSTEIN, J. G. 1982. Linear Orderings. Academic Press, Orlando, Fla.
35. SPEISSINGER, P. 1996. Order Minimality of the Gamma Function. Personal communication.
36. STOLBOUSHKIN, A. P., AND TAITSLIN, M. A. 1996. Linear vs. order constraint queries over rational databases. In Proceedings of the 15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Montreal, Que., Canada, June 3-5). ACM, New York, pp. 17-27.
37. TARSKI, A. 1951. A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley, Calif.
38. VAN DEN DRIES, L. 1988. Alfred Tarski's elimination theory for real closed fields. J. Symb. Logic 53, 7-19.
39. VAN DEN DRIES, L., MACINTYRE, A., AND MARKER, D. 1994. The elementary theory of restricted analytic fields with exponentiation. Ann. Math. 85, 19-56.
40. WILKIE, A. J. 1996. Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential functions. J. AMS 9, 1051-1094.