Differentiate between logical database design and physical, Database Management System

Assignment Help:

Differentiate between logical database design and physical database design. Show how this separation leads to data independence?

Basis

Logical Database Design

Physical Database Design

 

Task

Maps  or  transforms  the  conceptual schema (or an ER schema) from the high-stages data model into a relational database schema.

The specifications for the stored database within terms of physical storage structures, record placement, and indexes are designed.

 

Choice of criteria

The mapping can proceed in two levels:

1. System independent mapping but data model-depending.

2. tailoring the schemas to a specific DBMS.

 

The following criteria are frequent used to guide the choice of physical database design option:

1. Response Time option

2. Space Utilization

3.Transaction throughout

 

Result

DDL statements within the language of the chosen DBMS that specify the conceptual and external stages schemas of the database system. But if the DDL statements involve a few physical design parameters, a completed DDL specification must wait until after the physical database.

An initial determination of storage structures and  the access  paths  for the database files. This corresponds to defining the internal schema in terms of Data Storage Definition Language.

 

The database design is separated into various phases. The logical database design and physical database design are two of them. This separation is commonly based on the concept of three-level architecture of DBMS that gives the data independence. Therefore, we can say in which this separation leads to data independence since the output of the logical database design is the conceptual and external level schemas of the database system that is independent from the output of the physical database design which is internal schema.


Related Discussions:- Differentiate between logical database design and physical

Which data manipulation command combines the records, Which data manipulati...

Which data manipulation command combines the records from one or more tables ? JOIN data manipulation command combines the records from one or more tables.

Explain the dependency relationship of object oriented, Explain the depende...

Explain the dependency relationship of object oriented A dependency is a relationship which states that a change in specification of one thing can affect another thing, but n

Relational declarative database language environment, Server Control It ...

Server Control It is usual to control access to the data via the front end application, for example by displaying data as ‘read only'. This part of the assignment illustrates ho

Non-query optimisations, Part: Recommended (Non-query) Optimisations Thi...

Part: Recommended (Non-query) Optimisations This section entitled "Recommended (non-query) optimisations" should be a brief report containing recommended optimisations you would

What are the various properties of relational tables, What are the various ...

What are the various properties of Relational tables? Relational tables have 6 properties: 1. Each row is unique. 2. Column values are of the same kind. 3. Values are

Non-redundant cover and canonical cover, Given the following set of functio...

Given the following set of functional dependencies {cf?bg, g?d, cdg?f, b?de, d?c} defined on R(b,c,d,e,f,g) a.Find a non-redundant cover. b.Find a canonical cover.

Explain composite attribute in sql, Explain Composite attribute in SQL ? ...

Explain Composite attribute in SQL ? Composite attribute: A composite attribute has many components, each of that is atomic or composite.

Give an example of operations from the functions of a bank, Give an example...

Give an example of Operations from the functions of a bank. For creation of a saving account, you can write: bank::: create -savings-account (customer)->account. For oper

What is a hash index, What is a hash index? A hash index organizes the ...

What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.

Basic set operation, These are the binary operations; i.e., each is applied...

These are the binary operations; i.e., each is applied to two relations or sets. These two relations can be union compatible excluding in case of Cartesian product. Two relations R

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