Abstract | ||
---|---|---|
We study inference systems for the combined class of functional and full hierarchical dependencies in relational databases. Two notions of implication are considered: the original version in which the underlying set of attributes is fixed, and the alternative notion in which this set is left undetermined. The first main result establishes a finite axiomatisation in fixed universes which clarifies the role of the complementation rule in the combined setting. In fact, we identify inference systems that are appropriate in the following sense: full hierarchical dependencies can be inferred without use of the complementation rule at all or with a single application of the complementation rule at the final step of the inference; and functional dependencies can be inferred without any application of the complementation rule. The second main result establishes a finite axiomatisation for functional and full hierarchical dependencies in undetermined universes. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1007/978-3-540-77684-0_7 | FoIKS |
Keywords | Field | DocType |
main result,full hierarchical dependency,complementation rule,fixed universe,functional dependency,combined setting,inference system,combined class,finite axiomatisation,appropriate reasoning,data dependency,single application,undetermined universe,relational database | Data mining,Data dependency,Relational database,Inference,Computer science,Theoretical computer science,Functional dependency,Universe,Rule of inference,Dependency theory (database theory),Inference system | Conference |
Volume | ISSN | ISBN |
4932 | 0302-9743 | 3-540-77683-4 |
Citations | PageRank | References |
5 | 0.39 | 35 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Joachim Biskup | 1 | 1389 | 492.62 |
Sebastian Link | 2 | 307 | 19.17 |