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!
Physical Database Design Issues
The database design includes the process of logical design with the use of E-R diagram, normalisation, etc., followed by the physical design.
The Key issues in the Physical Database Design are:
Some of the basic inputs needed for Physical Database Design are:
Though, for this type of data some of the Physical Database Design Decisions that are to be taken are:
Define what Immediate database modification technique uses? Ans: Both undo and redo.
Designing the fields in the data base The following are the considerations one has to remain in mind while designing the fields in the data base. Coding, compression, en
Define Deadlock avoidance These protocols as well ensure that the system will never enter a deadlock state although the way it is done is different from deadlock prevention. I
What is association? Give an example of association Association is used for establishing relationships among classes. Association describe links among/between classes. For exa
Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a
Construct an ER diagram for a hospital along with a set of patients and a set of medical doctors Associate with every patient a log of the several tests and examinations conducted.
can you please explain with the help of suitable example the difference between conflict equivalence and conflict serializability?
Problem 1. Create a PL/SQL program to insert data into student table and display the details of the student having Reg.No 1010 Writing a PL/SQL program to Insert data
Differentiate between strict two-phase and rigorous two-phase with conversion protocol Ans: Strict two-phase locking holds all its exclusive that is write locks until commit t
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both
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