which covers key concepts like the CAP theorem and ACID properties. GitHub Tech Notes
Each site manages its own locks. T1 locks A at site1. T2 locks B at site2. T1 sends lock request for B to site2 → waits. T2 sends lock request for A to site1 → waits. Deadlock is distributed. Needs timeout or probe-based detection (e.g., wait-for graph across sites). which covers key concepts like the CAP theorem
a. What is the fragmentation of R?
Ensure your solution meets three criteria: Completeness (no data lost), Reconstruction (can join/union back to the original), and Disjointness (no unnecessary duplication). 2. Distributed Query Optimization which covers key concepts like the CAP theorem
Exercises on deadlock detection typically provide a global wait-for graph or local graphs per site. which covers key concepts like the CAP theorem