What are the limitations of file system that can be overcome by a relational DBMS?

Exercises · Q5

Q. What are the limitations of file system that can be overcome by a relational DBMS?

Tamil Nadu DgeTextbookSubjective· 3mImportance★★★★★est

21% · 6/29 Questions

🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

Concept understanding — Data Redundancy Elimination

Data Redundancy Elimination

Think about your wardrobe. You own one black blazer that works for every formal occasion — but somehow you end up with three nearly identical black blazers, each taking up space, each needing to be cleaned and maintained. That extra space in your cupboard is wasted. That extra effort in upkeep is wasted. Now imagine that same problem, but with data stored across a large organisation.

Data redundancy elimination is the process of identifying and removing duplicate copies of the same piece of information from a database or storage system. It is not about deleting data you need — it is about ensuring that the same fact, figure, or record is stored exactly once, and every other place that needs it simply points back to that single original.

Why does redundancy happen in the first place?

In any real-world organisation, data enters through many doors. A customer's address might be recorded by the sales team when they place an order, by the support team when they register a complaint, and by the marketing team when they run a campaign. Each team works in its own system, often unaware that the same address already exists elsewhere. Over time, the same customer name, the same product code, or the same transaction record gets stored in multiple places — sometimes with slight differences, sometimes as exact copies.

This is not a technical glitch. It is a natural consequence of how organisations grow and how different departments work independently.

What makes redundancy a problem?

Redundancy is not harmless. It creates three serious issues:

Wasted storage space — every duplicate copy consumes disk space, memory, and backup capacity. For a small business this may be trivial, but for a bank, a government department, or an e-commerce platform, the cost of storing millions of duplicate records adds up fast.
Data inconsistency — this is the more dangerous problem. If a customer's address is stored in five places and they move house, updating all five copies is tedious and error-prone. One copy gets updated, another is forgotten. Now the same customer has two different addresses in the same system. Which one is correct? The system cannot tell you. The data has lost its integrity.
Slower performance — searching through a bloated database, running reports, or generating invoices takes longer when the system has to wade through duplicate records. Every query becomes heavier than it needs to be.

Important

Data redundancy elimination is not about saving disk space alone. Its primary purpose is to preserve data integrity — ensuring that every fact in the system is stored once, updated once, and trusted by everyone who uses it.

How is it done in practice?

The process works at two levels.

At the database design level, redundancy is prevented before it happens. This is done through a technique called normalisation — breaking a large table into smaller, related tables so that each piece of information lives in exactly one place. For example, instead of storing a customer's name and address alongside every order they place, you store the customer details once in a separate table and link each order to that single record using a customer ID.

At the storage system level, redundancy is removed after the fact. Special software scans the stored data, identifies identical blocks or files, and replaces duplicates with pointers to a single copy. This is common in backup systems and cloud storage, where the same file might be saved by hundreds of users.

A concrete example …

Start your 14-day free trial to unlock the full solution →

Limitations of File System Overcome by a Relational DBMS

A file system stores data in separate, unrelated files — each application manages its own data independently. This creates several serious problems that a relational DBMS (RDBMS) is specifically designed to solve.

Data Redundancy and Inconsistency — In a file system, the same data (like a customer's address) gets duplicated across multiple files. When the address changes, it must be updated everywhere; miss one file and the data becomes inconsistent. An RDBMS eliminates this through normalization — each fact is stored exactly once in a table, and other tables reference it via foreign keys.

Data Isolation — Files are created in formats specific to each application (e.g., a .dat file for a payroll program, a .csv for inventory). Sharing data between applications is difficult or impossible. An RDBMS provides a single, unified view of all data through tables, accessible by any authorized application using SQL.

Concurrency Problems — When multiple users try to update the same file simultaneously, one user's changes can overwrite another's, leading to lost updates. An RDBMS uses transactions with ACID properties (Atomicity, Consistency, Isolation, Durability) to ensure that concurrent operations do not corrupt data.

Integrity Constraints — A file system has no way to enforce rules like "every order must belong to an existing customer" or "salary must be positive." An RDBMS enforces integrity constraints (primary keys, foreign keys, check constraints, NOT NULL) at the database level, preventing invalid data from being entered. …

Start your 14-day free trial to unlock the full solution →

A file system suffers from data redundancy, inconsistency, isolation, integrity problems, and concurrent-access issues — a relational DBMS solves all of these through centralised control, ACID properties, and a structured schema.

This is a plain theory question — you are being asked to list and explain the key limitations of file-based data storage and show how a relational database management system (RDBMS) addresses each one. The core idea is data redundancy elimination: a file system stores the same data in multiple places (redundancy), which leads to inconsistency, wasted space, and update anomalies. A relational DBMS normalises data into related tables, removing duplication at the source.

Here are the major limitations and how a relational DBMS overcomes them:

1. Data Redundancy and Inconsistency

In a file system, the same piece of information (e.g., a customer's address) is often stored in multiple files — an order file, an invoice file, a shipping file. If the address changes, it must be updated in every file. Miss one, and the data becomes inconsistent.

A relational DBMS eliminates redundancy through normalisation: data is stored in one place (e.g., a Customer table) and referenced via foreign keys in other tables. An address change requires only one update.

2. Data Isolation

Files are created by different applications in different formats — a .txt file, a .csv, a proprietary binary format. Writing a new program that needs data from multiple files becomes a nightmare of format conversion.

A relational DBMS provides a single, uniform interface (SQL) to access all data, regardless of how it was originally stored. The DBMS handles the physical storage; you only see logical tables.

3. Integrity Constraints

A file system has no built-in way to enforce rules like "every order must belong to an existing customer" or "salary must be positive". These checks must be coded into every application that writes to the file — and one buggy program can corrupt the data.

A relational DBMS enforces integrity constraints declaratively: PRIMARY KEY, FOREIGN KEY, CHECK, NOT NULL, UNIQUE. The database itself rejects any violation, regardless of which application tries to insert bad data.

4. Concurrent Access Anomalies

When two users try to update the same file at the same time, the file system typically lets the second write overwrite the first — or crashes. This leads to lost updates and inconsistent reads.

A relational DBMS uses transactions with ACID properties (Atomicity, Consistency, Isolation, Durability). It locks rows or tables as needed, ensuring that concurrent operations do not interfere. If a transaction fails, it is rolled back cleanly.

5. Security Problems

File systems offer only coarse-grained access control (read/write/execute at the file level). You cannot say "User A can see salaries but not change them; User B can see only names".

A relational DBMS provides fine-grained security: GRANT SELECT ON Employees TO UserA, REVOKE UPDATE ON Salaries FROM UserB. Access is controlled at the row and column level.

6. Data Atomicity …

Start your 14-day free trial to unlock the full solution →

←Previous questionQ4 — Compared to a file system, how does a database management system avoid…→Next questionQ6 — A school has a rule that each student must participate in a sports act…

Q.What are the limitations of file system that can be overcome by a relational DBMS?

🎓Unlock everything free for 14 days

Unlock everything free for 14 days