Linear Constraint Query Languages: Expressive Power and Complexity

We give an AC0 upper bound on the complexity of first-oder queries over (infinite) databases defined by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in first-order logic with linear constraints.

[1]  Jianwen Su,et al.  Finitely representable databases (extended abstract) , 1994, PODS '94.

[2]  E. F. CODD,et al.  A relational model of data for large shared data banks , 1970, CACM.

[3]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[4]  Jan Paredaens,et al.  On the Expressive Power of the Relational Algebra , 1978, Inf. Process. Lett..

[5]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[6]  David Harel,et al.  Completeness results for recursive data bases , 1993, J. Comput. Syst. Sci..

[7]  Jan Paredaens,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS.

[8]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[9]  D. V. Gucht,et al.  First-order queries on finite structures over the reals , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[10]  Jan Van den Bussche,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS '94.

[11]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[12]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[13]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[14]  Dwight R. Bean,et al.  Recursive Euler and Hamilton paths , 1976 .

[15]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[16]  François Bancilhon,et al.  On the Completeness of Query Languages for Relational Data Bases , 1978, MFCS.

[17]  David Harel.  Hamiltonian paths in infinite graphs , 1991 .

[18]  Robert L. Vaught,et al.  Sentences true in all constructive models , 1960, Journal of Symbolic Logic.

[19]  Dina Q. Goldin,et al.  Constraint Programming and Database Query Languages , 1994, TACS.

[20]  Gabriel M. Kuper,et al.  Constraint Query Languages , 1995, J. Comput. Syst. Sci..