Classification and transformations of binary relationship relation schemata
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.
- Losslessness and semantic correctness of database schema transformation: Another look of schema equivalence
- scientific article; zbMATH DE number 949380
- A formalization of the Binary Object-Role Model based on logic
- A survey of database design transformations based on the Entity-Relationship model
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
This page was built for publication: Classification and transformations of binary relationship relation schemata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579966)