Efficient and adaptive processing of multiple continuous queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2287, Issue , 2002, Pages 215-232

  Tok, Wee Hyong ^a   Bressan, Stéphane ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; QUERY LANGUAGES;

ADAPTIVE PROCESSING; CONTINUOUS QUERIES; DATA CHARACTERISTICS; INTER-ARRIVAL TIME; INTERMEDIATE RESULTS; MULTIPLE QUERIES; QUERY PERFORMANCE; QUERY RESPONSE TIME;

QUERY PROCESSING;

EID: 84883764744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. Mehmet Altinel and Michael J. Franklin. Efficient filtering of XML documents for selective dissemination of information. In The VLDB Journal, pages 53-64, 2000.
2. Laurent Amsaleg, Michael J. Franklin, and Anthony Tomasic. Dynamic query operator scheduling for wide-area remote access. Distributed and Parallel Databases, 6(3):217-246, 1998.
3. Laurent Amsaleg, Michael J. Franklin, Anthony Tomasic, and Tolga Urhan. Scrambling query plans to cope with unexpected delays. In PDIS, pages 208-219, 1996.
4. Ron Avnur and Joseph M. Hellerstein. Eddies: Continuously adaptive query processing. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 261-272, May 2000.
5. Philippe Bonnet, Johannes Gehrke, and Praveen Seshadri. Towards sensor database systems. In Proceedings of Mobile Data Management, Second International Conference, MDM 2001, Hong Kong, China, January 2001.
6. Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Potamianos, and Kyuseak Shim. Optimizing queries with materialized views. In 11th Int. Conference on Data Engineering, pages 190-200, Los Alamitos, CA, 1995. IEEE Computer Soc. Press.
7. C. Chen and N. Roussopoulos. The implementation and performance evaluation of the adms query optimizer: Integrating query result caching and matching, 1994.
8. Jianjun Chen, David J. DeWitt, Feng Tian, and Yuan Wang. NiagaraCQ: a scalable continuous query system for Internet databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 379-390, 2000.
9. E. N. Hanson, C. Carnes, L. Huang, M. Konyala, L. Noronha, S. Parthasarathy, J. B. Park, and A. Vernon. Scalable Trigger Processing. In Proceedings of the 15th International Conference on Data Engineering, pages 266-275. IEEE Computer Society Press, 1999.
10. Donald Kossmann, Michael J. Franklin, Gerhard Drasch, and Wig Ag. Cache investment: Integrating query optimization and distributed data placement. ACM Transactions on Database Systems (TODS), 25(4), December 2000.
11. Ling Liu, Calton Pu, and Wei Tang. Continual queries for internet scale eventdriven information delivery. Knowledge and Data Engineering, 11(4):610-628, 1999.
12. Prasan Roy, S. Seshadri, S. Sudarshan, and Siddhesh Bhobe. Efficient and extensible algorithms for multi query optimization. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 249-260, 2000.
13. Timos K. Sellis. Multiple query optimization. ACM Transactions on Database Systems (TODS), 13(1):23-52, March 1988.
14. J. Shim, P. Scheuermann, and R. Vingralek. Dynamic caching of query results for decision support systems, 1999.
15. Kian Lee Tan, Shen Tat Goh, and Beng Chin Ooi. Cache-on-demand: Recycling with certainty. In International Conference on Data Engineering, April 2001.
16. Douglas Terry, David Goldberg, David Nichols, and Brian Oki. Continuous queries over append-only databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 321-330, June 1992.
17. Tolga Urhan and Michael J. Franklin. XJoin: Getting fast answers from slow and bursty networks. Technical Report CS-TR-3994, University of Maryland, February 1999, 1999.
18. Tolga Urhan, Michael J. Franklin, and Laurent Amsaleg. Cost-based query scrambling for initial delays. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 130-141, 1998