Abstract
In this paper we investigate which constraints may be derived from a given set of constraints. We show that, given a set of relations \(\mathcal{R}\), all of which are invariant under some set of permutations P, it is possible to derive any other relation which is invariant under P, using only the projection, Cartesian product, and selection operators, together with the effective domain of \(\mathcal{R}\), provided that the effective domain contains at least three elements. Furthermore, we show that the condition imposed on the effective domain cannot be removed. This result sharpens an earlier result of Paredaens [13], in that the union operator turns out to be superfluous. In the context of constraint satisfaction problems, this result shows that a constraint may be derived from a given set of constraints containing the binary disequality constraint if and only if it is closed under the same permutations as the given set of constraints.KeywordsRelational databaserelational algebraconstraint derivation
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.
