The Format Model: A Theory of database Organization
Journal of the ACM (JACM)
On the expressive power of the relational calculus with arithmetic constraints (extended abstract)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
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
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
First-order queries on databases embedded in an infinite structure
Information Processing Letters
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth 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
Linear vs Polynomial Constraints in Database Query Languages
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
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
On the Expressiveness of First-Order Constraint Languages
Proceedings of the ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications
Expressive Power of Unary Counters
ICDT '97 Proceedings of the 6th International Conference on Database Theory
First-Order Queries on Finite Structures Over the Reals
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Order-Generic Queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Exact and approximate aggregation in constraint query languages
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Journal of the ACM (JACM)
Reachability and connectivity queries in constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relational queries over interpreted structures
Journal of the ACM (JACM)
On first-order topological queries
ACM Transactions on Computational Logic (TOCL)
Efficient Querying and Animation of Periodic Spatio-Temporal Databases
Annals of Mathematics and Artificial Intelligence
Parametric Rectangles: A Model for Querying and Animation of Spatiotemporal Databases
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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
Quantifier Rank for Parity of Embedded Finite Models
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
The 3W Model and Algebra for Unified Data Mining
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Efficient Querying of Periodic Spatiotemporal Objects
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Definability over Linear Constraints
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Expressing Topological Connectivity of Spatial Databases
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
A Representation Independent Language for Planar Spatial Databases with Euclidean Distance
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Quantifier rank for parity of embedded finite models
Theoretical Computer Science - Mathematical foundations of computer science
In Memoriam: Paris C. Kanellakis
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences - Special issue on PODS 2000
Variable Independence in Constraint Databases
IEEE Transactions on Knowledge and Data Engineering
Conditions for the completeness of functional and algebraic equational reasoning
Mathematical Structures in Computer Science
An expressive language for linear spatial database queries
Journal of Computer and System Sciences
A characterization of first-order topological properties of planar spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
Journal of Computer and System Sciences
A characterization of first-order topological properties of planar spatial data
Journal of the ACM (JACM)
Uniform generation in spatial constraint databases and applications
Journal of Computer and System Sciences
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Information and Computation
A representation independent language for planar spatial databases with Euclidean distance
Journal of Computer and System Sciences
Expressive power of query languages for constraint complex value databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
The expressivity of constraint query languages with boolean algebra linear cardinality constraints
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Hi-index | 0.00 |
The expressive power of first-order query languages with several classes of equality and inequality constraints is studied in this paper. We settle the conjecture that recursive queries such as parity test and transitive closure cannot be expressed in the relational calculus augmented with polynomial inequality constraints over the reals. Furthermore, noting that relational queries exhibit several forms of genericity, we establish a number of collapse results of the following form: The class of generic Boolean queries expressible in the relational calculus augmented with a given class of constraints coincides with the class of queries expressible in the relational calculus (with or without an order relation). We prove such results for both the natural and active-domain semantics. As a consequence, the relational calculus augmented with polynomial inequalities expresses the same classes of generic Boolean queries under both the natural and active-domain semantics.In the course of proving these results for the active-domin semantics, we establish Ramsey-type theorems saying that any query involving certain kinds of constraints coincides with a constraint-free query on databases whose elements come from a certain infinite subset of the domain. To prove the collapse results for the natural semantics, we make use of techniques from nonstandard analysis and from the model theory of ordered structures.