Data structure diagram

From Wikipedia, the free encyclopedia

A data structure diagram (DSD) is a data model or diagram used to describe conceptual data models by providing graphical notations which document entities and their relationships, and the constraints that binds them. The basic graphic elements of DSDs are boxes, representing entities, and arrows, representing relationships. Data structure diagrams are most useful for documenting complex data entities.

Data structure diagrams are an extension of the entity-relationship model (E-R model). In DSDs, attributes are specified inside the entity boxes rather than outside of them, while relationships are drawn as boxes composed of attributes which specify the constraints that bind entities together. The E-R model, while robust, doesn't provide a way to specify the constraints between relationships, and becomes visually cumbersome when representing entities with several attributes. DSDs differ from the E-R model in that the E-R model focuses on the relationships between different entities, whereas DSDs focus on the relationships of the elements within an entity and enable users to fully see the links and relationships between each entity.

There are several styles for representing data structure diagrams, with the notable difference in the manner of defining cardinality. The choices are between arrow heads, inverted arrow heads (crow's feet), or numerical representation of the cardinality.

[edit] References

• DeMarco, Tom. Structured Analysis and System Specification. ISBN 0-13-854380-1. Prentice Hall. May 11, 1979.
• Yourdon, Edward. Modern Structured Analysis. ISBN 0-13-598624-9. Prentice Hall. August 1, 1988.
• ConceptDraw- tool for creating Data Structure Diagram, Data flow diagram, UML, Entity-relationship diagram and other diagrams.