Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Network-Aware Join Processing in Global-Scale Database Federations
 

Summary: Network-Aware Join Processing in Global-Scale
Database Federations
Xiaodan Wang1, Randal Burns1, Andreas Terzis1, Amol Deshpande2
1
Johns Hopkins University, USA
{xwang,randal,terzis}@cs.jhu.edu
2
University of Maryland, USA
amol@cs.umd.edu
Abstract-- We introduce join scheduling algorithms that em-
ploy 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. We give a two-
approximate, polynomial-time algorithm for serial (left-deep) join
schedules. We also present extensions to this algorithm that ex-
plore parallel schedules, reduce resource usage, and define trade-
offs between computation and network utilization. We evaluate
these techniques within the SkyQuery federation of Astronomy
databases using spatial-join queries submitted by SkyQuery's

  

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences