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

Define the notation for classes and atrributes, Define the notation for cla...

Define the notation for classes and atrributes The notation for class, attribute, and operations are shown below:     Figure: Class with attributes and operations A

Logical entity relationship diagrams, How can i turn a conceptual entity re...

How can i turn a conceptual entity relationship diagram into a logical entity relationship diagram? what do i have to do with "mandetory or" and "optional or" relationships?

Describe the most important classes of parallel machines, Question 1 Discu...

Question 1 Discuss the classification of DBMS based on location of database Question 2 Explain with examples different SQL commands used for creating and deleting relations.

What are the physical characteristics of magnetic disks, What are the physi...

What are the physical characteristics of magnetic disks?   Ans: A magnetic disk is a circular plate or platter of plastic or metal that is coated with magnetizable material lik

Sparse and dense indexes, Sparse and Dense Indexes These indexes in pri...

Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

By which techniquestransaction processing is associated, By which technique...

By which techniquesTransaction processing is associated? Transaction processing is associated by producing detail, summary, or exception reports and recording a business activi

Determine the object-oriented design process, An object-oriented design pro...

An object-oriented design process  1. Define the context and modes 2. Designs the system architecture 3. Identifies the principal system objects 4. Identifies concurrency in

Keys - relational database integrity, Candidate Key:  In a relation R, a ca...

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Give example of relational schema, An instance of relational schema R (A, B...

An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val

Define the term database, QUESTION (a)(i) Define the term database. ...

QUESTION (a)(i) Define the term database. (ii) How is it different from a database management system? (b) What is the difference between an entity and an attribute? (c

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