Minimizing Communication Cost in Distributed Multi-query Processing

Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in the area of distributed query processing and optimization. In this paper we address a general, distributed multiquery processing problem motivated by the need to minimize the communication cost in these environments. Specifically we address the problem of optimally sharing data movement across the communication edges in a distributed communication network given a set of overlapping queries and query plans for them (specifying the operations to be executed). Most of the problem variations of our general problem can be shown to be NP-Hard by a reduction from the Steiner tree problem. However, we show that the problem can be solved optimally if the communication network is a tree, and present a novel algorithm for finding an optimal data movement plan. For general communication networks, we present efficient ap...

• Type: Conference
• Year: 2009
• Where: ICDE
• Authors: Jian Li, Amol Deshpande, Samir Khuller
• Keywords: Database, General Communication Networks, General Problem, ICDE 2009, Multiquery Processing Problem, Problem Variations, Steiner Tree Problem