1. Trang chủ
  2. » Giáo án - Bài giảng

cơ sở dữ liệu lê thị bảo thu exercises 4 introduction to transaction processing concepts and theory sinhvienzone com

2 97 0

Đang tải... (xem toàn văn)

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 2
Dung lượng 274,25 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

DBMS – HK1 2016-2017 Exercises – Chapter 4Exercises Course: Database Management Systems Chapter 4 Introduction to Transaction Processing Concepts and Theory 1.. Exercise 21.22 in the t

Trang 1

DBMS – HK1 2016-2017 Exercises – Chapter 4

Exercises (Course: Database Management Systems)

Chapter 4 Introduction to Transaction Processing Concepts and Theory

1 Exercise 21.22 in the text book (“Fundamentals of Database Systems- 6th Edition”, Elmasri et al.)

Which of the following schedules is (conflict) serializable? For each serializable schedule, determine the equivalent serial schedules

a r1(X); r3(X); w1(X); r2(X); w3(X);

b r1(X); r3(X); w3(X); w1(X); r2(X);

c r3(X); r2(X); w3(X); r1(X); w1(X);

d r3(X); r2(X); r1(X); w3(X); w1(X);

2 Exercise 21.23 in the text book (“Fundamentals of Database Systems- 6th Edition”, Elmasri et al.)

Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given below Draw the serializability (precedence) graphs for S1 and S2, and state whether each schedule is serializable or not If a schedule is serializable, write down the equivalent serial schedule(s)

T1: r1 (X); r1 (Z); w1 (X);

T2: r2 (Z); r2 (Y); w2 (Z); w2 (Y);

T3: r3 (X); r3 (Y); w3 (Y);

S1: r1 (X); r2 (Z); r1 (Z); r3 (X); r3 (Y); w1 (X); w3 (Y); r2 (Y); w2 (Z); w2 (Y);

S2: r1 (X); r2 (Z); r3 (X); r1 (Z); r2 (Y); r3 (Y); w1 (X); w2 (Z); w3 (Y); w2 (Y);

3 Given two following transactions:

T1: r1(A); w1(A); r1(B);w1(B);

T2: r2(A); w2(A); r2(B);w2(B);

Prove that the schedule:

S: r1(A);w1(A); r2(A); w2(A); r1(B);w1(B); r2(B);w2(B);

is conflict-serializable (Hint: reordering the nonconflicting operations in S until we form the equivalent serial schedule)

4 Consider the three transactions T1, T2, and T3, and the schedules S1 and S2 given below Draw the serializability graph for S1 and S2, and state whether each schedule is conflict-serializable or not If a schedule is conflict-serializable, write down the equivalent serial schedule

Trang 2

DBMS – HK1 2016-2017 Exercises – Chapter 4

T1: r1(B); w1(B);

T2: r2(A); w2(A); r2(B); w2(B);

T3: r3(A);w3(A);

S1: r2(A); r1(B); w2(A); r3(A); w1(B); w3(A); r2(B); w2(B);

S2: r2(A); r1(B); w2(A); r2(B); r3(A); w1(B); w3(A); w2(B);

Ngày đăng: 29/01/2020, 14:41

TỪ KHÓA LIÊN QUAN

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN

🧩 Sản phẩm bạn có thể quan tâm