Please use this identifier to cite or link to this item:
Title: Constraint databases, queries, and query languages
Authors: VAN DEN BUSSCHE, Jan 
Issue Date: 2000
Publisher: Springer
Source: Kuper, G. & Libkin, L. & Paredaens, J. (Ed.) Constraint Databases, p. 21-47.
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 o-minimal structure turns out to be a useful abstraction to discuss these issues in some generality. We will see that equivalence of relational calculus queries on constraint databases is typically undecidable, but that it is decidable in the special case of conjunctive queries on constraint databases.
Document URI:
Category: B3
Type: Book Section
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
cdb.pdfClose-to-final version of the first chapter of Constraint Databases335.37 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on May 26, 2022


checked on May 26, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.