Question

Define i)Data Abstraction ii)Data Redundancy

Answer 1

Of course. Here are the definitions for Data Abstraction and Data Redundancy, explained with examples.

---

i) Data Abstraction

Definition:
Data Abstraction is the process of hiding the complex, underlying details of how data is stored and maintained, while exposing only the essential features to the user. The goal is to simplify the user's interaction with the database by providing a simplified, logical view of the data, rather than its complex physical implementation.

Think of it as creating a simplified "user interface" for the data. You don't need to know how a car's engine works to drive it; you only need to know how to use the steering wheel, pedals, and gear shift. Data abstraction applies the same principle to databases.

In a Database Management System (DBMS), data abstraction is typically achieved through three levels:

1. Physical Level (Lowest Level):
   Description: This is the lowest level of abstraction and describes how the data is actually stored on a physical storage medium (like a hard disk). It deals with complex low-level data structures, file organization, indexes, and memory management.
   Who Sees It: Database system developers and database administrators (DBAs).
   * Example: It defines whether data is stored in B+ trees or hash tables, the size of a data block on the disk, and the specific memory addresses.

2. Logical Level (Conceptual Level):
   Description: This level describes what data is stored in the database and what relationships exist among that data. It defines the entire database in terms of a small number of relatively simple structures (e.g., tables). The DBA works at this level to design the database schema.
   Who Sees It: Database administrators and application developers.
   * Example: A DBA might define a Students table with columns like StudentID (Integer), FirstName (Text), Major (Text), and a Courses table. They would also define a relationship between them (e.g., a student can enroll in many courses). It hides the complexity of how these tables are physically stored.

3. View Level (Highest Level):
   Description: This is the highest level of abstraction and describes only a part of the entire database that is relevant to a specific user or group of users. It simplifies the user's interaction by hiding parts of the database that they don't need to see, and can also be used for security purposes.
   Who Sees It: End-users and application programs.
   * Example: A university student might log into a portal and see a view that shows only their own grades and registered courses. This view hides all other students' data, as well as complex administrative information like faculty salaries or tuition payment details.

---

ii) Data Redundancy

Definition:
Data Redundancy is a condition in a data storage system where the same piece of data is stored in two or more separate places. This duplication of data is a key characteristic of poorly designed databases and typical file processing systems.

While some controlled redundancy can be useful for performance (e.g., in data warehouses), uncontrolled redundancy is a major source of problems.

Consequences of Data Redundancy:

1. Data Inconsistency: This is the most serious problem. If a piece of data is stored in multiple locations, any update to that data must be performed in every single location. If one or more copies are missed, the data becomes inconsistent, leading to conflicting and unreliable information.
2. Wasted Storage Space: Storing the same information multiple times consumes unnecessary disk space, which can become costly as the database grows.
3. Update Anomalies: Redundancy makes data maintenance difficult. If a customer's address needs to be updated, a programmer has to figure out all the files where that address is stored and modify all of them, increasing the chance of errors.
4. Insertion/Deletion Anomalies: It can create problems when adding or removing data. For example, you might not be able to store details for a new department until a staff member is assigned to it, or deleting the last staff member of a department might accidentally delete the department's information itself.

Example:
Consider a university's old file system with two separate files:

File 1: Registrar.csv
| StudentID | StudentName | StudentAddress | Major |
| :--- | :--- | :--- | :--- |
| 101 | John Smith | 123 Main St | Computer Science |
| 102 | Jane Doe | 456 Oak Ave | Biology |

File 2: Library.csv
| CardID | StudentName | StudentAddress | BooksOut |
| :--- | :--- | :--- | :--- |
| L-789 | John Smith | 123 Main St | 3 |
| L-790 | Jane Doe | 456 Oak Ave | 1 |

Here, StudentName and StudentAddress are redundant—they are stored in both files.

• Inconsistency Problem: If Jane Doe moves to "789 Pine Ln", a clerk might update the Registrar.csv file but forget to update the Library.csv file. Now the system has two different addresses for the same student, creating data inconsistency.

A DBMS solves this by using normalization, storing Jane's address in a single Students table and having both the Registrar and Library systems reference that one, authoritative record.