Chapter :- 3 (English)

1. Relational Data Model

Relational Data Model

The Relational Data Model (RDM) is a way of structuring data using tables (called relations).
Each table consists of rows (tuples) and columns (attributes).
The model is based on set theory and first-order logic, and it uses keys to uniquely identify rows and enforce relationships between tables.

 

ü     Advantages

1. Simplicity

• Data is stored in intuitive table structures that are easy to understand and work with.
• Reduces complexity compared to hierarchical or network models.

2. Data Independence

• Physical data storage details are separate from logical data structures.
• Applications do not need to change if underlying storage changes.

3. Flexibility in Querying (via SQL)

• SQL allows complex queries (joins, aggregations, filtering) with simple syntax.
• Query optimization improves efficiency.

4. Normalization Reduces Redundancy

• Organizing data into multiple related tables minimizes duplication.
• Helps maintain consistency.

5. Strong Data Integrity

• Supports constraints (primary keys, foreign keys, unique, check).
• Ensures accuracy and consistency.

6. Security

• Fine-grained access control (table-level or column-level).
• Mature security models in commercial RDBMSs.

 

ü     Disadvantages

1. Costly for Very Large or Distributed Data

• Scaling horizontally (across servers) is difficult.
• Not ideal for big data or high-velocity applications.

2. Performance Overhead with Complex Joins

• Queries involving many joins can be slow.
• Not suitable for deep or highly interconnected data.

3. Requires Structured, Predefined Schema

• Schema must be defined before inserting data.
• Not flexible for unstructured or semi-structured data (unlike NoSQL).

4. Normalization Can Make Queries Complex

• Splitting data into many tables reduces redundancy but increases query complexity.

5. Less Suitable for Hierarchical or Graph-like Data

• Modeling networks or hierarchical relationships requires multiple join tables.