Login / Signup
Generating the fewest redundancy-free scheme trees from acyclic conceptual-model hypergraphs in polynomial time.
Wai Yin Mok
Joseph Fong
David W. Embley
Published in:
Inf. Syst. (2014)
Keyphrases
</>
conceptual model
hypertree decomposition
data model
entity relationship
conceptual models
knowledge base
high level
data warehouse
decision trees
object oriented
bounded treewidth
domain ontology
np hard
np complete
query language
expert systems
conceptual database design
conceptual data model
semi automatic
architectural model
decomposition methods
enterprise architecture
databases
learning algorithm