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.
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
Draw an EER diagram that captures the "is-a" hierarchy of students in another simple database. The database captures both the "basic" information (say, student ID and student name)
Explain about database system structure? Storage manager Authorization and integrity manager Transaction manager File manager Buffer manager Storage manager
Define instance and schema? Instance: Collection of data kept in the data base at a particular moment is known as an Instance of the database. Schema: The o
Exclusive lock It is asked for by a transaction on a data item that it wants to update. No other transaction can put either a shared lock or an exclusive lock on a dat
Determine the OBJECTIVES of object design After passing through this unit, you should be able to: describe and apply concept of generalisation; understand and appl
An entity type usually has an attribute whose values are distinct for every individual entity in the collection. Such an attribute is known as a key attribute and its values can be
Draw entity relationship diagram for the following scenario. A university has many departments whereas each department belongs to that particular uni. That uni has also many bui
Define entity integrity and referential integrity. How does SQL allow specification of these? Ans: Entity Integrity Rule- If the attribute A of relation R is a prime attribut
A buyer for a large department store chain must place orders with an athletic shoe manufacturer six months prior to the time the shoes will be sold in the department stores. In par
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: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd