|
|
|
     |
                                     |
Return to Sensor Databases
Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide area sensor databases, containing (XML) data derived from sensors spread over tens to thousands of miles. We present the first scalable system for executing XPATH queries on such databases. The system maintains the logical view of the data as a single XML document, while physically the data is fragmented across any number of host nodes. For scalability, sensor data is stored close to the sensors, but can be cached elsewhere as dictated by the queries. Our design enables self-starting distributed queries that jump directly to the lowest common ancestor of the query result, dramatically reducing query response times. We present a novel query-evaluate- gather technique (using XSLT) for detecting (1) which data in a local database fragment is part of the query result, and (2) how to gather the missing parts. We define partitioning and cache invariants that ensure that even partial matches on cached data are exploited and that correct answers are returned, despite our dynamic query-driven caching. Experimental results demonstrate that our techniques dramatically increase query throughputs and decrease query response times in wide area sensor databases.
@inproceedings {DBLP:conf/sigmod/DeshpandeNGS03, author = {Amol Deshpande and Suman Kumar Nath and Phillip B. Gibbons and Srinivasan Seshan}, booktitle = {SIGMOD Conference}, title = {Cache-and-Query for Wide Area Sensor Databases.}, pages = {503-514}, year = {2003}, url = {db/conf/sigmod/sigmod2003.html#DeshpandeNGS03}, ee = {http://www.acm.org/sigmod/sigmod03/eproceedings/papers/r18p02.pdf}, crossref = {conf/sigmod/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
