Generating the fewest redundancy-free scheme trees from acyclic conceptual-model hypergraphs in polynomial time
Generating a minimal set of redundancy-free scheme trees for a conceptual-model hypergraph is NP-hard. An polynomial-time algorithmic solution exists, however, if the hypergraph is acyclic. The algorithm ensures that the generated forest of scheme trees is redundancy-free. It guarantees that the generated forest of scheme trees collectively covers the information in the given conceptual-model hypergraph. It is guaranteed to run in polynomial time.
acyclic conceptual-model hypergraphs conceptual-model-based scheme-tree generation data redundancy in scheme trees minimal scheme-tree forests