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

Explain transaction manager and their work, Explain Transaction manager and...

Explain Transaction manager and their work? Transaction Manager: Ensure the database remains in a constant (correct) state despite system failure, and in which concurrent trans

List the sql domain types, List the SQL domain Types? SQL supports the ...

List the SQL domain Types? SQL supports the following domain types. 1) Char(n) 2) varchar(n) 3) int 4) numeric(p,d) 5) float(n) 6) date.

Differentiate between key and superkey, Differentiate between Key and super...

Differentiate between Key and superkey? Key and superkey - A key a single attribute or a combination of two or more attributes of an entity set in which is used to identify o

Need for client server computing, Need for Client Server Computing- Client/...

Need for Client Server Computing- Client/Server (C/S) architecture includes running the application on multiple machines in which every machine with its component software tackles

What is data storage, What is Data Storage? The storage structures and ...

What is Data Storage? The storage structures and access methods used by database system are specified by a set of explanation in a special type of DDL called data storage-defin

Icloud based storage, Advantages and disadvantages of icloud based storage

Advantages and disadvantages of icloud based storage

Having clause-data manipulation language, Having clause This clause...

Having clause This clause is used for producing conditions on grouped information. Example: Find maximum salary and department number of those departments where maxim

How does query tree represent relational algebra expression, How does a que...

How does a query tree represent a relational algebra expression?  Discuss any three rules for query optimisation, giving example as to when should each rule be applied.     Ans

Example of database optimisation, Create 1 experiment to demonstrate an asp...

Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment

Skills required, wrie a report on whether a BSc n information systems devel...

wrie a report on whether a BSc n information systems develops the skills required by employers in Database administration

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