A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf
.
On the decidability of query containment under constraints
1998
Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98
Query containment under constraints is the problem of checking whether for every database satisfying a given set of constraints, the result of one query is a subset of the result of another query. Recent research points out that this is a central problem in several database applications, and we address it within a setting where constraints are speci ed in the form of special inclusion dependencies over complex expressions, built by using intersection and di erence of relations, special forms of
doi:10.1145/275487.275504
dblp:conf/pods/CalvaneseGL98
fatcat:gii3q6zdtfheplwoo35zd5xot4