A distributed system for answering range queries on sensor network data

A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query answering. Each node of the system stores either detailed or summarized sensor readings. Query answers are computed by identifying the set of nodes that contain (either compressed or not) data involved in the query, and eventually partitioning the query in a set of sub-queries to be evaluated at different nodes. Queries are partitioned according to a cost model aiming at making the evaluation efficient and guaranteeing the desired degree of accuracy of query answers.

[1]  Philippe Bonnet,et al.  Towards Sensor Database Systems , 2001, Mobile Data Management.

[2]  Wolfgang Lehner,et al.  Querying Asynchronously Updated Sensor Data Sets under Quantified Constraints , 2004 .

[3]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[4]  Ian T. Foster,et al.  The anatomy of the grid: enabling scalable virtual organizations , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[5]  Helen J. Wang,et al.  Online aggregation , 1997, SIGMOD '97.

[6]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[7]  Sudipto Guha,et al.  Data-streams and histograms , 2001, STOC '01.

[8]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[9]  Elio Masciari,et al.  Approximate Query Answering on Sensor Network Data Streams , 2003, SEBD.