Name
Abstract | ||
|---|---|---|
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 k -ary axiomatization, i.e., no axiomatization in which every rule is k -ary for some fixed k , can fully describe the interaction between FDs and SIDs. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0166-218X(92)90029-A | Discrete Applied Mathematics |
Keywords | Field | DocType |
attribute value,relational databases,selective inheritance,relational database | Discrete mathematics,NP-complete,Relational database,Tuple,Functional dependency,Membership problem,Mathematics | Journal |
Volume | Issue | ISSN |
40 | 2 | Discrete Applied Mathematics |
Citations | PageRank | References |
1 | 0.36 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Georg Gottlob | 1 | 9594 | 1103.48 |
| M. Schrefl | 2 | 25 | 29.25 |
| M. Stumptner | 3 | 61 | 30.30 |