# Which of the following histories are recoverable?

FratBro23
Category:
Computer Science
Price: \$5 USD

Question description

One says that history H is recoverable if, whenever transaction Ti reads (some item x) from transaction Tj (i 6= j) in H and Ci occurs in H, then Cj ≺S Ci . Ti “reads x from” Tj in H if 1. Wj(x) ≺H Ri(x), and 2. Ajnot ≺H Ri(x), and 3. if there is some Wk(x) such that Wj(x) ≺H Wk(x) ≺H Ri(x), then Ak ≺H Ri(x). Which of the following histories are recoverable?

H1 ={W2(x),W1(x),R3(x),R1(x),C1,W2(y),R3(y),R3(z),C3,R2(x),C2}

H2 ={R3(z),R3(y),W2(y),R2(z),W1(x),R3(x),W2(x),R1(x),C1,C2,C3}

H3 ={R3(z),W2(x),W2(y),R1(x),R3(x),R2(z),R3(y),C3,W1(x),C2,C1}

H4 ={R2(z),W2(x),W2(y),C2,W1(x),R1(x),A1,R3(x),R3(z),R3(y),C3}

Studypool has helped 1,244,100 students

Type your question here (or upload an image)

1831 tutors are online

### Related Computer Science questions

Brown University

1271 Tutors

California Institute of Technology

2131 Tutors

Carnegie Mellon University

982 Tutors

Columbia University

1256 Tutors

Dartmouth University

2113 Tutors

Emory University

2279 Tutors

Harvard University

599 Tutors

Massachusetts Institute of Technology

2319 Tutors

New York University

1645 Tutors

Notre Dam University

1911 Tutors

Oklahoma University

2122 Tutors

Pennsylvania State University

932 Tutors

Princeton University

1211 Tutors

Stanford University

983 Tutors

University of California

1282 Tutors

Oxford University

123 Tutors

Yale University

2325 Tutors