EContent 11 2025 02 09 08 40 30 DBMS UGCA1922 PPT2 DrAhmadpptx 2025 01 13 20 27 38
EContent 11 2025 02 09 08 40 30 DBMS UGCA1922 PPT2 DrAhmadpptx 2025 01 13 20 27 38
• The hierarchical database model organizes data into a tree-like structure, with
a single root, to which all the other data is linked.
• The hierarchy starts from the Root data, and expands like a tree, adding child nodes
to the parent nodes.
• In this model, a child node will only have a single parent node.
• This model efficiently describes many real-world relationships like the index of a
book, etc.
• IBM's Information Management System (IMS) is based on this model.
• Data is organized into a tree-like structure with a one-to-many relationship between
two different types of data, for example, one department can have many courses,
many teachers, and of course many students(like shown in the diagram below).
• Relational model makes the query much easier than in hierarchical or network
database systems.
• In 1970, E.F Codd has been developed it.
• A relational database is defined as a group of independent tables which are
linked to each other using some common fields of each related table.
• This model can be represented as a table with columns and rows. Each row is
known as a tuple. Each table of the column has a name or attribute. It is well
knows in database technology because it is usually used to represent real-world
objects and the relationships between them.
• Some popular relational databases are used nowadays like Oracle, Sybase, DB2,
MySQL Server etc.
Department of Computer Application 14
Relational Model in DBMS
• Cardinality: The total number of rows at a time in a relation is called the cardinality of that relation.
For example: In a student relation, the total number of tuples in this relation is3 so the cardinality
of a relation is 3. The cardinality of a relation changes with time as more and more tuples get added
or deleted.
• Degree: The degree of association is called the total number of attributes in a relationship. The
relation with one attribute is called unary relation, with two attributes is known a binary relation
and with three attributes is known as ternary relation.
For example: in the Student relation, the total number of attributes is 5, so the degree of the
relations is 5. The degree of a relation does not change with time as tuples get added or deleted.
• Relational instance: In the relational database system, the relational instance is represented by a
finite set of tuples. Relation instances do not have duplicate tuples.
• Relational schema: A relational schema contains the name of the relation and name of all columns
or attributes.
• Relational key: In the relational key, each row has one or more attributes. It can identify the row in
the relation uniquely
Department of Computer Application 19
Entity-relationship Model
• In this database model, relationships are created by dividing objects of interest into entities
and their characteristics into attributes.
• Different entities are related using relationships.
• ER Models are defined to represent the relationships in pictorial form to make it easier for
different stakeholders to understand.
• This model is good to design a database, which can then be turned into tables in a relational
model (explained below).
• Let's take an example, If we have to design a School Database, then the Student will be
an entity with attributes name, age, address, etc. As an Address is generally complex, it can
be another entity with attributes street, pincode, city, etc, and there will be a relationship
between them.
• Relationships can also be of different types. You can learn about ER Diagrams in detail if you
want to learn about entities and relationships.
Department of Computer Application 20
Entity-relationship Model
In this model, to store data It organizes records to one It organizes records in the form of
hierarchy method is used. It is another through links or table and relationship between
the oldest method and not in
pointers. tables are set using common fields.
use today.
To organize records, it uses It organizes records in the form It organizes records in the form of
tree structure. of directed graphs. tables.
In addition to 1:1 and 1:n it also In addition to 1:1 and 1:n it also
It implements 1:1 and 1:n
implements many to many implements many to many
relations.
relationships. relationships.
Pointers are used to establish A linked list is used to establish a The logical representation is used
relationships among records relationship among records with rows and columns to depict
physically. physically. relationship among records.
This model lacks data There is partial data independence This model provides data
independence. in thisDepartment
model.of Computer Applications independence. 24
Difference Between Hierarchical,
Network and Relational Data
Model
Hierarchical Data Model Network Data Model Relational Data Model
It is used to access the data which It is used to access the data which It is used to access the data which
is complex and asymmetric. is complex and symmetric. is complex and symmetric.
Books References
• Database System Concepts by Abraham Silberschatz, Henry Korth, and S. Sudarshan
(7th Edition)
E-book link
• https://www.geeksforgeeks.org/difference-between-hierarchical-network-and-
relational-data-model/
• https://www.studytonight.com/dbms/database-model.php
YouTube link
• https://youtu.be/6Iu45VZGQDk?si=jezs0C8I30dZwlyR
Web link
• https://www.geeksforgeeks.org/data-models-in-dbms/
Department of Computer Application 27
THANK YOU