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!
Explain the shadow paging recovery technique.
Ans: Shadow paging is a method used to acquire atomic and durable transactions, and provides the capability to manipulate pages in a database. Throughout a transaction, the pages influenced by the transaction are copied from the database file into a workspace, like volatile memory, and modified in that workspace. While a transaction is committed, all of the pages that were altered by the transaction are written from the workspace to not used pages in the database file.
Throughout execution of the transaction, the state of the database exposed to the user is that where the database existed prior to the transaction, as the database file still consist of the original versions of the modified pages, like they existed before being copied into the workspace. If a user accesses the database previous to the transaction is complete, or on the recovery of a failure, it will come out as though the transaction has not occurred.
Define union compatibility? Explain why INTERSECTION of two relations cannot be performed if they are not union compatible? Two relations R(A1, A2,-------, An) and S(B1, B2,--
What is known as sequential file organization? In the sequential file organization, the records are kept in sequential order, according to the value of a "search key" of every
construct a B+ tree for the following set of key value (2,3,5,7,11,19,23,29,31) in ascending order where the pointers that will fit in one node is as follows:A. four B. six C. eigh
Define multivalued dependency. What do understand by trivial multivalued dependency? Ans: A multivalued dependency is a full constraint among two sets of attributes in a rela
Define Timestamp ordering Ans In timestamp-based method, a serial order is made among the concurrent transaction by assigning to every transaction a unique nondecreasing number
What is a hash index? A hash index organizes the search keys, with their associated pointers, into a hash file structure.
it can be possible to create any table without primary key
describe all the tables you have created. ?get table_name, status, num_rows, user_stats in user_tables system view ?get table_name, constraint_name, constraint_type in user_constr
folding method and mid square method using visual basic
Define Query Processing Query processing is the process of selecting the best plan or strategy to be employed in responding to a database request. The plan is then executed to
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