ACM Home Page
Please provide us with feedback. Feedback
Cache-and-query for wide area sensor databases
Full text PdfPdf (231 KB)
Source International Conference on Management of Data archive
Proceedings of the 2003 ACM SIGMOD international conference on Management of data table of contents
San Diego, California
SESSION: Sensor databases table of contents
Pages: 503 - 514  
Year of Publication: 2003
ISBN:1-58113-634-X
Authors
Amol Deshpande  U.C. Berkeley & Intel Research Pittsburgh
Suman Nath  Carnegie Mellon University & Intel Research Pittsburgh
Phillip B. Gibbons  Intel Research Pittsburgh
Srinivasan Seshan  Carnegie Mellon University & Intel Research Pittsburgh
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 62,   Citation Count: 26
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/872757.872818
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Apache Xindice Database. http://www.dbxml.org.
 
2
Xalan-Java. http://xml.apache.org/xalan-j.
 
3
 
4
5
6
 
7
 
8
M. J. Carey et al. XPERANTO: Publishing object-relational data as XML. In WebDB, 2000.
 
9
D. Carney et al. Monitoring streams - A new class of data management applications. In VLDB, 2002.
 
10
S. Chandrasekaran et al. TelegraphCQ: Continuous dataflow processing for an uncertain world. In CIDR, 2003.
 
11
12
 
13
M. Franklin and M. Carey. Client-server caching revisited. In International Workshop on Distributed Object Management, 1992.
14
15
 
16
S. Gribble, A. Halevy, Z. Ives, M. Rodrig, and D. Suciu. What can databases do for peer-to-peer. In WebDB, 2001.
 
17
18
19
 
20
21
 
22
S. Madden and M. J. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. In ICDE, 2002.
23
24
 
25
R. Motwani et al. Query processing, approximation, and resource management in a data stream management system. In CIDR, 2003.
26
27
 
28
 
29
30
 
31
 
32
B. W. Wah. File placement on distributed computer systems. IEEE Computer, 17(1), 1984.
 
33
M. Wahl, T. Howes, and S. Kille. Lightweight Directory Access Protocol (v3). Tech report, IETF, RFC 2251, 1997.

CITED BY  26

Collaborative Colleagues:
Amol Deshpande: colleagues
Suman Nath: colleagues
Phillip B. Gibbons: colleagues
Srinivasan Seshan: colleagues