Relational queries over interpreted structures

Journal of the ACM

Volumn 47, Issue 4, 2000, Pages 644-680

  Benedikt, Michael ^a   Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

0 minimality; Collapse results; Constraints; Quantifier elimination; Relational calculus

Indexed keywords

COLLAPSE RESULTS; QUANTIFIER ELIMINATION; RELATIONAL CALCULUS;

ALGORITHMS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; POLYNOMIALS; SEMANTICS;

RELATIONAL DATABASE SYSTEMS;

EID: 0000136378     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/347476.347477     Document Type: Article

References (54)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, Mass.
2. ABITEBOUL, S., AND VIANU, V. 1991. Datalog extensions for database queries and updates. J. Compta. Syst. Ser. 43, 62-124.
3. AILAMAZYAN, A. K., GiLULA, M. M., SiOLBOUSHKiN, A. P., AND SuVARTS, G. F. 1986. Reduction of a relational model with infinite domains to the finite-domain case. Sov. Pliys.-Doklady 31, 11-13.
4. BALDWIN, J., AND BENEDICT, M. 1998. Embedded finite models, stability theory and the impact of order. In Proceedings of the 13th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, Calif., pp. 490-500.
5. 1. J. Comput. Syst. Sei. 41, 274-306.
6. BASU, S. 1999. An improved algorithm for quantifier elimination over real closed fields. J. ACM 46.
7. BASU, S. 1997. Uniform quantifier elimination and constraint query processing. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC '97) (Maui, HI, July 21-23), ACM, New York, pp. 21-27.
8. BEERI, C., AND MILO, T. 1997. Comparison of functional and predicative query paradigms. J. Comput. Syst. Sei. 54, 3-33.
9. BELEGRADEK, O., STOLBOUSHKIN, A., AND TAITSLIN, M. 1999. Extended order-generic queries. Ann. Pure Appl. Log. to appear.
10. BENEDICT, M., DONG, G., LIBKIN, L., AND WONG, L. 1998. Relational expressive power of constraint query languages. J. ACM 45, 1 (Jan.), 1-34.
11. BENEDICT, M., AND LIBKIN, L. 1996. On the structure of queries in constraint query languages. In Proceedings of the llth Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 25-34.
12. BENEDICT, M., AND LIBKIN, L. 1997. Languages for relational databases over interpreted struc-tures. In Proceedings of the 16th ACM SIGACT-SIGMOD-SIGADT Symposium on Principles of Database Systems (Tucson, Az., May 12-14). ACM, New York, pp. 87-98.
13. BENEDICT, M., AND LIBKIN, L. 1998. Safe constraint queries. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGADT Symposium on Principles of Database Systems (Seattle, Wash., June 1-3). ACM, New York, pp. 99-108.
14. BEN-OR, M., KOZEN, D., AND REIF, J. 1986. The complexity of elementary algebra and geometry. J. Comput. Syst. Sei. 32, 251-264.
15. BOPPANA, R. B., AND SlPSER, M. 1990. The complexity of finite functions. In Handbook of Theoretical Computer Science, Vol. A, Chap. 14, J. van Leeuwen, Ed. North-Holland, Amsterdam, The Netherlands.
16. CABIBBO, L., AND VAN DEN BUSSCHE, J. 1998. Converting untyped formulas to typed ones. Acta Inf. 35, 8, 637-643.
17. CHANDRA, A., AND HAREL, D. 1980. Computable queries for relational databases. J. Comput. Syst. Sei. 21, 2, 156-178.
18. CHANDRA, A., AND HAREL, D. 1982. Structure and complexity of relational queries. J. Comput. Syst. Sei. 25, 99-128.
19. CHANG, C. C., AND KEISLER, H. J. 1990. Model Theory. North Holland, Amsterdam, The Netherlands.
20. DAWAR, A., LINDELL, S., AND WEINSTEIN, S. 1996. First order logic, fixed point logic, and linear order. In Computer Science Logic '95. Lecture Notes in Computer Science, vol. 1092. Springer-Verlag, New York, pp. 161-177.
21. EBBINGHAUS, H.-D., AND FLUM, J. 1995. Finite Model Tlieory. Springer-Verlag, New York.
22. EscoBAR-MoLANO, M., HULL, R., AND JACOBS, D. 1993. Safety and translation of calculus queries with scalar functions. In Proceedings of the 12th ACM SIGACT-SIGMOD-S1GADT Symposium on Principles of Database Systems (Washington, D.C., May 25-28). ACM, New York, pp. 253-264.
23. ETESSAMI, K. 1997. Counting quantifiers, successor relations, and logarithmic space. J. Cotnput. Syst. Sei. 54, 400-411.
24. FAOIN, R. 1976. Probabilities on finite models. J. Symb. Logic 41, 50-58.
25. FüRST, M., SAXE, J., AND SIPSER, M. 1984. Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17, 13-27.
26. GRäDEL, E., AND GUREVICH, Y. 1998. Metafinite model theory. Inf. Comput. 140, 26-81.
27. GRAHAM, R. L., ROTHSCHILD, B. L., AND SPENCER, J. H. 1990. Ramsey Tlieory. Wiley, New York.
28. GRUMBACH, S., AND Su, J. 1997a. Queries with arithmetical constraints. Theoret. Comput. Sei. 173, 151-181.
29. GRUMBACH, S., Su, J., AND TOLLU, C. 1994. Linear constraint databases. In Proceedings of Logic and Computer Complexity, 1994. Lecture Notes in Computer Science, vol. 960. Springer-Verlag, New York, pp. 426-446.
30. GRUMBACH, S., AND Su, J. 1997b. Finitely representable databases. J. Comput. Syst. Sei. 55, 273-298.
31. GUREVICH, Y., AND SHELAH, S. 1986. Fixed-point extensions of first-order logic. Ann. Pure Appl. Logic 32, 265-280.
32. HULL, R., AND Su, J. 1991. On the expressive power of databases with intermediate types. J. Comput. Syst. Sei. 43, 219-267.
33. HULL, R., AND Su, J. 1994. Domain independence and the relational calculus. Acta Inf. 31, 513-524.
34. IMMERMAN, N. 1986. Relational queries computable in polynomial time. Inf. Control 68, 86-104.
35. IMMERMAN, N. 1995. Descriptive complexity: A logician's approach to computation. Notices AMS 42, 1127-1133.
36. KANELLAKIS, P., KUPER, G., AND REVESZ, P. 1995. Constraint query languages. J. Comput. Syst. Sci. 51, 26-52.
37. KLUG, A. 1988. On conjunctive queries containing inequalities. J. ACM 35, 1 (Mar.), 146-160.
38. KOLAITIS, PH., AND VARDI, M. 1992. Infinitary logic and 0-1 laws. Inf. Comput. 98, 258-294.
39. KOLAITIS, PH., AND VARDI, M. 1990. 0-1 laws and decision problems for fragments of secondorder logic. Inf. Comput. 87, 302-338.
40. LIBKIN, L., AND WONG, L. 1997a. Query languages for bags and aggregate functions. J. Comput. Syst. Sei. 55, 241-272.
41. LIBKIN, L., AND WONG, L. 1997b. On the power of aggregation in relational query languages. In Proceedings of Database Programming Languages (DBPL'97). Lecture Notes in Computer Science, vol. 1369. Springer-Verlag, New York, pp. 260-280.
42. MOSCHOVAKIS, Y. 1974. Elementary Induction on Abstract Structures. North-Holland, Amsterdam, The Netherlands.
43. OTTO, M., AND VAN DEN BUSSCHE, J. 1996. First-order queries on databases embedded in an infinite structure. Inf. Proc. Lett. 60, 37-41.
44. PARBERRY, I., AND SCHNITGER, G. 1988. Parallel computation and threshold functions. J. Comput. Syst. Sei. 36, 278-302.
45. PAREDAENS, J., VAN DEN BUSSCHE, J., AND VAN GUCHT, D. 1998. First-order queries on finite structures over the reals. SUM J. Comput. 27, 6, 1747-1763.
46. PILLAY, A., AND STEINHORN, C. 1988. Definable sets in ordered structures. III. Trans. AMS 309, 469-476.
47. STOLBOUSHKIN, A. P., AND TAITSLIN, M. A. 1996. Linear vs. order constraint queries over rational databases. In Proceedings of the 15th ACM SIGACT-SIGMOD-SIGADT Symposium on Principles of Database Systems (Montreal, Que., Canada, June 3-5). ACM, New York, pp. 17-27.
48. TARSKI, A. 1951. A Decision Method for Elementary Algebra and Geometry. 2nd ed. University of California Press.
49. ULLMAN, J. D. 1989. Principles of Database and Knowledgebase Systems, Vol. I. Computer Science Press.
50. VAN DEN DRIES, L. 1998. Tame Topology and O-minimal Structures. Cambridge.
51. VAN DER MEYDEN, R. 1997. The complexity of querying indefinite data about linearly ordered domains.J. Compttt. Syst. Sei. 54, l, 113-135.
52. VARDI, M. Y. 1982. The complexity of relational query languages. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (San Francisco, Calif., May 5-7). ACM, New York, pp. 137-146.
53. VARDI, M. Y. 1995. On the complexity of bounded-variable queries. In Proceedings of the 14th ACM SIGACT-SIGMOD-SIGADT Symposium on Principles of Database Systems (San Jose, Calif., May 22-26). ACM, New York, pp. 266-276.
54. WILKIE, A. J. 1996. Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function.J. A. M. S. 9, 1051-1094.