The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Tutorial: languages for collection types
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Towards a theory of spatial database queries (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finitely representable databases (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Domain independence and the relational calculus
Acta Informatica
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Topological queries in spatial databases
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
First-order Definability over Constraint Databases
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Linear Constraint Query Languages: Expressive Power and Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
First-Order Queries on Finite Structures Over the Reals
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Relational expressive power of constraint query languages
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear vs. order constraint queries over rational databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
On the containment and equivalence of database queries with linear constraints (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Relational queries over interpreted structures
Journal of the ACM (JACM)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
On Capturing First-Order Topological Properties of Planar Spatial Databases
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Query Languages for Real Number Databases Based on Descriptive Complexity over R
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Limits of theory sequences over algebraically closed fields and applications
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Hi-index | 0.00 |
We study the structure of first-order and second-order queries over constraint databases. Constraint databases are formally modeled as finite relational structures embedded in some fixed infinite structure. We concentrate on problems of elimination of constraints, reducing quantification range to the active domain of the database and obtaining new complexity bounds. We show that for a large class of signatures, including real arithmetic constraints, unbounded quantification can be eliminated. That is, one can transform a sentence containing unrestricted quantification over the infinite universe to get an equivalent sentence in which quantifiers range over the finite relational structure. We use this result to get a new complexity upper bound on the evaluation of real arithmetic constraints. We also expand upon techniques in [21] and [4] for getting upper bounds on the expressiveness of constraint query languages, and apply it to a number of first-order and second-order query languages.