Principles Of Distributed Database Systems Exercise Solutions !link! Site

: Always compare total cost of semi-join + reduced tuple transfer vs. naive transfer. Semi-join wins when join selectivity is low.

If hash partitioning already aligned with join site: Each tuple of R and S sent exactly once to join site → cost = 10,000 + 50,000 = 60,000.

Comparing Semi-join strategies versus Broadcast join strategies to move the least amount of data over the network. Formulae to Remember: : Always compare total cost of semi-join +

Understanding the role of the Coordinator and Participants during the "Voting" and "Decision" phases.

(using affinity matrices). The goal is to minimize irrelevant data access. Query Decomposition & Optimization: If hash partitioning already aligned with join site:

Better is to perform parallel hash join: each site joins locally on its own bucket after exchanging only needed buckets (cost = same total data volume). So 60,000 is correct.

The authors provide companion websites for the latest editions. While these sites host presentation slides and errata for public download, full exercise solutions require instructor registration and evidence of course adoption. University of Waterloo 4th Edition Companion Site 3rd Edition Companion Site University of Waterloo 2. Available Public Study Resources (using affinity matrices)

Here is a breakdown of the core principles typically covered in those exercises, along with how to find specific solutions: Key Principles Covered in Exercises

Horizontal fragmentation partitions a relation into subsets of tuples based on a predicate.