Data Management

Network-Aware Join Processing in Global-Scale Database Federations

Free registration required

Executive Summary

The authors introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation. This metric allows algorithms to exploit excess capacity in the network, while avoiding narrow, long-haul paths. They give a two-approximate, polynomial-time algorithm for serial (left-deep) join schedules. The authors also present extensions to this algorithm that explore parallel schedules, reduce resource usage, and define tradeoffs between computation and network utilization

  • Format: PDF
  • Size: 270.4 KB