Bowers, David S.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1007/b12013|
|Google Scholar:||Look up in Google Scholar|
One measure of the quality of a conceptual model is the quality of design that can be derived from it. Redundant relationships in an Entity Relationship model cause a generated relational schema to be un-normalised. Since a relationship is redundant only if some other path in the model implies both its set theoretic signature and its semantics, determination of redundancy is not mechanical, and always requires interaction with the client or user. A path composition and search algorithm is presented to detect potentially redundant relationships, and strategies are discussed for the incorporation of this type of algorithm in a CASE environment.
|Item Type:||Book Chapter|
|Extra Information:||pp 35-47|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Michelle Bailey|
|Date Deposited:||11 Aug 2006|
|Last Modified:||04 Oct 2016 09:51|
|Share this page:|