Mining the data using aggregator from the dynamic web page

Abstract

Typically a user wishes to acquire the value of some aggregation gathering over distributed data items, for example, to know value of collection for a client; or the AVG of temperatures sensed by a set of sensors. In these queries a client specifies a coherency condition as part of the query. We present a inexpensive, scalable technique to answer constant aggregation queries using a set of connections of aggregators of active data items. In such a network of records aggregators, each data aggregator serves a set of data items at exact coherencies. Just as various garbage of a active web-page are served by one or more nodes of a content sharing network, our system involves decayed a client query into sub-queries and executing sub-queries on sensibly chosen data aggregators with their individual sub-query incoherency limits. We provide a procedure for getting the best possible set of sub-queries with their incoherency bounds which satisfies customer query’s coherency requirement with slightest number of energize messages sent from aggregators to the client. For estimating the number of refresh messages, we build a query cost model which can be used to guesstimate the number of statement required to satisfy the client specified incoherency hurdle. feat results using real-world traces show that our cost based query progress leads to queries being executed using fewer than one third the number of messages required by offered schemes.