ACM Home Page
Please provide us with feedback. Feedback
Adaptive filters for continuous queries over distributed data streams
Full text PdfPdf (244 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: Monitoring data streams table of contents
Pages: 563 - 574  
Year of Publication: 2003
ISBN:1-58113-634-X
Authors
Chris Olston  Stanford University
Jing Jiang  Stanford University
Jennifer Widom  Stanford University
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 150,   Citation Count: 61
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.872825
What is a DOI?

ABSTRACT

We consider an environment where distributed data sources continuously stream updates to a centralized processor that monitors continuous queries over the distributed data. Significant communication overhead is incurred in the presence of rapid update streams, and we propose a new technique for reducing the overhead. Users register continuous queries with precision requirements at the central stream processor, which installs filters at remote data sources. The filters adapt to changing conditions to minimize stream rates while guaranteeing that all continuous queries still receive the updates necessary to provide answers of adequate precision at all times. Our approach enables applications to trade precision for communication overhead at a fine granularity by individually adjusting the precision constraints of continuous queries over streams in a multi-query workload. Through experiments performed on synthetic data simulations and a real network monitoring implementation, we demonstrate the effectiveness of our approach in achieving low communication overhead compared with alternate approaches.


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
2
 
3
 
4
P. A. Bernstein, B. T. Blaustein, and E. M. Clarke. Fast maintenance of semantic integrity assertions using redundant aggregate data. In Proc. VLDB, 1980.
 
5
D. Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, and S. Zdonik. Monitoring streams - a new class of data management applications. In Proc. VLDB, 2002.
6
 
7
M. Dilman and D. Raz. Efficient reactive monitoring. In Proc. InfoCom, 2001.
 
8
D. Estrin, L. Girod, G. Pottie, and M. Srivastava. Instrumenting the world with wireless sensor networks. In Proc. International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2001.
9
 
10
A. Householder, A. Manion, L. Pesante, and G. Weaver. Managing the threat of denial-of-service attacks. Technical report, CMU Software Engineering Institute CERT Coordination Center, Oct. 2001. http://www.cert.org/archive/pdf/ Managing DoS.pdf.
 
11
12
13
 
14
C. T. Lawrence, J. L. Zhou, and A. L. Tits. User's guide for CFSQP version 2.5. Technical report TR-94-16r1, Institute for Systems Research, University of Maryland, 1997.
 
15
 
16
 
17
S. Madden and M. J. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. In Proc. ICDE, 2002.
18
 
19
D. L. Mills. Internet time synchronization: the network time protocol. IEEE Transactions on Communications, 39(10), 1991.
 
20
 
21
 
22
R. Motwani, J. Widom, A. Arasu, B. Babcock, S. Babu, M. Datar, G. Manku, C. Olston, J. Rosenstein, and R. Varma. Query processing, resource management, and approximation in a data stream management system. In Proc. First Biennial Conference on Innovative Data Systems Research (CIDR), 2003.
 
23
C. Olston, J. Jiang, and J. Widom. Adaptive filters for continuous queries over distributed data streams. Technical report, Stanford University Computer Science Department, 2002. http://dbpubs.stanford.edu/pub/2002-55.
24
 
25
26
 
27
28
 
29
S. Shah, A. Bernard, V. Sharma, K. Ramamritham, and P. Shenoy. Maintaining temporal coherency of cooperating dynamic data repositories. In Proc. VLDB, 2002.
 
30
T. Skalicky. Laspack reference manual, 1996. http://www.tudresden.de/mwism/skalicky/laspack/laspack.html.
31
 
32
R. van Renesse and K. Birman. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. Technical report, Cornell University, 2001.
 
33
S. Vutukury and J. Garcia-Luna-Aceves. A traffic engineering approach based on minimum-delay routing. In Proc. IEEE International Conference on Computer Communications and Networks, 2000.
 
34
 
35
 
36

CITED BY  61

Collaborative Colleagues:
Chris Olston: colleagues
Jing Jiang: colleagues
Jennifer Widom: colleagues