Mappings between levels and data independence, Database Management System

Assignment Help:

Mappings between Levels and Data Independence

The 3 levels of abstraction in the database do not exist separately of each other. There must be some correspondence, or mapping, among the levels. There are two types of mappings: the internal / conceptual mapping and the conceptual / external mapping.

The internal / conceptual mapping lies among the internal and conceptual levels, and tells the correspondence among the records and the data structures of the internal view and fields of the conceptual view and the files. If the structure of the stored database is changed, then the internal / conceptual mapping must also be changed accordingly so that the view from the conceptual level remains similar. It is this mapping that gives physical data independence for the database. For instance, we may modify the internal view of student relation by breaking the student file into two files, one containing enrolment, address and name and other containing enrolment, programme. Therefore, the mapping will make sure that the conceptual view is restored as original. The storage decision is firstly taken for optimisation purposes.

The external/conceptual view lies between the external and conceptual levels, and tells the correspondence between a particular external view and the conceptual view. Though these two levels are same, some elements discover in a particular external view may be different from the conceptual view. For example, various fields can be combined into a single (virtual) field, which can also have dissimilar names from the original fields. If the structure of the database at the conceptual level is changed, then the conceptual / external mapping must change accordingly so that the view from the external level remains constant. It is this mapping that gives logical data independence for the database. For instance, we may change the student relation to have more fields at conceptual level, yet this will never change the two user views at all.

It is also doable to have another mapping, where one external view is show in terms of other external views (this could be known as external/external mapping). This is useful if various external views are closely related to one another, as it permits you to avoid mapping each of the same external views directly to the conceptual level.


Related Discussions:- Mappings between levels and data independence

Define 3nf normal form, 3NF Normal Form A relation schema R is in 3NF ...

3NF Normal Form A relation schema R is in 3NF if it is in 2NF and for each FD X A either of the following is true X is a Super-key of R. A is a prime attribute of R

Sql, Events4Fun is an event management company in Europe with branches in S...

Events4Fun is an event management company in Europe with branches in South America as well. The company is well-known for its efficiency, good-quality services, and affordable char

Strong entity set and weak entity set, Strong entity set and weak entity se...

Strong entity set and weak entity set? Strong entity set and weak entity set: A strong entity set has a primary key. All tuples in the set are distinguishable through that key.

Column constraints, Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY K...

Column Constraints: NOT NULL, UNIQUE, CHECK, PRIMARY KEY, DEFAULT, REFERENCES, On  delete  Cascade :  Using  this  key  whenever  a  parent  row  is  removed  in  a referenced

Whst is logical schema, Whst is logical schema ? Logical schema is the ...

Whst is logical schema ? Logical schema is the entire database.

A database administrator'', A database administrator''s responsibilities an...

A database administrator''s responsibilities and data contents

Create a view containing name and number of department, Create a view emp_d...

Create a view emp_dep containing e_name and number of dependents from the tables employee and dependent of (i) CREATE VIEW emp_dept AS SELECT ename, COUNT(*) FROM employee, dep

Explain the b+ tree, Explain the B + tree? B + tree is a type of tre...

Explain the B + tree? B + tree is a type of tree which denotes sorted data in a way that permits for efficient insertion, retrieval and removal of records, each of which is

Sql, find the name of supplier who supply some red part

find the name of supplier who supply some red part

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