Showing papers by "Peter Honeyman published in 1981"
TL;DR: It is shown that functional dependency preservation can be tested in polynomial time and that while finding a cover for all embedded dependencies is NP-complete, such a cover can be found in poynomial time if dependencies are preserved.
Abstract: We show that functional dependency preservation can be tested in polynomial time. We show further that while finding a cover for all embedded dependencies is NP-complete, such a cover can be found in polynomial time if dependencies are preserved.
41 citations