Evaluation of Complex Cardinality Constraints

In a previous paper, the valence concept, a general method to describe relationships, has been introduced along with a set-theoretic formal semantics. This approach is type-based, admits variants and detailed cardinality specifications, and can cope with incomplete intermediate states. Nevertheless, the resulting syntax is easy to understand. In this paper, an implementation of the valence concept is outlined. Special emphasis has been placed on minimizing space and time overhead on instant level, but it turns out that data dictionary overhead also keeps within reasonable limits. Please note that the valence concept is not a complete data model by itself, but a relationship model which can be embedded in a wide range of data models. (IGD