Generating the fewest redundancy-free scheme trees from acyclic conceptual-model hypergraphs in polynomial time

被引：3

作者：

Mok, Wai Yin ^{[1
]}

Fong, Joseph ^{[2
]}

Embley, David W. ^{[3
]}

机构：

[1] Univ Alabama, Dept Econ & Informat Syst, Huntsville, AL 35899 USA

[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China

[3] Brigham Young Univ, Dept Comp Sci, Provo, UT 84602 USA

来源：

INFORMATION SYSTEMS | 2014年 / 41卷

基金：

美国国家科学基金会;

关键词：

Conceptual-model-based scheme-tree generation; Data redundancy in scheme trees; Minimal scheme-tree forests; Acyclic conceptual-model hypergraphs; NORMAL-FORM;

D O I：

10.1016/j.is.2013.10.009

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Generating the fewest redundancy-free scheme trees from conceptual-model hypergraphs is NP-hard [17]. We show, however, that the problem has a polynomial-time solution if the conceptual-model hypergraph is acyclic. We define conceptual-model hypergraphs, cycles, and scheme trees, and then present a polynomial-time algorithm and show that it generates the fewest redundancy-free scheme trees. As a practical application for the algorithm, we comment on its use for the design of "good" XML schemas for data storage. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：20 / 44

页数：25