A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the complexity of join dependencies
1986
ACM Transactions on Database Systems
In [IO] a method is proposed for decomposing join dependencies (jds) in a relational database using the notion of a hinge. This method was subsequently studied in [ll] and [El. We show how the technique of decompasiti"" can be used t" make integrity checking m"re efficient. It turns ""t that it is important t" find a decomposition that minimizes the "umber of edges of its largest element. We show that the decompositions obtained with the method described in (lo] are optimal in this respect.
doi:10.1145/5236.5237
fatcat:6kociyzrpjhuziagi4baselj4y