A new look at generating multi-join continuous query plans: A qualified plan generation problem

Data and Knowledge Engineering

Volumn 69, Issue 5, 2010, Pages 424-443

  Zhu, Yali ^a   Raghavan, Venkatesh ^b   Rundensteiner, Elke A ^b  

^a ORACLE CORPORATION   (United States)

^b Worcester Polytechnic Institute   (United States)

Author keywords

Continuous queries; Multi constraint query optimization; Streaming databases

Indexed keywords

CONTINUOUS ALGORITHMS; CONTINUOUS QUERIES; EXPERIMENTAL STUDIES; EXPONENTIAL TIME COMPLEXITY; MEMORY RESOURCES; MEMORY USAGE; MULTI-CONSTRAINTS; MULTI-JOIN; NEGATIVE CORRELATION; OPTIMAL QUERY; OPTIMIZERS; PLAN GENERATION; POLYNOMIAL-TIME ALGORITHMS; POSITIVE CORRELATIONS; QUERY OPTIMIZATION; REAL-TIME RESPONSE; RESOURCE USAGE; RUNTIME OPTIMIZATION; SEARCH SPACES; SECOND LAYER; STREAM ENVIRONMENT; STREAM PROCESSING; SYSTEM CAPACITY; TWO LAYERS;

ALGORITHMS; BINARY TREES; HYDRAULICS; MATHEMATICAL OPERATORS; OPTIMIZATION;

DYNAMIC PROGRAMMING;

EID: 77949492722     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.11.001     Document Type: Article

References (41)

