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.
A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples
Find a 3NF decomposition of the following relation scheme: University (Faculty, Dean, Department, Chair, Professor, Rank, Student}. The University relation satisfies the following
There are a number of possible solutions to the open ended brief. One of the simple ones is shown here without the PKs and FKs. It is important to think of how a number of tasks
Determine the Disadvantages of file based systems Some of the disadvantages of file based systems are like this: Data redundancy and inconsistency: the dissimilar applic
Explain the disadvantages of using DBMS There could be a few disadvantages of using DBMS. As DBMS requires computers, we have to invest a good amount in acquiring the hardwa
Determine the Three Views of Data We know that the similar thing, if viewed from dissimilar angles produces difference sights. Similarly, the database that we have formed alrea
Process-oriented decompositions Process-oriented decompositions divide complex process, task or function into simpler sub processes until they get simple enough to be deal
Derived horizontal fragmentation: Some applications may include a join of two or more relations. If the relations are stored at dissimilar locations, there may be a major overhead
in case of functional dependencies how we get the higher normal form.
Explain the difference between optimistic locking and pessimistic locking. Optimistic locking supposes no transaction conflict will occur and deals with the consequences if it
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