Q. A data warehouse administrator is concerned with which of the following?

View solution

Q. Poor data administration can lead to which of the following?

View solution

Q. Backward recovery is which of the following?

View solution

Q. Which of the following contains a complete record of all activity that affected the contents of a database during a certain period of time?

View solution

Q. In database management system, the executing process or executing program which considers the updating or reading of records stored in database is called

View solution

Q. The application of database management system in air flight seat booking in a way that one seat is accessed by only one clerk for customer reservation is classified as

View solution

Q. Collections of operations that form a single logical unit of work are called __________

View solution

Q. The “all-or-none” property is commonly referred to as _________

View solution

Q. Which of the following is a property of transactions?

View solution

Q. Execution of translation in isolation preserves the _________ of a database

View solution

Q. Which of the following is not a property of a transaction?

View solution

Q. Which of the following systems is responsible for ensuring durability?

View solution

Q. Which of the following systems is responsible for ensuring isolation?

View solution

Q. State true or false: Information residing in the volatile storage does not usually survive system crashes

View solution

Q. A transaction that has not been completed successfully is called as _______

View solution

Q. Which of the following is not a transaction state?

View solution

Q. The execution sequences in concurrency control are termed as ________

View solution

Q. The scheme that controls the interaction between executing transactions is called as _____

View solution

Q. I and J are _________ if they are operations by different transactions on the same data item, and at least one of them is a write operation.

View solution

Q. If a schedule S can be transformed into a schedule S’ by a series of swaps of non-conflicting instructions, then S and S’ are

View solution