Samuel Madden
Joseph M. Hellerstein
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.
- R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. In ACM SIGMOD, Dallas, TX, May 2000.]] Google Scholar
Digital Library
- 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.]]Google Scholar
- J. Chen, D. DeWitt, F. Tian, and Y. Wang. NiagaraCQ: A scalable continuous query system for internet databases. In ACM SIGMOD, 2000.]] Google ScholarDigital Library
- D. DeWitt, J. Naughton, and D. Schneider. An evaluation of non-equijoin algorithms. In VLDB, Barcelona, Spain, 1991.]] Google ScholarDigital Library
- C. Forgy. Rete: A fast algorithm for the many patterns/many objects match problem. Artificial Intelligence, 19(1):17-37, 1982.]]Google ScholarDigital Library
- 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.]]Google Scholar
- W. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive protocols for information dissemination in wireless sensor networks. In MOBICOM, Seattle, WA, August 1999.]] Google ScholarDigital Library
- 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.]]Google Scholar
- J. Hill, R. Szewczyk, A. Woo, S. Hollar, and D. C. K. Pister. System architecture directions for networked sensors. In ASPLOS, November 2000.]] Google ScholarDigital Library
- Z. G. Ives, D. Florescu, M. Friedman, A. Levy, and D. S. Weld. An adaptive query execution system for data integration. In Proceedings of the ACM SIGMOD, 1999.]] Google ScholarDigital Library
- J. M. Kahn, R. H. Katz, and K. S. J. Pister. Mobile networking for smart dust. In MOBICOM, Seattle, WA, August 1999.]] Google ScholarDigital Library
- N. Lanham. The telegraph screen scraper, 2000. http://db.cs.berkeley.edu/ nickl/tess.]]Google Scholar
- L. Liu, C. Pu, and W. Tang. Continual queries for internet-scale event-driven information delivery. IEEE Knowledge and Data Engineering, 1999. Special Issue on Web Technology.]] Google ScholarDigital Library
- S. Madden and M. Franklin. Fjording the stream: An architecture for queries over streaming sensor data. San Jose, CA, February 2002. ICDE.]]Google ScholarCross Ref
- D. P. Miranker. Treat: A better match algorithm for ai production system matching. In Proceedings of AAAI, pages 42-47, 1987.]]Google Scholar
- H. Mistry, P. Roy, S. Sudarshan, and K. Ramamritham. Materialized view selection and maintenance using multi-query optimization. In ACM SIGMOD, 2001.]] Google ScholarDigital Library
- P. Bonnet, J. Gehrke, and P. Seshadri. Towards sensor database systems. In 2nd International Conference on Mobile Data Management, Hong Kong, January 2001.]] Google ScholarDigital Library
- V. Raman. Interactive Query Processing. PhD thesis, UC Berkeley, 2001.]] Google ScholarDigital Library
- P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobe. Efficient and extensible algorithms for multi query optimization. In ACM SIGMOD, pages 249-260, 2000.]] Google ScholarDigital Library
- 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.]]Google Scholar
- T. Sellis. Multiple query optimization. ACM Transactions on Database Systems, 1986.]]Google Scholar
- P. Seshadri, M. Livny, and R. Ramakrishnan. The design and implementation of a sequence database systems. In VLDB, Mumbai, India, September 1996.]] Google ScholarDigital Library
- M. Shah, S. Madden, M. Franklin, and J. M. Hellerstein. Java support for data intensive systems. SIGMOD Record, December 2001.]] Google ScholarDigital Library
- 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.]] Google ScholarDigital Library
- D. Terry, D. Goldberg, D. Nichols, and B. Oki. Continuous queies over append-only databases. In ACM SIGMOD, pages 321-330, 1992.]] Google ScholarDigital Library
- T. Urhan and M. Franklin. XJoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin, pages 27-33, 2000 2000.]]Google Scholar
- T. Urhan, M. J. Franklin, and L. Amsaleg. Cost-based query scrambling for initial delays. In ACM SIGMOD, 1998.]] Google ScholarDigital Library
- A. Wilschut and P. Apers. Dataflow query execution in a parallel main-memory environment. In PDIS, pages 68-77, December 1991.]] Google ScholarDigital Library
Index Terms
- Continuously adaptive continuous queries over streams
Recommendations
Continuous queries over data streams
In many recent applications, data may take the form of continuous data streams, rather than finite stored data sets. Several aspects of data management need to be reconsidered in the presence of data streams, offering a new research direction for the ...
Transformation of continuous aggregation join queries over data streams
SSTD'07: Proceedings of the 10th international conference on Advances in spatial and temporal databasesWe address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join input streams. To our knowledge, the existing researches address join query ...
Adaptive Caching for Continuous Queries
ICDE '05: Proceedings of the 21st International Conference on Data EngineeringWe address the problem of executing continuous multiway join queries in unpredictable and volatile environments. Our query class captures windowed join queries in data stream systems as well as conventional maintenance of materialized join views. Our ...
Comments