1. Ibaraki T., and Kameda T. On the optimal nesting order for computing n-relational joins. TODS 9 3 (1984) 482-502
2. P.G. Selinger, M.M. Astrahan, D.D. Chamberlin, R.A. Lorie, T.G. Price, Access path selection in a relational database management system, in: SIGMOD, 1979, pp. 23-34.
3. A.N. Swami, B.R. Iyer, A polynomial time algorithm for optimizing join queries, in: ICDE, 1993, pp. 345-354.
4. Y.E. Ioannidis, Y.C. Kang, Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization, in: SIGMOD, 1991, pp. 168-177.
5. Kossmann D., and Stocker K. Iterative dynamic programming: a new class of query optimization algorithms. TODS 25 1 (2000) 43-82
6. Steinbrunn M., Moerkotte G., and Kemper A. Heuristic and randomized optimization for the join ordering problem. VLDB J. 6 3 (1997) 191-208
7. S. Madden, M.A. Shah, J.M. Hellerstein, V. Raman, Continuously adaptive continuous queries over streams, in: SIGMOD, 2002, pp. 49-60.
8. D. Carney, U. Çetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, S.B. Zdonik, Monitoring streams - a new class of data management applications, in: VLDB, 2002, pp. 215-226.
9. S. Viglas, J.F. Naughton, J. Burger, Maximizing the output rate of multi-way join queries over streaming information sources, in: VLDB, 2003, pp. 285-296.
10. A. Ayad, J.F. Naughton, Static optimization of conjunctive queries with sliding windows over infinite streams, in: SIGMOD, 2004, pp. 419-430.
11. B. Liu, Y. Zhu, E.A. Rundensteiner, Run-time operator state spilling for memory intensive long-running queries, in: SIGMOD, 2006, pp. 347-358.
12. Urhan T., and Franklin M.J. Xjoin: a reactively-scheduled pipelined join operator. IEEE Data Eng. Bull. 23 2 (2000) 27-33
13. N. Tatbul, U. Çetintemel, S.B. Zdonik, M. Cherniack, M. Stonebraker, Load shedding in a data stream manager, in: VLDB, 2003, pp. 309-320.
14. Stonebraker M., Aoki P.M., Litwin W., Pfeffer A., Sah A., Sidell J., Staelin C., and Yu A. Mariposa: a wide-area distributed database system. VLDB J. 5 1 (1996) 48-63
15. S. Babu, R. Motwani, K. Munagala, I. Nishizawa, J. Widom, Adaptive ordering of pipelined stream filters, in: SIGMOD, 2004, pp. 407-418.
16. C.H. Papadimitriou, M. Yannakakis, Multiobjective query optimization, in: PODS, 2001, pp. 52-59.
17. W. Hasan, R. Motwani, Optimization algorithms for exploiting the parallelism-communication tradeoff in pipelined parallelism, in: VLDB, 1994, pp. 36-47.
18. C. Monma, J. Sidney, Sequencing with series-parallel precedence constraints, in: Maths of Operations Research, vol. 4, 1979, pp. 215-224.
19. L. Golab, M.T. Özsu, Processing sliding window multi-joins in continuous queries over data streams, in: VLDB, 2003, pp. 500-511.
20. M.A. Hammad, M.J. Franklin, W.G. Aref, A.K. Elmagarmid, Scheduling for shared window joins over data streams, in: VLDB, 2003, pp. 297-308.
21. L. Getoor, B. Taskar, D. Koller, Selectivity estimation using probabilistic models, in: SIGMOD, 2001, pp. 461-472.
22. A. Deshpande, M.N. Garofalakis, R. Rastogi, Independence is good: dependency-based histogram synopses for high-dimensional data, in: SIGMOD, 2001, pp. 199-210.
23. J. Kang, J.F. Naughton, S. Viglas, Evaluating window joins over unbounded streams, in: ICDE, 2003, pp. 341-352.
24. G. Moerkotte, T. Neumann, Dynamic programming strikes back, in: SIGMOD, 2008, pp. 539-552.
25. S. Ganguly, W. Hasan, R. Krishnamurthy, Query optimization for parallel execution, in: SIGMOD, 1992, pp. 9-18.
26. E.A. Rundensteiner, L. Ding, T.M. Sutherland, Y. Zhu, B. Pielech, N. Mehta, Cape: continuous query engine with heterogeneous-grained adaptivity, in: VLDB, 2004, pp. 1353-1356.
27. V. Raghavan, Y. Zhu, E.A. Rundensteiner, D.J. Dougherty, Multi-join continuous query optimization: covering the spectrum of linear, acyclic, and cyclic queries, in: BNCOD, 2009, pp. 91-106.
28. Y. Xing, S.B. Zdonik, J.-H. Hwang, Dynamic load distribution in the borealis stream processor, in: ICDE, 2005, pp. 791-802.
29. F. Tian, D.J. DeWitt, Tuple routing strategies for distributed eddies, in: VLDB, 2003, pp. 333-344.
30. S. Babu, K. Munagala, J. Widom, R. Motwani, Adaptive caching for continuous queries, in: ICDE, 2005, pp. 118-129.
31. Yang Y., Krämer J., Papadias D., and Seeger B. Hybmig: a hybrid approach to dynamic plan migration for continuous queries. TKDE 19 3 (2007) 398-411
32. Y. Zhu, E.A. Rundensteiner, G.T. Heineman, Dynamic plan migration for continuous queries over data streams, in: SIGMOD, 2004, pp. 431-442.
33. S. Chandrasekaran, O. Cooper, A. Deshpande, M.J. Franklin, J.M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, M.A. Shah, Telegraphcq: continuous dataflow processing for an uncertain world, in: CIDR, 2003.
34. D.J. Abadi, Y. Ahmad, M. Balazinska, U. Çetintemel, M. Cherniack, J.-H. Hwang, W. Lindner, A. Maskey, A. Rasin, E. Ryvkina, N. Tatbul, Y. Xing, S.B. Zdonik, The design of the borealis stream processing engine, in: CIDR, 2005, pp. 277-289.
35. M.H. Ali, W.G. Aref, R. Bose, A.K. Elmagarmid, A. Helal, I. Kamel, M.F. Mokbel, Nile-pdt: a phenomenon detection and tracking framework for data stream management systems, in: VLDB, 2005, pp. 1295-1298.
36. B. Babcock, S. Babu, M. Datar, R. Motwani, J. Widom, Models and issues in data stream systems, in: PODS, 2002, pp. 1-16.
37. R. Avnur, J.M. Hellerstein, Eddies: continuously adaptive query processing, in: W. Chen, J.F. Naughton, P.A. Bernstein (Eds.), SIGMOD, 2000, pp. 261-272.
38. J. Chen, D.J. DeWitt, F. Tian, Y. Wang, Niagaracq: a scalable continuous query system for internet databases, in: SIGMOD, 2000, pp. 379-390.
39. Arasu A., Babu S., and Widom J. The cql continuous query language: semantic foundations and query execution. VLDB J. 15 2 (2006) 121-142
40. W. Hong, M. Stonebraker, Optimization of parallel query execution plans in xprs, in: PDIS, 1991, pp. 218-225.
41. M.N. Garofalakis, Y.E. Ioannidis, Multi-dimensional resource scheduling for parallel queries, in: SIGMOD, 1996, pp. 365-376.