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!
How does the two phase protocol ensure serializability in database schedules?
Ans: A transaction is termed to follow the two-phase locking protocol if all locking operations precede the first unlock operation in the transaction. Such type of transaction can be divided into two phases: and expanding or growing (first) phase and a shrinking (second) phase. The two-phase locking protocol makes sure serializability in database schedules. Refer any transaction. The point in the schedule in which the transaction has obtained its final lock (the end of its growing phase) is called the lock point of the transaction. Here Now, transactions can be ordered as per to their lock points - this ordering is, actually, a serializability ordering for the transactions.
What are referential integrity constraints? A value that appears in single relation for a given set of attributes also appears for a particular set of attributes in another rel
what is file organization? what are file organization techniques.explain in detail? explain random file organization technique, multikey file organization technique?what is indexin
Define the Query optimisation The query parser commonly generates a standard initial tree to correspond to an SQL query, with no doing any optimization. Such type of a canonica
For Colorado customers calculate the number of single products ordered. If a product is purchased on multiple orders, it should be counted only single time. The result should conta
What is a view? How it is related to data independence? A view might be thought of as a virtual table, that is, a table that does not really exist in its own right but is inste
Define decision tree classifiers? As the name suggests decision tree classifiers use a tree: Every leaf node has an associated class, and every internal node has a predicate as
What are metrics for choosing the best algorithm? Matrices for choosing the best algorithms are as below: Computational complexity Ease of understand ability and im
How are tables stored on Disk? We realise that every record of a table can have different amounts of data. This is due to in some records; some attribute values may be "zero".
Benefits of heap files 1. This is a easy file Organisation method. 2. Insertion is somehow capable. 3. Good for bulk-loading data into a table. 4. Best if file
read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.
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