Define physical and logical data independence, Database Management System

Assignment Help:

Define physical and logical data independence. How does this architecture help in achieving these?

Data independence entails that change in one view must not need a change in the view(s) above. There are two sorts of data independence: logical and physical. The meaning of Logical data independence is that the conceptual view can be changed without influencing the existing external view, that is a given record may be spilt or combined along with other records but the external views need not be modified to reflect this. The meaning of Physical data independence is that the physical storage structures or devices employed to store the data can be changed without effecting the existing conceptual view or external view, that is if earlier indexed sequential files are employed to store data and then the B- trees are used, even then the upper layers must not be effected.


Related Discussions:- Define physical and logical data independence

ER diagram in database, What is an ER diagram? Why is it used in Database m...

What is an ER diagram? Why is it used in Database management system (DBMS)?

E r diagram, how to make an e r diagram?

how to make an e r diagram?

What is the full form of ddl, What is the full form of DDL? DDL is stan...

What is the full form of DDL? DDL is stand for Data Definition Language.

Give an example of object representation, Give an example of Object Represe...

Give an example of Object Representation  For illustration, consider the implementation of a social security number within an employee object that is shown in Figure. The soci

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

What is null, What is NULL? Simply NULL means not in value.

What is NULL? Simply NULL means not in value.

What is recursive closure and operation relational algebra, What is recursi...

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd