Principles of database buffer management
ACM Transactions on Database Systems (TODS)
Computational geometry: an introduction
Computational geometry: an introduction
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A generic solution to polygon clipping
Communications of the ACM
Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
Discrete & Computational Geometry
Cache investment: integrating query optimization and distributed data placement
ACM Transactions on Database Systems (TODS)
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Semantic Data Caching and Replacement
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Cache-and-query for wide area sensor databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Habitat monitoring with sensor networks
Communications of the ACM - Wireless sensor networks
Security in wireless sensor networks
Communications of the ACM - Wireless sensor networks
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Energy-conserving data cache placement in sensor networks
ACM Transactions on Sensor Networks (TOSN)
An efficient algorithm for partitioning parameterized polygons into rectangles
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Energy-efficient monitoring of extreme values in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Effective Caching in Wireless Sensor Network
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
Adaptive processing of historical spatial range queries in peer-to-peer sensor networks
Distributed and Parallel Databases
Comprehensive Optimization of Declarative Sensor Network Queries
SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
In-network data acquisition and replication in mobile sensor networks
Distributed and Parallel Databases
| Hi-index | 0.00 |
Most models for Wireless Sensor Networks (WSNs) assume the existence of a base station where query results could in principle be cached, however, the opportunity for re-using such cached data for minimizing data traffic in the WSN has not been well explored thus far. Aiming at filling this gap, we propose an approach that first clips the original query into a polygon after selectively choosing a good subset of the cached queries for reuse. Next, this polygon is partitioned into sub-queries that are then submitted to the WSN. These two problems are interconnected and lead to a highly combinatorial problem that justifies the use of efficient and effective heuristics. This paper presents algorithms for each of these problems that are used within a cost-driven optimization search in order to find a set of sub-queries that minimizes the cost of in-network query processing. Experimental results show that our heuristic solution is orders of magnitude faster than an exhaustive search, and yields no more than 10% loss compared to the optimal query processing.