ACM Home Page
Please provide us with feedback. Feedback
Continuously adaptive continuous queries over streams
Full text PdfPdf (1.59 MB)
Source International Conference on Management of Data archive
Proceedings of the 2002 ACM SIGMOD international conference on Management of data table of contents
Madison, Wisconsin
SESSION: Research sessions: continuous queries and streams table of contents
Pages: 49 - 60  
Year of Publication: 2002
ISBN:1-58113-497-5
Authors
Samuel Madden  UC Berkeley
Mehul Shah  UC Berkeley
Joseph M. Hellerstein  UC Berkeley
Vijayshankar Raman  IBM Almaden Research Center
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 109,   Citation Count: 121
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/564691.564698
What is a DOI?

ABSTRACT

We present a continuously adaptive, continuous query (CACQ) implementation based on the eddy query processing framework. We show that our design provides significant performance benefits over existing approaches to evaluating continuous queries, not only because of its adaptivity, but also because of the aggressive cross-query sharing of work and space that it enables. By breaking the abstraction of shared relational algebra expressions, our Telegraph CACQ implementation is able to share physical operators --- both selections and join state --- at a very fine grain. We augment these features with a grouped-filter index to simultaneously evaluate multiple selection predicates. We include measurements of the performance of our core system, along with a comparison to existing continuous query 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
J. Chen, D. DeWitt, and J. Naughton. Design and evaluation of alternative selection placement strategies in optimizing continuous queries. In ICDE, San Jose, CA, February 2002.
3
 
4
 
5
C. Forgy. Rete: A fast algorithm for the many patterns/many objects match problem. Artificial Intelligence, 19(1):17-37, 1982.
 
6
E. Hanson, N. A. Fayoumi, C. Carnes, M. Kandil, H. Liu, M. Lu, J. Park, and A. Vernon. TriggerMan: An Asynchronous Trigger Processor as an Extension to an Object-Relational DBMS. Technical Report 97-024, University of Florida, December 1997.
7
 
8
J. M. Hellerstein, M. J. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, and M. Shah. Adaptive query processing: Technology in evolution. IEEE Data Engineering Bulletin, 23(2):7-18, 2000.
9
10
11
 
12
N. Lanham. The telegraph screen scraper, 2000. http://db.cs.berkeley.edu/ nickl/tess.
 
13
 
14
S. Madden and M. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. San Jose, CA, February 2002. ICDE.
 
15
D. P. Miranker. Treat: A better match algorithm for ai production system matching. In Proceedings of AAAI, pages 42-47, 1987.
16
 
17
 
18
19
 
20
P. Selinger, M. Astrahan, D. Chamberlin, R. Lorie, and T. Price. Access path selection in a relational database management system. pages 23-34, Boston, MA, 1979.
 
21
T. Sellis. Multiple query optimization. ACM Transactions on Database Systems, 1986.
 
22
23
 
24
M. Sullivan and A. Heybey. Tribeca: A system for managing large databases of network traffic. In Proceedings of the USENIX Annual Technical Conference, New Orleans, LA, June 1998.
25
 
26
T. Urhan and M. Franklin. XJoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin, pages 27-33, 2000 2000.
27
 
28

CITED BY  121

Collaborative Colleagues:
Samuel Madden: colleagues
Mehul Shah: colleagues
Joseph M. Hellerstein: colleagues
Vijayshankar Raman: colleagues