Article ID: | iaor19931247 |
Country: | Netherlands |
Volume: | 40 |
Issue: | 2 |
Start Page Number: | 187 |
End Page Number: | 216 |
Publication Date: | Dec 1992 |
Journal: | Discrete Applied Mathematics |
Authors: | Gottlob G., Schrefl M., Stumptner M. |
Keywords: | combinatorial analysis |
Selective inheritance dependencies, or SIDs, are introduced to capture formally the inheritance of attribute values between tuples of any relation over a given relation scheme. It is shown that the membership problem, i.e., the question whether a SID is implied by a set of other SIDs, is NP-complete. Furthermore, a complete axiomatization for the implication problem of SIDs is given. Then, SIDs and functional dependencies (FDs) are studied together, SIDs and FDs together imply no other FDs than those already implied by the FDs alone. Although simple axiomatizations exist for FDs and SIDs separately, no