Principles Of Distributed Database Systems Exercise Solutions Jun 2026

Dividing a table into smaller parts (Horizontal, Vertical, or Mixed).

Here are solutions to some common exercises in distributed database systems:

(4th Edition, 2020) by M. Tamer Özsu and Patrick Valduriez can be challenging because the authors primarily restrict full solution manuals to instructors. University of Waterloo

4. Distributed Commit and Reliability Protocols (Chapter 10 & 11) Dividing a table into smaller parts (Horizontal, Vertical,

So she closed the book. She would not follow the solution. She would extend it.

Reduce Employee at Node 1 using the received DeptID s. Assume only 10% of employees match the active departments (selectivity factor ). The reduced Employee' relation has 1,000 tuples.

Every employee tuple satisfies at least one minterm predicate. University of Waterloo 4

Consider a global relation EMP(ENO, ENAME, TITLE) and PROJ(PNO, PNAME, BUDGET) . There is a relationship relation ASG(ENO, PNO, RESPONSIBILITY, DUR) .

Can access the official manual directly through the ⁠University of Waterloo Özsu Homepage .

Relation EMPLOYEE(EID, Name, Dept, Salary) with two sites: She would extend it

To ensure atomicity (all or nothing), solutions follow a "Prepare" phase and a "Commit" phase. A coordinator asks all participants if they are ready; if even one node fails or votes "No," the entire transaction is rolled back.

Low latency. Writes return success quickly after updating a minority of nodes. Background anti-entropy protocols (gossip protocols) sync the remaining nodes over time. Summary Checklist for Exam Preparation

Each chapter contains a rich set of exercises that test both theoretical understanding and practical algorithm design.

How can a user query a table without knowing it is split across servers in New York and London?