返回
Constructing the Bayesian network structure from dependencies implied in multiple relational schemas
DOI:10.1016/j.eswa.2010.12.053.png)
摘要
En 中文
Relational models are the most common representation of structured data, and acyclic database theory is important in relational databases. In this paper, we propose the method for constructing the Bayesian network structure from dependencies implied in multiple relational schemas. Based on the acyclic database theory and its relationships with probabilistic networks, we are to construct the Bayesian network structure starting from implied independence information instead of mining database instances. We first give the method to find the maximum harmoniousness subset for the multi-valued dependencies on an acyclic schema, and thus the most information of conditional independencies can be retained. Further, aiming at multi-relational environments, we discuss the properties of join graphs of multiple 3NF database schemas, and thus the dependencies between separate relational schemas can be obtained. In addition, on the given cyclic join dependency, the transformation from cyclic to acyclic database schemas is proposed by virtue of finding a minimal acyclic augmentation. An applied example shows that our proposed methods are feasible. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Relational data model
Bayesian network
Acyclic database schema
Harmoniousness multi-valued dependency set
Join dependency
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Variation in photoinhibition among Sasa senanensis, Quercus mongolica, and Acer mono in the understory of a deciduous broad-leaved forest exposed to canopy gaps caused by typhoons
Trees
IF0
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性

