Principles Of Distributed Database Systems Exercise Solutions Access

: Fragment F1: 100 queries from site A, 10 from B, 0 from C. Updates: 5 from A, 20 from B, 0 from C. Cost of remote read=1, remote write=10. Local read=0, local write=0 (costs). Find allocation.

Problem: Given a global schema and specific site queries, determine the optimal fragments. : Fragment F1: 100 queries from site A, 10 from B, 0 from C

: Draw each local graph. Then combine vertices and edges. A cycle that spans multiple sites is still a deadlock. Use edge chasing algorithms (like the Chandy-Misra-Haas algorithm) as an advanced topic solution. 10 from B

We can fragment the Orders relation based on the Order_Date attribute: 20 from B