Define data independence, Database Management System

Assignment Help:

Data independence seems that "the application is independent of the access strategy and storage structure of data". In other words, the ability to change the schema definition in one level could not change the schema definition in the next higher level. Two kinds of Data Independence:

Physical Data Independence: Change in physical level could not affect the logical level.
Logical Data Independence: Change in logical level could affect the view level.

1540_Data Independence.png

Related Discussions:- Define data independence

Concurrency control, define lock conversion

define lock conversion

What is transaction, What is transaction? Transaction is a unit of prog...

What is transaction? Transaction is a unit of program implementation that accesses and possibly updated several data items.

Job scheduling strategy, 1) Define a job scheduling strategy that will meet...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

Coursework, ERD Diagram of Medical Recruitment Agency?

ERD Diagram of Medical Recruitment Agency?

Explain the functional mode with help of an example, Explain the Functional...

Explain the Functional Mode with help of an example. Functional Model The functional model shows a computation and functional derivation of data values in it without ind

What are the basic merits of decomposition, The basic merits of decompositi...

The basic merits of decomposition. The Advantages of Decomposition 1. Separate person can work on each subsystem. 2. A particular software engineer can specialize in a

What is the difference between where and having clauses, What is the differ...

What is the difference between WHERE and HAVING clauses?. Predicates in the WHERE clause applies to every tuple while the predicate in the HAVING clause applies to groups.

Describe the nested-loop join and block-nested loop join, Describe the nest...

Describe the nested-loop join and block-nested loop join. Ans: The block nested- loop join algorithm is as described below: for every block B r of relation R do beg

Explain what is relation, Explain What is Relation? A database relatio...

Explain What is Relation? A database relation is a predefined row or column format for storing information in a relational database. Relations are equal to tables.

Enumerate about the high-level transitions result, Show, with the help of a...

Show, with the help of an example, that relatively high-level transitions result when system or program is stimulated by the outside events. In diagram below, we can observe i

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages