Systems Exercise Solutions — Principles Of Distributed Database

Principles of Distributed Database Systems: Concept Review & Exercise Solutions

Exercise 5.1 – Join via Bloom Filter

We can fragment the database into three fragments:

• Relation $R$ at Site 1: Size = 1000 tuples, Width = 100 bytes. Resulting tuple width after selection = 100 bytes.
• Relation $S$ at Site 2: Size = 100 tuples, Width = 50 bytes. Join attribute width = 10 bytes.
• Query: $R \bowtie S$ (Result needed at Site 1).
• Network Speed: Assume simple cost function $Cost = Volume_Transferred$.

Exercise 3.1: Centralized 2PL vs. Distributed 2PL

Allocation:

The "Materialization" of these fragments. Exercise solutions typically apply the "Locality of Reference" principle—placing data where it is most frequently accessed to minimize communication costs. Distributed Query Processing Principles of Distributed Database Systems: Concept Review &

Timestamp Ordering:

Assigning unique timestamps to transactions to ensure serializability without explicit locking. 4. Reliability and the Two-Phase Commit (2PC) Relation $R$ at Site 1: Size = 1000