What is Data Independence in DBMS

What is Data Independence in DBMS

What is Data Independence in DBMS

Topic :- What is Data Independence in DBMS

Data Independence 

The three-schema architecture can be used to further explain the concept of data independence, which can be defined as the capacity to change the schema at one level of a database system without having to change the schema at the next higher level. We can define two types of data independence: What is Data Independence in DBMS

  1. Logical data independence is the capacity to change the conceptual schema without having to change external schemas or application programs. We may change the conceptual schema to expand the database (by adding a record type or data item), to change constraints, or to reduce the database (by removing a record type or data item). In the last case, external schemas that refer only to the remaining data should not be affected For example, the external schema of Figure 1.5(a) should not be affected by changing the GRADE_REPORT file (or record type) shown in Figure 1.2 into the one  shown in Figure 1.6(a). Only the view definition and the mappings need be changed in a DBMS that supports logical data independence. After the conceptual schema undergoes a logical reorganization, application programs that reference the external schema constructs must work as before. Changes to constraints can be applied to the conceptual schema without affecting the external schemas or application programs. What is Data Independence in DBMS
  2. Physical data independence is the capacity to change the internal schema without having to change the conceptual schema. Hence, the external schemas need not be changed as well. Changes to the internal schema may be needed because some physical files were reorganized-for example, by creating additional access structures—to improve the performance of retrieval or update. If the same data as before remains in the database, we should not have to change the conceptual schema. For example, providing an access path to improve retrieval speed of section records (Figure 1.2) by semester and year should not require a query such as list all sections offered in fall 2004 to be changed, although the query would be executed more efficiently by the DBMS by utilizing the new access path. What is Data Independence in DBMS

The Three-Schema Architecture

 The goal of the three-schema architecture, illustrated in Figure 2.2, is to separate the user applications and the physical database. In this architecture, schemas can be defined at the following three levels:

  1. The internal level has an internal schema, which describes the physical storage structure of the database. The internal schema uses a physical data model and describes the complete details of data storage and access paths for the database. 
  2. The conceptual level has a conceptual schema, which describes the struc ture of the whole database for a community of users. The conceptual schema hides the details of physical storage structures and concentrates on describing entities, data types, relationships, user operations, and constraints. Usually, a representational data model is used to describe the conceptual schema when a database system is implemented. This implementation conceptual schema is often based on a conceptual schema design in a high level data model. What is Data Independence in DBMS
  3. The external or view level includes a number of external schemas or user – 200 views. Each external schema describes the part of the database that a particular user group is interested in and hides the rest of the database from that

 

 

Also Read 

Types of Relationship in DBMS

Types of Relationship in DBMS

Relational Algebra in DBMS Exercises and Solutions

Relational Algebra in DBMS Exercises and Solutions

Types of Attributes in DBMS

Types of Attributes in DBMS

Advantages of DBMS Over File System

Advantages of DBMS Over File System

Weak Entity in DBMS

Weak Entity in DBMS

 

File System Vs DBMS

File System Vs DBMS

Relational Calculus in DBMS

Relational Calculus in DBMS

Query Processing in DBMS

Query Processing in DBMS

Deadlock in DBMS

Deadlock in DBMS

Architecture Of DBMA

Architecture Of DBMA

DBMS Full Form
 

DBMS Full Form

Set Operations in DBMS

Set Operations in DBMS

 

Spread the love

Leave a Comment

Your email address will not be published. Required fields are marked *