Jump to content

Data-flow diagram: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Citation bot (talk | contribs)
Bots
5,290,576 edits
Alter: title, template type. Add: chapter. Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox3 | #UCB_webform_linked 411/1947
Bert.Roos (talk | contribs)
127 edits
 
(8 intermediate revisions by 5 users not shown)
Line 12: Line 12:


==History==
==History==
The DFD notation draws on graph theory, originally used in operational research to model workflow in organizations. DFD originated from the [[activity diagram]] used in the [[structured analysis and design technique]] methodology at the end of the 1970s. DFD popularizers include Edward Yourdon, Larry Constantine, Tom DeMarco, Chris Gane and Trish Sarson.<ref name=":1">{{Cite book|last=Yourdon|first=Edward|title=Proceedings of the May 19-22, 1975, national computer conference and exposition on - AFIPS '75 |chapter=Structured programming and structured design as art forms |date=1975|pages=277|doi=10.1145/1499949.1499997|s2cid=36802486|doi-access=free}}</ref>
The DFD notation draws on [[graph theory]], originally used in operational research to model workflow in organizations, and in computer science to model the flow of inputs and outputs across computations.<ref>{{Cite journal |last1=Martin |first1=David |last2=Estrin |first2=Gerald |date=1967-04-01 |title=Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations |url=https://dl.acm.org/doi/10.1145/321386.321391 |journal=Journal of the ACM |volume=14 |issue=2 |pages=281–299 |doi=10.1145/321386.321391 |issn=0004-5411}}</ref><ref name=":2" /> DFD originated from the [[structured analysis and design technique]] methodology in the middle of the 1970s.<ref name=":2">{{Cite book |last1=Yourdon |first1=Edward |title=Structured Design |last2=Constantine |first2=Larry L. |date=1975 |publisher=Yourdon Inc. |location=New York |pages=54–55 |oclc=1036882595}}</ref> It was first proposed by Larry Constantine,<ref>{{Cite book |last=Bergland |first=G. D. |chapter=Structured Design Methodologies |date=1978-06-19 |title=15th Design Automation Conference |chapter-url=https://dl.acm.org/doi/10.5555/800095.803131 |location=Las Vegas, Nevada, USA |publisher=IEEE Press |pages=475–493 |doi=10.1109/DAC.1978.1585214 }}</ref> and popularized by [[Edward Yourdon]], Tom DeMarco,<ref name=":3">{{Cite book |last=DeMarco |first=Tom |title=Structured analysis and system specification |date=1979 |publisher=Prentice-Hall |isbn=978-0-13-854380-8 |series=Prentice-Hall software series |location=Englewood Cliffs, N.J}}</ref> Chris Gane and Trish Sarson,<ref name=":4">{{Cite book |last1=Gane |first1=Chris |title=Structured systems analysis: tools and techniques |last2=Sarson |first2=Trish |date=1979 |publisher=Prentice-Hall |isbn=978-0-13-854547-5 |series=Prentice-Hall software series |location=Englewood Cliffs, N.J}}</ref><ref name=":1">{{Cite book|last=Yourdon|first=Edward|title=Proceedings of the May 19-22, 1975, national computer conference and exposition on - AFIPS '75 |chapter=Structured programming and structured design as art forms |date=1975|pages=277|doi=10.1145/1499949.1499997|s2cid=36802486|doi-access=free}}</ref> who enriched the diagramming technique with different notations, data dictionary practices<ref name=":3" /> and guidance for the hierarchical decomposition of processes.<ref name=":4" />


Data-flow diagrams (DFD) quickly became a popular way to visualize the major steps and data involved in software-system processes. DFDs were usually used to show data flow in a computer system, although they could in theory be applied to [[business process modeling]]. DFDs were useful to document the major data flows or to explore a new high-level design in terms of data flow.<ref>{{Cite book|title=Applying UML and patterns : an introduction to object-oriented analysis and design and iterative development|first=Craig|last=Larman|date=2012|publisher=Pearson|isbn=978-8177589795|edition= 3rd|location=New Delhi|oclc=816555477}}</ref>
The primary aim of data-flow diagrams in the context of structured design was to build complex modular systems, rationalizing the interdependencies across different modules.<ref name=":2" /> Data-flow diagrams (DFD) quickly became a popular way to visualize the major steps and data involved in software-system processes. DFDs were usually used to show data flow in a computer system, although they could in theory as well be applied to [[business process modeling]].<ref>{{Cite journal |last1=Tangkawarow |first1=I R H T |last2=Waworuntu |first2=J |date=April 2016 |title=A Comparative of business process modelling techniques |journal=IOP Conference Series: Materials Science and Engineering |volume=128 |issue=1 |pages=012010 |doi=10.1088/1757-899X/128/1/012010 |issn=1757-8981|doi-access=free |bibcode=2016MS&E..128a2010T }}</ref> DFDs were useful to document the major data flows or to explore a new high-level design in terms of data flow.<ref>{{Cite book|title=Applying UML and patterns : an introduction to object-oriented analysis and design and iterative development|first=Craig|last=Larman|date=2012|publisher=Pearson|isbn=978-8177589795|edition= 3rd|location=New Delhi|oclc=816555477}}</ref>


== DFD components ==
== DFD components ==

Latest revision as of 09:59, 9 October 2024

Data flow diagram with data storage, data flows, function and interface
Data flow diagram with data storage, data flows, function and interface

A data-flow diagram is a way of representing a flow of data through a process or a system (usually an information system). The DFD also provides information about the outputs and inputs of each entity and the process itself. A data-flow diagram has no control flow — there are no decision rules and no loops. Specific operations based on the data can be represented by a flowchart.[1]

There are several notations for displaying data-flow diagrams. The notation presented above was described in 1979 by Tom DeMarco as part of structured analysis.

For each data flow, at least one of the endpoints (source and / or destination) must exist in a process. The refined representation of a process can be done in another data-flow diagram, which subdivides this process into sub-processes.

The data-flow diagram is a tool that is part of structured analysis and data modeling. When using UML, the activity diagram typically takes over the role of the data-flow diagram. A special form of data-flow plan is a site-oriented data-flow plan.

Data-flow diagrams can be regarded as inverted Petri nets, because places in such networks correspond to the semantics of data memories. Analogously, the semantics of transitions from Petri nets and data flows and functions from data-flow diagrams should be considered equivalent.

History

[edit]

The DFD notation draws on graph theory, originally used in operational research to model workflow in organizations, and in computer science to model the flow of inputs and outputs across computations.[2][3] DFD originated from the structured analysis and design technique methodology in the middle of the 1970s.[3] It was first proposed by Larry Constantine,[4] and popularized by Edward Yourdon, Tom DeMarco,[5] Chris Gane and Trish Sarson,[6][7] who enriched the diagramming technique with different notations, data dictionary practices[5] and guidance for the hierarchical decomposition of processes.[6]

The primary aim of data-flow diagrams in the context of structured design was to build complex modular systems, rationalizing the interdependencies across different modules.[3] Data-flow diagrams (DFD) quickly became a popular way to visualize the major steps and data involved in software-system processes. DFDs were usually used to show data flow in a computer system, although they could in theory as well be applied to business process modeling.[8] DFDs were useful to document the major data flows or to explore a new high-level design in terms of data flow.[9]

DFD components

[edit]
Data flow diagram - Yourdon/DeMarco notation
Data flow diagram - Yourdon/DeMarco notation

DFD consists of processes, flows, warehouses, and terminators. There are several ways to view these DFD components.[10]

Process

The process (function, transformation) is part of a system that transforms inputs to outputs. The symbol of a process is a circle, an oval, a rectangle or a rectangle with rounded corners (according to the type of notation). The process is named in one word, a short sentence, or a phrase that is clearly to express its essence.[7]

Data flow

Data flow (flow, dataflow) shows the transfer of information (sometimes also material) from one part of the system to another. The symbol of the flow is the arrow. The flow should have a name that determines what information (or what material) is being moved. Exceptions are flows where it is clear what information is transferred through the entities that are linked to these flows. Material shifts are modeled in systems that are not merely informative. Flow should only transmit one type of information (material). The arrow shows the flow direction (it can also be bi-directional if the information to/from the entity is logically dependent—e.g. question and answer). Flows link processes, warehouses and terminators.[7]

Warehouse

The warehouse (datastore, data store, file, database) is used to store data for later use. The symbol of the store is two horizontal lines, the other way of view is shown in the DFD Notation. The name of the warehouse is a plural noun (e.g. orders)—it derives from the input and output streams of the warehouse. The warehouse does not have to be just a data file but can also be, for example, a folder with documents, a filing cabinet, or a set of optical discs. Therefore, viewing the warehouse in a DFD is independent of implementation. The flow from the warehouse usually represents reading of the data stored in the warehouse, and the flow to the warehouse usually expresses data entry or updating (sometimes also deleting data). The warehouse is represented by two parallel lines between which the memory name is located (it can be modeled as a UML buffer node).[7]

Terminator

The terminator is an external entity that communicates with the system and stands outside of the system. It can be, for example, various organizations (e.g. a bank), groups of people (e.g. customers), authorities (e.g. a tax office) or a department (e.g. a human-resources department) of the same organization, which does not belong to the model system. The terminator may be another system with which the modeled system communicates.[7]

Rules for creating DFD

[edit]

Entity names should be comprehensible without further comments. DFD is a system created by analysts based on interviews with system users. It is determined for system developers, on one hand, project contractor on the other, so the entity names should be adapted for model domain or amateur users or professionals. Entity names should be general (independent, e.g. specific individuals carrying out the activity), but should clearly specify the entity. Processes should be numbered for easier mapping and referral to specific processes. The numbering is random, however, it is necessary to maintain consistency across all DFD levels (see DFD Hierarchy). DFD should be clear, as the maximum number of processes in one DFD is recommended to be from 6 to 9, minimum is 3 processes in one DFD.[1][7] The exception is the so-called contextual diagram where the only process symbolizes the model system and all terminators with which the system communicates.

DFD consistency

[edit]

DFD must be consistent with other models of the system—entity relationship diagram, state-transition diagram, data dictionary, and process specification models. Each process must have its name, inputs and outputs. Each flow should have its name (exception see Flow). Each Data store must have input and output flow. Input and output flows do not have to be displayed in one DFD—but they must exist in another DFD describing the same system. An exception is warehouse standing outside the system (external storage) with which the system communicates.[7]

DFD hierarchy

[edit]

To make the DFD more transparent (i.e. not too many processes), multi-level DFDs can be created. DFDs that are at a higher level are less detailed (aggregate more detailed DFD at lower levels). The contextual DFD is the highest in the hierarchy (see DFD Creation Rules). The so-called zero level is followed by DFD 0, starting with process numbering (e.g. process 1, process 2). In the next, the so-called first level—DFD 1—the numbering continues For example, process 1 is divided into the first three levels of the DFD, which are numbered 1.1, 1.2, and 1.3. Similarly, processes in the second level (DFD 2) are numbered 2.1.1, 2.1.2, 2.1.3, and 2.1.4. The number of levels depends on the size of the model system. DFD 0 processes may not have the same number of decomposition levels. DFD 0 contains the most important (aggregated) system functions. The lowest level should include processes that make it possible to create a process specification for roughly one A4 page. If the mini-specification should be longer, it is appropriate to create an additional level for the process where it will be decomposed into multiple processes. For a clear overview of the entire DFD hierarchy, a vertical (cross-sectional) diagram can be created. The warehouse is displayed at the highest level where it is first used and at every lower level as well.[7]

See also

[edit]

References

[edit]
  1. ^ a b Bruza, P. D.; van der Weide, Th. P. (1990-11-01). "Assessing the quality of hypertext views". ACM SIGIR Forum. 24 (3): 6–25. doi:10.1145/101306.101307. ISSN 0163-5840. S2CID 8507530.
  2. ^ Martin, David; Estrin, Gerald (1967-04-01). "Models of Computations and Systems—Evaluation of Vertex Probabilities in Graph Models of Computations". Journal of the ACM. 14 (2): 281–299. doi:10.1145/321386.321391. ISSN 0004-5411.
  3. ^ a b c Yourdon, Edward; Constantine, Larry L. (1975). Structured Design. New York: Yourdon Inc. pp. 54–55. OCLC 1036882595.
  4. ^ Bergland, G. D. (1978-06-19). "Structured Design Methodologies". 15th Design Automation Conference. Las Vegas, Nevada, USA: IEEE Press. pp. 475–493. doi:10.1109/DAC.1978.1585214.
  5. ^ a b DeMarco, Tom (1979). Structured analysis and system specification. Prentice-Hall software series. Englewood Cliffs, N.J: Prentice-Hall. ISBN 978-0-13-854380-8.
  6. ^ a b Gane, Chris; Sarson, Trish (1979). Structured systems analysis: tools and techniques. Prentice-Hall software series. Englewood Cliffs, N.J: Prentice-Hall. ISBN 978-0-13-854547-5.
  7. ^ a b c d e f g h Yourdon, Edward (1975). "Structured programming and structured design as art forms". Proceedings of the May 19-22, 1975, national computer conference and exposition on - AFIPS '75. p. 277. doi:10.1145/1499949.1499997. S2CID 36802486.
  8. ^ Tangkawarow, I R H T; Waworuntu, J (April 2016). "A Comparative of business process modelling techniques". IOP Conference Series: Materials Science and Engineering. 128 (1): 012010. Bibcode:2016MS&E..128a2010T. doi:10.1088/1757-899X/128/1/012010. ISSN 1757-8981.
  9. ^ Larman, Craig (2012). Applying UML and patterns : an introduction to object-oriented analysis and design and iterative development (3rd ed.). New Delhi: Pearson. ISBN 978-8177589795. OCLC 816555477.
  10. ^ Řepa, Václav (1999). Analýza a návrh informačních systémů (Vyd. 1 ed.). Praha: Ekopress. ISBN 978-8086119137. OCLC 43612982.

Bibliography

[edit]
[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Data-flow_diagram&oldid=1250255209"