Konrad Engel, Sven Hartmann
Constructing Realizers of Semantic Entity Relationship Schemes
Preprint series: Preprints aus dem Fachbereich Mathematik, Universität Rostock
68R10 Graph theory, See also {05Cxx, 90B10, 90B35, 90C35}
68P15 Database theory
Abstract: We use the Ford-Bellman algorithm to construct feasible class
cardinality function for a given semantic entity relationship scheme
(SER scheme). Further we show that these functions form a distributive
lattice under a natural ordering. Finally we present an algorithm to
construct the minimum element of this lattice wich can be interpretet
as the class cardinality function of a realizer of minimum size for the
given SER scheme.
Keywords: Entity Relationship Model, Cardinality Ratio Constraints