The Open UniversitySkip to content
 

Detecting redundancy in conceptual models

Bowers, David S. (2003). Detecting redundancy in conceptual models. In: Not Set ed. Advanced Conceptual Modeling Techniques: ER 2002 Workshops, ECDM, MobIMod, IWCMQ, and eCOMO, Tampere, Finland, October 7-11, 2002, Revised Papers. Lecture Notes in Computer Science, 2784 (2784). Berlin/Heidelberg, Germany: Springer, pp. 275–287.

URL: http://www.springerlink.com/(zsgqplzu3cpa5fumt1rc5...
DOI (Digital Object Identifier) Link: http://dx.doi.org/10.1007/b12013
Google Scholar: Look up in Google Scholar

Abstract

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
ISBN: 3-540-20255-2, 978-3-540-20255-4
Extra Information: pp 35-47
Academic Unit/Department: Mathematics, Computing and Technology > Computing & Communications
Interdisciplinary Research Centre: Centre for Research in Computing (CRC)
Item ID: 4054
Depositing User: Michelle Bailey
Date Deposited: 11 Aug 2006
Last Modified: 02 Dec 2010 19:51
URI: http://oro.open.ac.uk/id/eprint/4054
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk