Classification and transformations of binary relationship relation schemata (Q579966)

Relationship relations are formally described by means of rules (constraints) holding on relation schemata. Binary relationship relations are studied considering them as directed graphs as well. Four basic properties of (rules holding on) binary relationship relations - which classify these relations - are transposed in digraph terms. Then, four graph transformations are defined in order to devise a tool for lossless schema transformations (namely, binary relationship relation schemata translations). Thus, one can bridge the gap between different data models. Furthermore, physical representations of binary relationship relations can be dealt with using the same approach.