Difference between Network and Relational data model
1. Network Data Model:
It is advance version of hierarchical data model. To organize data it uses directed graphs instead of tree-structure. In this child can have more than one parent. It uses concept of two data structures i.e., Records and Sets.
In the above figure, Project is root node which has two children i.e. Project 1 and Project 2. Project 1 has 3 children and Project 2 has 2 children. Total there are 5 children i.e Department A, Department B and Department C, they are network related children as we said that this model can have more than one parent. So, for Department B and Department C have two parents i.e. Project 1 and Project 2.
2. Relational Data Model:
The relational data model was developed by E.F. Codd in 1970. There are no physical links as they are in hierarchical data model. Following are properties of relational data model :
- Data is represented in form of table only.
- It deals only with data not with physical structure.
- It provides information regarding metadata.
- At the intersection of row and column there will be only one value for tuple.
- It provides a way to handle queries with ease.
Difference between Network and Relational Data Model :
||Network Data Model
||Relational Data Model
||It organizes records to one another through links or pointers.
||It organizes records in form of table and relationship between tables are set using common fields.
||It organizes records in form of directed graphs.
||It organizes records in form of tables.
||In this relationship between various records is represented physically via linked list.
||In this relationship between various records is represented logically via tables.
||There is lack of declarative querying facilities.
||It provides declarative query facility using SQL.
||Complexity increases burden on programmer for database design as well as data manipulation.
||As physical level details are hidden from end users so this model is very simple to understand.
||Retrieval algorithms are complex but symmetric.
||Retrieval algorithms are simple and symmetric.
||There is partial data independence in this model.
||This model provides data independence.
||There is no inconsistency problem in updating the records because of the single instance of the child records.
||The updating of records is quite easy because of the normalization which is used to remove the redundancy in the relations.
||Searching for a record is easy in the network model as there are multiple access paths to reach data item.
||In the relational model, a unique, indexed key serves the purpose of searching a record.
||Here, is the physical existence of record relations in this model.
||It maintains logical organization of records using rows and columns and stored in relation.
||VAX-DBMS, DMS-1100 of UNIVAC and SUPRADBMS’s use this model.
||It is mostly used in real world applications. Oracle, SQL.
Unlock the Power of Placement Preparation!
Feeling lost in OS, DBMS, CN, SQL, and DSA chaos? Our Complete Interview Preparation
Course is the ultimate guide to conquer placements. Trusted by over 100,000+ geeks, this course is your roadmap to interview triumph.
Ready to dive in? Explore our Free Demo Content and join our Complete Interview Preparation