Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
What are aggregate functions? And list the aggregate functions supported by SQL? Aggregate functions are functions that take a collection of values as input and return a one va
Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen
a. Define the term "deadlock". There are four conditions that must hold before deadlock is possible. Name them. b. Outline an algorithm that detects whether there is a deadlock.
Which is another name for weak entity? Child is another name of weak entity.
Explain heap file with advantages? Heap File is an unordered set or a group of records, stored on a set of pages. This class gives basic support for inserting, updating, select
Explain the Dynamic Hashing Techniques There are two methods in it: extendible hashing - stores an access structure in addition to the file, and therefore is somewhat identica
Question 1 Draw a Data Flow Diagram for a University scenario Question 2 Discuss the following with suitable examples Relational Algebra Operators Database Pla
Determine the concept of Process Process: A process transforms the data values. It is represented as ellipse containing a description of transformation. Each procedure has a
pine vally company
Create 1 experiment to demonstrate an aspect of query optimisation by using access-path structures (indexes), decomposition, or denormalisation. Once satisfied with your experiment
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd