Consider the following two statements about database transaction schedules
Q. Consider the following two statements about database transaction schedules: Which of the above statements is/are TRUE? (A) I only (B) II only (C) Both I and II (D) Neither I nor II Ans: Both I and II Solution: Strict 2PL allows only schedules whose precedence graph is acyclic i.e. schedule is Conflict Serial. In […]
Consider the following two statements about database transaction schedules Read More Β»










