Query Optimization over Distributed Data Stream
ABSTRACT Recent research efforts in the fields of data stream processing show the increasing importance of processing data streams, e.g., in the e-science domain. Together with the advent of peer-to-peer (P2P) networks and grid computing, this leads to the necessity of developing new techniques for distributing and processing continuous queries over data streams in such networks. These systems often have to process multiple similar but different continuous aggregation queries simultaneously. Since executing each query separately can lead to significant scalability and performance problems, it is vital to share resources by exploiting similarities in the queries. The challenge is to identify overlapping computations that may not be obvious in the queries themselves. In this paper, we propose a novel algorithmic solution for problem of finding the minimum number of queries in such a distributed-streams setting, in order to optimize the communicate cost across the network. The experiment result show that our approach gives us as much as magnitude performance improvement over the no-share settings.
SourceAvailable from: psu.edu
Conference Paper: On-the-fly sharing for streamed aggregation.[Show abstract] [Hide abstract]
ABSTRACT: Data streaming systems are becoming essential for monitoring ap- plications such as financial analysis and network intrusion detec- tion. These systems often have to process many similar but differ- ent queries over common data. Since executing each query sepa- rately can lead to significant scalability and performance problems, it is vital to share resources by exploiting similarities in the queries. In this paper we present ways to efficiently share streaming aggre- gate queries with differing periodic windows and arbitrary selec- tion predicates. A major contribution is our sharing technique that does not require any up-front multiple query optimization. This is a significant departure from existing techniques that rely on complex static analyses of fixed query workloads. Our approach is partic- ularly vital in streaming systems where queries can join and leave the system at any point. We present a detailed performance study that evaluates our strategies with an implementation and real data. In these experiments, our approach gives us as much as an order of magnitude performance improvement over the state of the art.Proceedings of the ACM SIGMOD International Conference on Management of Data, Chicago, Illinois, USA, June 27-29, 2006; 01/2006
[Show abstract] [Hide abstract]
ABSTRACT: We present a Scalable Distributed Information Management System(SDIMS) that aggregates information about large-scale networkedsystems and that can serve as a basic building block for abroad range of large-scale distributed applications by providing detailedviews of nearby information and summary views of global information.To serve as a basic building block, a SDIMS should havefour properties: scalability to many nodes and attributes, flexibilityto accommodate a broad range of...
[Show abstract] [Hide abstract]
ABSTRACT: CQL, a Continuous Query Language, is supported by the STREAM prototype Data Stream Management System at Stanford. CQL is an expressive SQL-based declarative language for registering continuous queries against streams and updatable relations. We begin by presenting an abstract semantics that relies only on "black box" mappings among streams and relations.The VLDB Journal 03/2004; DOI:10.1007/s00778-004-0147-z · 1.70 Impact Factor