2.1 Self-Describing Nature of a Database System

Unlike traditional file systems, a database doesn't just contain the data itself; it also contains a complete definition or description of the database structure and constraints. This definition is stored in the DBMS Catalog (or Data Dictionary).

• Metadata: This "data about data" describes the structure of each file, the type and storage format of each data item, and various constraints on the data.
• Impact: This allows the DBMS software to work with different databases without being hard-coded for a specific structure.

2.2 Insulation Between Programs and Data (Program-Data Independence)

In traditional file processing, the structure of data files is embedded in the application programs. If you change the size of a field from 20 to 30 characters, every program accessing that file must be modified.

• DBMS Solution: The DBMS provides a conceptual representation of data. Application programs refer to this representation rather than the physical storage details.
• Data Abstraction: This allows the internal storage structure to change without affecting the application logic.

2.3 Support of Multiple Views of the Data

A database typically has many users, each of whom may require a different perspective or view of the database.

2.4 Sharing of Data and Multi-user Transaction Processing

a multi-user DBMS must allow multiple users to access the database at the same time. This is essential if data for multiple applications is to be integrated and maintained in a single database.

• Concurrency Control: The DBMS ensures that multiple users trying to update the same data do not interfere with each other (e.g., two travel agents booking the last seat on a flight).
• OLTP (Online Transaction Processing): A type of data processing that consists of executing a number of transactions occurring concurrently.

2.5 Summary of Database Approach Advantages

1. Controlling Redundancy: Storing data only once.
2. Restricting Unauthorized Access: Security and authorization subsystems.
3. Providing Persistent Storage: Objects survive after the program terminates.
4. Providing Storage Structures: Efficient search using Indexes and Hashing.
5. Providing Backup and Recovery: Protecting against hardware or software failure.