Development Cycles
  Home arrow Development Cycles arrow Page 10 - Entity Relationship Modeling
Dev Articles Forums 
ADO.NET  
Apache  
ASP  
ASP.NET  
C#  
C++  
ColdFusion  
COM/COM+  
Delphi-Kylix  
Design Usability  
Development Cycles  
DHTML  
Embedded Tools  
Flash  
Graphic Design  
HTML  
IIS  
Interviews  
Java  
JavaScript  
MySQL  
Oracle  
Photoshop  
PHP  
Reviews  
Ruby-on-Rails  
SQL  
SQL Server  
Style Sheets  
VB.Net  
Visual Basic  
Web Authoring  
Web Services  
Web Standards  
XML  
Mobile Linux 
App Generation ROI 
IBM® developerWorks 
Sun Developer Network 
Weekly Newsletter
 
Developer Updates  
Free Website Content 
 RSS  Articles
 RSS  Forums
 RSS  All Feeds
Write For Us Get Paid 
Request Media Kit
Contact Us 
Site Map 
Privacy Policy 
Support 
 USERNAME
 
 PASSWORD
 
 
  >>> SIGN UP!  
  Lost Password? 
DEVELOPMENT CYCLES

Entity Relationship Modeling
By: Alf A. Pedersen
  • Search For More Articles!
  • Disclaimer
  • Author Terms
  • Rating: 4 stars4 stars4 stars4 stars4 stars / 50
    2004-04-05

    Table of Contents:
  • Entity Relationship Modeling
  • The Entity
  • Other Business Contacts
  • Attributes in entities
  • Business Rules
  • Three types of relationships
  • Supplier Entity
  • A Weak Relation
  • A Useful Relation
  • Involuted (or recursive) relationships
  • Many-to-Many
  • The Database Analysis Team - A Teamwork
  • Level of Knowledge
  • Experience vs. Inexperience
  • Complete Model?
  • Building Queries
  • Other Common Errors in ER Modeling
  • Second Normal Violation
  • More Specific
  • Generic or Specific Models?
  • Analysts Experience

  • Rate this Article: Poor Best 
      ADD THIS ARTICLE TO:
      Del.ici.ous Digg
      Blink Simpy
      Google Spurl
      Y! MyWeb Furl
    Email Me Similar Content When Posted
    Add Developer Shed Article Feed To Your Site
    Email Article To Friend
    Print Version Of Article
    PDF Version Of Article
     
     
    ADVERTISEMENT


    Entity Relationship Modeling - Involuted (or recursive) relationships


    (Page 10 of 21 )


    Involuted, or recursive, relationships, are self-relationships; relationships from and to the same entity.  This is a special construction normally used to represent a hierarchical tree structure. This kind of relationship alone has just as many possibilities as the ones discussed above have together. However; most of the combinations just theoretically usable: For all practical reasons they are impossible since they relate back to themselves; you cannot relate to something that do not exist yet. Constraints will be broken in the database. We will therefore concentrate on the three forms of involuted relationships that may be of any use to you:

    One-to-one relationship, optional-optional

    one-to-one, optional-optional

    This may be a useful relationship. The relationship makes it possible for you, if you wish, to be married to one person (at the time). However, if you want historical data as to who you were married to earlier (as it happens too often today), you need more analysis.

    If you substitute PERSON with PRODUCT, this relationship may also be used for suggesting an alternative product, if the original is sold out, or is no longer manufactured.

    One-to-many, optional-optional

    one-to-many, optional-optional

    This is a classical hierarchy, or tree structure. Note however that any one person MAY work for ZERO OR ONE AND ONLY ONE manager, while a given person MAY be manager for zero or more persons.

    Many-to-many, optional-optional

    many-to-many, optional-optional

    This is a network structure. In a project-organized environment, any one person MAY have ZERO or more managers, while any person MAY be manager for ZERO OR MORE persons. This construction is also good for decomposition of products: If you swap PERSON with PRODUCT, we may read it as: A product MAY contain zero or more (sub)products, while a given (sub)product MAY be a part of zero or more products.

    More Development Cycles Articles
    More By Alf A. Pedersen


     

    DEVELOPMENT CYCLES ARTICLES

    - Branch and Bound Algorithm Technique
    - Dynamic Programming Algorithm Technique
    - Genetic Algorithm Techniques
    - Greedy Strategy as an Algorithm Technique
    - Divide and Conquer Algorithm Technique
    - The Backtracking Algorithm Technique
    - More Pattern Matching Algorithms: B-M
    - Pattern Matching Algorithms Demystified: KMP
    - Coding Standards
    - A Peek into the Future: Transactional Memory
    - Learning About the Graph Construct using Gam...
    - Learning About the Graph Construct using Gam...
    - Learning About the Graph Construct using Gam...
    - How to Strike a Match
    - Entity Relationship Modeling






    © 2003-2008 by Developer Shed. All rights reserved. DS Cluster 2 hosted by Hostway
    Stay green...Green IT