What is Data Structure Modeling?
Information Structure Modeling is tied in with characterizing the information needed to help Business Functions in an undertaking and the Data structure and algorithm structure of that information regarding its components and the interrelationship of these components.
What does this involve?
It implies distinguishing and characterizing, for each Function being dissected and displayed:
The information substances made or utilized by the Function.
The ascribes of these substances.
The connections that exist between these elements and different elements in the venture.
A few Definitions
Information Entity: Any thing, genuine or conceptual, of noteworthiness to the business about which data should be known and held.
Element Attributes: These name, depict, group, qualify or evaluate information substances.
Element Relationship: Every information substance in a venture is connected somehow or another to some other element in that undertaking (there are a few, however extremely, not many exemptions for this).
To characterize a relationship completely you need to determine the entirety of the accompanying components:
the name of the relationship
its flexibility
its degree
Name
Relationship names portray the relationship between elements. Connections should be named in the two ways since, similar to affiliations, they are consistently two way - they state how element An is identified with substance B and how element B is identified with element A.
Every relationship name should be in a structure that can be gone before by the term 'should' or 'might be' - the flexibility of the relationship - and still bode well.
Flexibility
Connections should be characterized as being either obligatory or discretionary. Must the relationship consistently be made? Each time you make an event of one element must you generally connect it with an event of the other element? On the off chance that the appropriate response is 'yes' at that point the relationship is compulsory, else it is discretionary.
Degree
Degree (at times called Cardinality) is the term utilized when characterizing the quantity of events of one element related with every event of another substance. The 'number' doesn't allude to a particular number yet is restricted to addressing the inquiry: "Is every event of the main substance connected to 'one and only one' event of the subsequent element or to 'one or more>' events of that element?"
Perhaps the best methods of displaying information structure is the Entity Relationship Diagram as it unmistakably the entirety of the Entities in question and their interrelationship to one another.
For More Details, Visit Us:
Data structure and algorithm in java
system design interview questions