The design of an acquisitional query processor for sensor networks
Top Cited Papers
- 9 June 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 491-502
- https://doi.org/10.1145/872757.872817
Abstract
We discuss the design of an acquisitional query processor for data collection in sensor networks. Acquisitional issues are those that pertain to where, when, and how often data is physically acquired (sampled) and delivered to query processing operators. By focusing on the locations and costs of acquiring data, we are able to significantly reduce power consumption over traditional passive systems that assume the a priori existence of data. We discuss simple extensions to SQL for controlling data acquisition, and show how acquisitional issues influence query optimization, dissemination, and execution. We evaluate these issues in the context of TinyDB, a distributed query processor for smart sensor devices, and show how acquisitional techniques can provide significant reductions in power consumption on our sensor devices.Keywords
This publication has 25 references indexed in Scilit:
- Fjording the stream: an architecture for queries over streaming sensor dataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The cougar approach to in-network query processing in sensor networksACM SIGMOD Record, 2002
- The state of the art in distributed query processingACM Computing Surveys, 2000
- Online dynamic reorderingThe VLDB Journal, 2000
- Wireless integrated network sensorsCommunications of the ACM, 2000
- Continual queries for Internet scale event-driven information deliveryIEEE Transactions on Knowledge and Data Engineering, 1999
- Optimization techniques for queries with expensive methodsACM Transactions on Database Systems, 1998
- The design and implementation of the Ariel active database rule systemIEEE Transactions on Knowledge and Data Engineering, 1996
- Database system issues in nomadic computingPublished by Association for Computing Machinery (ACM) ,1993
- On the optimal nesting order for computing N -relational joinsACM Transactions on Database Systems, 1984