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

Data aggregation, Q.   Explain  data aggregatio n and discuss differen...

Q.   Explain  data aggregatio n and discuss different design constraints. Sol. Aggregation   One limitation of the E-R model is that it cannot express relationships amon

Construct a generalization-specialization hierarchy, Construct a generaliza...

Construct a generalization-specialization hierarchy for a motor-vehicle sales company. The company sells motorcycles that comprise an engine number and cost; cars that have a chass

What is the meaning of recovery, What is the meaning of Recovery? In d...

What is the meaning of Recovery? In deferred update methods, if a transaction fails before arriving its commit point, it will not have altered the database in any way, so UNDO

Unit database integrity, Relations create the database. They must satisfy v...

Relations create the database. They must satisfy various properties, like no duplicate tuples, no ordering of tuples, and atomic attributes, etc. Relations that satisfy these basic

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

Information Technology, What benefits can a company gain by managing its ow...

What benefits can a company gain by managing its own information infrastructure and servicea

What is de-normalization, What is De-normalization? De-normalization is...

What is De-normalization? De-normalization is the method of attempting to optimize the performance of a database by adding redundant data. It is sometimes essential because cur

Hoework, Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. ...

Farmer Bob, Farmer Jane and Farmer Jose run a cow farming co-op. For every cow they keep the cow’s name, age (or date of birth), breed and numbered plastic ear tag. The each of t

Relational database management, For this application, we will consider IBM ...

For this application, we will consider IBM DB2 catalog data (i.e., metadata) for IBM's enterprise-class servers running the z/OS (formerly OS/390 or MVS) operating system.  One of

B-tree, construct a b-tree for the following set of key values 2,3,5,7,11,1...

construct a b-tree for the following set of key values 2,3,5,7,11,17,19,23,29,31.assume that the tree is initial empty and the values are added in ascending order

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