Abstract
We formally define the constraint database model, the concept of query in this model, and the basic constraint query languages provided by the relational calculus, the relational algebra, and Datalog. We show how a computationally complete constraint query language can be obtained by augmenting the constraint relational calculus with basic programming language features. We look into some basic model-theoretic issues concerning the constraint relational calculus, in particular the equivalence problem. The notion of an o-minimal structure turns out to be a useful abstraction to discuss these issues in some generality. We shall see that equivalence of relational calculus queries on constraint databases is typically undecidable, but that that equivalence is decidable in the special case of conjunctive queries on constraint databases.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
