Principles Of Distributed Database Systems Exercise Solutions [ No Survey ]

The coordinator asks participants if they are ready to commit.

Finding the best join order and communication strategy. Local Optimization: Selecting the best local access paths. Common Exercise Scenario: The coordinator asks participants if they are ready

Since the final result is needed at Site 1, we transfer the entirety of relation from Site 2 to Site 1. 000 is correct.

Distributed systems use Dependency Graphs (Wait-For Graphs) to detect local and global deadlocks. The coordinator asks participants if they are ready

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.