The document discusses the relational database model, including its origins, key concepts like relations and attributes, relationship types between tables, typical examples, advantages like eliminating redundancy, and applications in various fields like commerce, education, and health.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
59 views4 pages
Relational Database Model
The document discusses the relational database model, including its origins, key concepts like relations and attributes, relationship types between tables, typical examples, advantages like eliminating redundancy, and applications in various fields like commerce, education, and health.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4
RELATIONAL DATABASE MODEL (RDBM)
1. Introduction to Relational Database Model
-Concept of/ Basis for Relational Database Model 2. Definition of Some Terms 3. Properties of RDB 4. Relationships between Tables 5. Typical Example of Relational Database 6. Advantages/Benefits of Relational Database 7. Challenges of Relational Database Model: 8. Areas of Application INTRODUCTION Before the discovery of Relational Database Model (RDBM), the earlier file system (File-Base System) had no theoretical foundation, data redundancy as data were stored in multiple locations resulting in inconsistency and error, there was no data standardization in place, poor data security and inability to share data among applications etc. In order to change the narratives, an English Scientist and Mathematician called Edgar Frank “Ted” Codd (Ted Codd) around 1970 discovered the Relational Database Model using the mathematical relations based on Set Theory. Example: A Relation is a set of ordered pairs that satisfies a relation or relationship. Let A and B be 2 sets. A= {1,2,3}, B= {0,1,2,} A B 1 0 2 1 3 2 1 0 2 1 AXB 3 2 0 1 2 B
1 (1,0) (1,1) (1,2)
2 (2,0) (2,1) (2,2) (3,0) (3,1) (3,2) Cartesian Product AXB 3 A Fig. 1 DEFINITION OF SOME TERMS Student
NAME DEPT COURSE SCORE
OLA EGBON COMPUTER DATABASE 77 SCI ABDUL EDU TECH EDU MGT 82 GLORY PENNY DOL AGRIC EXTENSION 91 Fig. 2 a. Relational Database organizes data in form of tables (relations) or represents data as a collection of tables. Like a family tree which depicts our family lineage/relationships b. Relation Name is the Table Name (above is Student) c. Tuple is called Row. d. Cardinality is the total number of Tuples (Rows) in a Relation (E.g 3, from Fig. 2) e. Attributes are the Fields or Column names. f. Arity or Degree of Relation is the total number of Attributes in a Relation (E.g 4 from Fig.2) g. Primary Key: It is the unique identifier in a relation (Especially in 1 st Relation) h. Foreign Key: Uniquely links data in one table to the data in another table (Especially in 2nd Relation) PROPERTIES OF RELATIONS 1. It has name (Each table has unique name or distinct name) 2. Each cell of the relation contains exactly one value 3. Each attribute has distinct names 4. Each tuple (row) is distinct: There are no duplicate tuples 5. The order of attributes has no significant 6. The order of tuples has no significant RELATIONSHIPS BETWEEN TABLES 1. One-to-One Relationship: One entity in a table is related to just one entity in another table. E.g Each student has only one address and each address represents one student
2. One-to-Many Relationships: One entity in a table is related to one or many entities in
another table. E.g Each Customer has one or more Orders.
3. Many-to-Many Relationships: This means Multiple entities in a table can be
associated/related with more than one entity in another table. For instance, each student can attend/offer many courses and each course can consist or be offered by many students.
3 AREAS COVERED BY RELATIONAL MODEL
1. Data Structure: It’s a format/appropriate way for organizing, processing, retrieving and storing data 2. Data Integrity: It ensures the accuracy, completeness, consistency and validity of data 3. Data Manipulation: Process of organizing or changing data for easier understanding, readable and useful. TYPICAL EXAMPLE OF RELATIONAL DATABASE STUDENT TABLE
STUD_ID NAME AGE
0117 COLINS 19 012 BABA 25 023 SHADE 18 1302 IPADEOLA 21 Primary Key RESULT TABLE
STUD_ID SCORE GRADE
0117 65 B 012 78 A 023 60 B 1302 87 A Foreign Key ADVANTAGES OF RELATIONAL DATABSES The key advantages of relational databases include the following: 1. It has the ability to create meaningful information by joining tables. Joining tables help to understand the relationship between the data and tables. 2. It eliminates data redundancy. 3. Timely accessibility of data in tables since redundancy is eliminated. CHALLENGES/ DISADVANTAGES OF RELATIONAL DATABASES 1. Requires more tables: In this world of high data growth. 2. Requires planning: For tables to be created, plans must be on ground. 3. Maintenance Issue: There is need to maintain the volume of data in the tables. AREA OF APPLICATION OF RELATIONAL DATABASE MODEL Any field where data is found or generated. a. Commerce (Customer information) b. Education (Students information) c. Finance (Banking, Insurance) d. Engineering (Construction, Mining, Production) e. Health (Patients information, Doctors’ Bookings/appointments)