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

What is an index, What is an Index? An index is a small table having on...

What is an Index? An index is a small table having only two columns. The first column has a copy of the primary or candidate key of a table and the second column having a set o

Describe log based recovery, Describe log based recovery The most usabl...

Describe log based recovery The most usably structure for recording data base modification is the LOG the log is a sequence of log records recording all the update activities i

What disadvantage of odbc does ole db overcome, What disadvantage of ODBC d...

What disadvantage of ODBC does OLE DB overcome? By breaking the features and the methods of a DBMS into COM objects, OLE DB characteristic overcomes a main disadvantage of ODBC

Design and building a distributed information system, The scenario You ...

The scenario You have been approached to design and implement a prototype of a distributed information system for a national car part retail outlet chain. The company comprises

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

With the help of a diagram defines typical element modules, With the help o...

With the help of a diagram defines the typical element modules of a DBMS? The functional elements of a database system can be widely divided into: 1) Storage manager and 2) q

Hashing.., various techniques of hashing?

various techniques of hashing?

Define garbage collection, Define garbage collection. Garbage may be fo...

Define garbage collection. Garbage may be formed also as a side effect of crashes. Periodically, it is essential to find all the garbage pages and to add them to the list of fr

Locking, define locking in simple language and decribed it

define locking in simple language and decribed it

RDBMS, why data in an RDMS need to be normalised

why data in an RDMS need to be normalised

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