Multi-join continuous query optimization: Covering the spectrum of linear, acyclic, and cyclic queries

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

Volumn 5588 LNCS, Issue , 2009, Pages 91-106

  Raghavan, Venkatesh ^a   Zhu, Yali ^a   Rundensteiner, Elke A ^a   Dougherty, Daniel ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS QUERIES; EXPERIMENTAL STUDIES; EXPONENTIAL TIME COMPLEXITY; HEURISTIC TECHNIQUES; MULTI-JOIN; NP COMPLETE; OPTIMAL PLAN; OPTIMIZATION ALGORITHMS; OPTIMIZERS; POLYNOMIAL-TIME; STATE-OF-THE-ART ALGORITHMS; STREAM APPLICATION;

ALGORITHMS; DATABASE SYSTEMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

OPTIMIZATION;

EID: 70350628685     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02843-4_11     Document Type: Conference Paper

References (25)

1. Selinger, P.G., Astrahan, M.M., Chamberlin, D.D., Lorie, R.A., Price, T.G.: Access path selection in a relational database management system. In: SIGMOD, pp. 23-34 (1979)
2. Vance, B., Maier, D.: Rapid bushy join-order optimization with cartesian products. In: SIGMOD, pp. 35-46 (1996)
3. Kossmann, D., Stocker, K.: Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst. 25(1), 43-82 (2000)
4. Moerkotte, G., Neumann, T.: Dynamic programming strikes back. In: SIGMOD, pp. 539-552 (2008)
5. Ibaraki, T., Kameda, T.: On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst. 9(3), 482-502 (1984)
6. Swami, A.N., Iyer, B.R.: A polynomial time algorithm for optimizing join queries. In: ICDE, pp. 345-354 (1993)
7. Ioannidis, Y.E., Kang, Y.C.: Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization. In: SIGMOD, pp. 168-177 (1991)
8. Abadi, D.J., Ahmad, Y., Balazinska, M., Çetintemel, U., Cherniack, M., Hwang, J.H., Lindner, W., Maskey, A., Rasin, A., Ryvkina, E., Tatbul, N., Xing, Y., Zdonik, S.B.: The design of the borealis stream processing engine. In: CIDR, pp. 277-289 (2005)
9. Ali, M.H., Aref, W.G., Bose, R., Elmagarmid, A.K., Helal, A., Kamel, I., Mokbel, M.F.: Nile-pdt: A phenomenon detection and tracking framework for data stream management systems. In: VLDB, pp. 1295-1298 (2005)
10. Rundensteiner, E.A., Ding, L., Sutherland, T.M., Zhu, Y., Pielech, B., Mehta, N.: Cape: Continuous query engine with heterogeneous-grained adaptivity. In: VLDB, pp. 1353-1356 (2004)
11. Madden, S., Shah, M.A., Hellerstein, J.M., Raman, V.: Continuously adaptive continuous queries over streams. In: SIGMOD, pp. 49-60 (2002)
12. Ayad, A., Naughton, J.F.: Static optimization of conjunctive queries with sliding windows over infinite streams. In: SIGMOD, pp. 419-430 (2004)
13. Arasu, A., Babcock, B., Babu, S., Datar, M., Ito, K., Nishizawa, I., Rosenstein, J., Widom, J.: Stream: The Stanford stream data manager. In: SIGMOD Conference, vol. 665 (2003)
14. Chandrasekaran, S., Cooper, O., Deshpande, A., Franklin, M.J., Hellerstein, J.M., Hong, W., Krishnamurthy, S., Madden, S., Raman, V., Reiss, F., Shah, M.A.: Telegraphcq: Continuous dataflow processing for an uncertain world. In: CIDR (2003)
15. Babu, S., Motwani, R., Munagala, K., Nishizawa, I., Widom, J.: Adaptive ordering of pipelined stream filters. In: SIGMOD, pp. 407-418 (2004)
16. Zhu, Y., Rundensteiner, E.A., Heineman, G.T.: Dynamic plan migration for continuous queries over data streams. In: SIGMOD, pp. 431-442 (2004)
17. Bukowski, R., Peacock, R., Averill, J., Cleary, T., Bryner, N., Walton, W., Reneke, P., Kuligowski, E.: Performance of Home Smoke Alarms: Analysis of the Response of Several Available Technologies in Residential Fire Settings. NIST Technical Note 1455, 396 (2000)
18. Viglas, S., Naughton, J.F., Burger, J.: Maximizing the output rate of multi-way join queries over streaming information sources. In: VLDB, pp. 285-296 (2003)
19. Golab, L., Özsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: VLDB, pp. 500-511 (2003)
20. Kang, J., Naughton, J.F., Viglas, S.: Evaluating window joins over unbounded streams. In: ICDE, pp. 341-352 (2003)
21. Hammad, M.A., Franklin, M.J., Aref, W.G., Elmagarmid, A.K.: Scheduling for shared window joins over data streams. In: VLDB, pp. 297-308 (2003)
22. Ganguly, S., Hasan, W., Krishnamurthy, R.: Query optimization for parallel execution. In: SIGMOD, pp. 9-18 (1992)
23. Jain, N., Amini, L., Andrade, H., King, R., Park, Y., Selo, P., Venkatramani, C.: Design, implementation, and evaluation of the linear road benchmark on the stream processing core. In: SIGMOD, pp. 431-442 (2006)
24. Tao, Y., Yiu, M.L., Papadias, D., Hadjieleftheriou, M., Mamoulis, N.: Rpj: Producing fast join results on streams through rate-based optimization. In: SIGMOD, pp. 371-382 (2005)
25. Krishnamurthy, R., Boral, H., Zaniolo, C.: Optimization of nonrecursive queries. In: VLDB, pp. 128-137 (1986)