Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its projections without loss of information. Therefore, FHDs generalise multivalued dependencies (MVDs) in which case the number of these projections is precisely two. The implication of FHDs has been defined in the context of some fixed finite universe.
This paper identifies a sound and complete set of inference rules for the implication of FHDs. This ax-iomatisation is very reminiscent of that for MVDs. Then, an alternative notion of FHD implication is introduced in which the underlying set of attributes is left undetermined. The main result proposes a finite axiomatisation for FHD implication in undetermined universes. Moreover, the result clarifies the role of the complementation rule as a mere means of database normalisation. In fact, an axiomatisation for FHD implication in fixed universes is proposed which allows to infer any FHDs either without using the complementation rule at all or only in the very last step of the inference. This also characterises the expressiveness of an incomplete set of inference rules in fixed universes. The results extend previous work on MVDs by Biskup.
机译:概率推理:任务相依性和概率加权的个体差异通过分层贝叶斯建模揭示
机译:海地刘等人的依赖距离,分层结构和单词命中评论的分配距离,层次结构和单词命中评论。
机译:通过分层聚类提供了亲属和Sibship推断的高效推断
机译:关于完全层次依赖性的推论
机译:依赖网络中的快速推理算法。
机译:概率推论:分层贝叶斯模型揭示了任务相关性和概率加权的个体差异
机译:概率推论:分层贝叶斯模型揭示了任务相关性和概率加权的个体差异