Adaptive caching for continuous queries

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 118-129

  Babu, Shivnath ^a   Munagala, Kamesh ^b   Widom, Jennifer ^a   Motwani, Rajeev ^a  

^a STANFORD UNIVERSITY   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE CACHING; DATA CHARACTERISTICS; DATA STREAM MANAGEMENT SYSTEMS;

ALGORITHMS; BUFFER STORAGE; DATABASE SYSTEMS; PROBLEM SOLVING; QUERY LANGUAGES; STORAGE ALLOCATION (COMPUTER);

ADAPTIVE SYSTEMS;

EID: 28444460209     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.15     Document Type: Conference Paper

References (29)

1. A. Arasu, S. Babu, and J. Widom. An abstract semantics and concrete language for continuous queries over streams and relations. VLDB Journal. (To appear).
2. R. Avnur and J. Hellerstein. Eddies: Continuously adaptive query processing. In Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data, pages 261-272, May 2000.
3. S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom. Adaptive ordering of pipelined stream filters. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, pages 407-418, June 2004.
4. S. Babu, K. Munagala, J. Widom, and R. Motwani. Adaptive caching for continuous queries. Technical Report available at http://dbpubs.stanford.edu/ pub/2004-14, Stanford University, Mar. 2004.
5. S. Babu and J. Widom. StreaMon: An adaptive engine for stream query processing. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004. Demonstration proposal.
6. B. Bloom. Space/time tradeoffs in hash coding with allowable errors. Communications of the ACM, 13(7):422-426, 1970.
7. N. Bruno and S. Chaudhuri. Exploiting statistics on query expressions for optimization. In Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data, pages 263-274, June 2002.
8. D. Carney et al. Monitoring streams-a new class of data management applications. In Proc. of the 2002 Intl. Conf. on Very Large Data Bases, Aug. 2002.
9. S. Chandrasekaran et al. TelegraphCQ: Continuous dataflow processing for an uncertain world. In Proc. First Biennial Conf. on Innovative Data Systems Research, Jan. 2003.
10. A. Deshpande and J. Hellerstein. Lifting the burden of history from adpative query processing. In Proc. of the 2004 Intl. Conf. on Very Large Data Bases, Aug. 2004.
11. L. Golab and T. Ozsu. Processing sliding window multi-joins in continuous queries over data streams. In Proc. of the 2003 Intl. Conf. on Very Large Data Bases, Sept. 2003.
12. J. Hellerstein and J. Naughton. Query execution techniques for caching expensive methods. In Proc. of the 1996 ACM SIGMOD Intl. Conf. on Management of Data, pages 423-434, June 1996.
13. D. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA, 1997.
14. Z. Ives. Efficient Query Processing for Data Integration. PhD thesis, University of Washington, Seattle, WA, USA, Aug. 2002.
15. N. Kabra and D. DeWitt. Efficient mid-query re-optimization of sub-optimal query execution plans. In Proc. of the 1998 ACM SIGMOD Intl. Conf. on Management of Data, pages 106-117, June 1998.
16. J. Kang, J. Naughton, and S. Viglas. Evaluating window joins over unbounded streams. In Proc. of the 2003 Intl. Conf. on Data Engineering, Mar. 2003.
17. W. Labio, J. Yang, Y. Cui, H. Garcia-Molina, and J. Widom. Performance issues in incremental warehouse maintenance. In Proc. of the 2000 Intl. Conf. on Very Large Data Bases, pages 461-472, Aug. 2000.
18. V. Markl, V. Raman, D. Simmen, G. Lohman, and H. Pirahesh. Robust query processing through progressive optimization. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, pages 659-670, June 2004.
19. R. Motwani, J. Widom, et al. Query processing, approximation, and resource management in a data stream management system. In Proc. First Biennial Conf. on Innovative Data Systems Research (CIDR), Jan. 2003.
20. D. Quass, A. Gupta, I. S. Mumick, and J. Widom. Making views self-maintainable for data warehousing. In Proc. of the 1996 Intl. Conf. on Parallel and Distributed Information Systems, pages 158-169, Dec. 1996.
21. V. Raman, A. Deshpande, and J. Hellerstein. Using state modules for adaptive query processing. In Proc. of the 2003 Intl. Conf. on Data Engineering, Mar. 2003.
22. K. Ross, D. Srivastava, and S. Sudarshan. Materialized view maintenance and integrity constraint checking: Trading space for time. In Proc. of the 1996 ACM SIGMOD Intl. Conf. on Management of Data, pages 447-458, June 1996.
23. N. Roussopoulos. View indexing in relational databases. ACM Trans. on Database Systems, 7(2):258-290, 1982.
24. N. Roussopoulos. An incremental access method for View-Cache: Concept, algorithms, and cost analysis. ACM Trans. on Database Systems, 16(3):535-563, 1991.
25. M. Stillger, G. Lohman, V. Markl, and M. Kandil. LEO - DB2's LEarning Optimizer. In Proc. of the 2001 Intl. Conf. on Very Large Data Bases, pages 9-28, Sept. 2001.
26. T. Urhan and M. J. Franklin. Xjoin: A reactively-scheduled pipelined join operator. IEEE Data Engineering Bulletin, 23(2):27-33, June 2000.
27. T. Urhan, M. J. Franklin, and L. Amsaleg. Cost based query scrambling for initial delays. In Proc. of the 1998 ACM SIGMOD Intl. Conf. on Management of Data, pages 130-141, June 1998.
28. S. Viglas, J. Naughton, and J. Burger. Maximizing the output rate of multi-join queries over streaming information sources. In Proc. of the 2003 Intl. Conf. on Very Large Data Bases, Sept. 2003.
29. Y. Zhu, E. Rundensteiner, and G. Heineman. Dynamic plan migration for continuous queries over data streams. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, pages 431-442, June 2004.