document: Optimized query planning of continuous aggregation queries in dynamic data dissemination networks Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making . Typically a user desires to obtain the value of some aggregation function over distributed data items , for example , to know ( a ) the average of temperatures sensed by a set of sensors ( b ) the value of index of mid-cap stocks . In these queries a client specifies a coherency requirement as part of the query . In this paper we present a low-cost , scalable technique to answer continuous aggregation queries using a content distribution network of dynamic data items . In such a network of data aggregators , each data aggregator serves a set of data items at specific coherencies . Just as various fragments of a dynamic web-page are served by one or more nodes of a content distribution network , our technique involves decomposing a client query into sub-queries and executing sub-queries on judiciously chosen data aggregators with their individual sub-query incoherency bounds . We provide a technique of getting the optimal query plan ( i.e. , set of sub-queries and their chosen data aggregators ) which satisfies client query . s coherency requirement with least cost , measured in terms of the number of refresh messages sent from aggregators to the client . For estimating query execution cost , we build a continuous query cost model which can be used to estimate the number of messages required to satisfy the client specified incoherency bound . Performance results using real-world traces show that our cost based query planning leads to queries being executed using less than one third the number of messages required by existing schemes .
doc_bio_tags: O O O O B I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O