One to many or one to one relationship.
| Allowed the network mode to support many to many relationships.
| One to one, one to many, many to one relationship.
|
Retrieve algorithms are complex and asymmetric.
| Retrieve algorithms are complex and symmetric.
| Retrieve algorithms are simple and symmetric.
|
Based on parent child relationship.
| A record can have many parents as well as many children.
| Based on relational data structures.
|
Doesn’t provide an independent stand alone query interface.
| Conference on data system language.
| Relational databases are what bring many sources into a common query such as SQL.
|
Cannot insert the information of a child who does not have any parent.
| Does not suffer from any insertion anomaly.
| Doesn’t suffer from any insertion anomaly.
|
Multiple occurrences of child records which lead to problems of inconsistency during the update operation.
| Free from update anomalies.
| Free from update anomalies.
|
Deletion of parent results in deletion of child record.
| Free from delete anomalies.
| Free from delete anomalies.
|
This model lacks data independence.
| There is partial data independence.
| It provides data independence.
|
Less flexible.
| Flexible.
| Flexible.
|
Difficult to access data.
| Easier to access data.
| Easier to access data.
|
Arrange data in a tree-like structure.
| Organizes data in graph-like structure.
| Arrange data in tables.
|
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP