.png){kind=icon}
.png){kind=icon}
Return
A Distributed Stream Query Optimization Framework through Integrated Planning and Deployment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2008.232.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the problem of optimizing multiple distributed stream queries that are executing simultaneously in distributed data stream systems. We argue that the static query optimization approach of plan, then deployment is inadequate for handling distributed queries involving multiple streams and node dynamics faced in distributed data stream systems and applications. Thus, the selection of an optimal execution plan in such dynamic and networked computing systems must consider operator ordering, reuse, network placement, and search space reduction. We propose to use hierarchical network partitions to exploit various opportunities for operator-level reuse while utilizing network characteristics to maintain a manageable search space during query planning and deployment. We develop top-down, bottom-up, and hybrid algorithms for exploiting operator-level reuse through hierarchical network partitions. Formal analysis is presented to establish the bounds on the search space and suboptimality of our algorithms. We have implemented our algorithms in the IFLOW [1] system, an adaptive distributed stream management system. Through simulations and experiments using a prototype deployed on Emulab [2], we demonstrate the effectiveness of our framework and our algorithms.
Keywords:
Computer-communication networks
distributed systems
distributed databases
distributed applications
database management
systems
query processing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
View more organizations