Consider the following statements:
A. A non-serial schedule is said to be conflict serializable if it is conflict-equivalent to some serial schedule.
B. A non-serial schedule is said to be view serializable if it is view-equivalent to some serial schedule.
C. A schedule is said to be serial if instructions of participating transactions are chronologically interleaved with each other.
D. A conflict-serializable schedule will be view-serializable also but vice-versa may not be true.
Choose the correct answer from the options given below:
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. A, B, D Only
Explanation
A, B and D are standard definitions/results. C is false: in a serial schedule the transactions run one after another without interleaving.More Database Management Systems questions
- What will be the right sequence of the phases of database design? A. Physical Design B. Conceptual Design C. Logical Design D. Requirement…
- An alternate key in a database table is also called
- In concurrency control, the phantom problem may occur when
- Which of the following is/are FALSE statement(s)? A. An all-key relation is always in BCNF since it has no FDs. B. A relation that is not i…
- Which of the following commands can be used to modify data in an SQL table? A. INSERT B. DELETE C. UPDATE D. SELECT Choose the correct answ…
- Which of the following tables contains the primary information in a data warehouse?