{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:54:58Z","timestamp":1725533698834},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028427"},{"type":"electronic","value":"9783642028434"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02843-4_11","type":"book-chapter","created":{"date-parts":[[2009,6,29]],"date-time":"2009-06-29T09:12:51Z","timestamp":1246266771000},"page":"91-106","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Join Continuous Query Optimization: Covering the Spectrum of Linear, Acyclic, and Cyclic Queries"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Raghavan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yali","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elke A.","family":"Rundensteiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Dougherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"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\u201334 (1979)","key":"11_CR1","DOI":"10.1145\/582095.582099"},{"doi-asserted-by":"crossref","unstructured":"Vance, B., Maier, D.: Rapid bushy join-order optimization with cartesian products. In: SIGMOD, pp. 35\u201346 (1996)","key":"11_CR2","DOI":"10.1145\/233269.233317"},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/352958.352982","volume":"25","author":"D. Kossmann","year":"2000","unstructured":"Kossmann, D., Stocker, K.: Iterative dynamic programming: a new class of query optimization algorithms. ACM Trans. Database Syst.\u00a025(1), 43\u201382 (2000)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Moerkotte, G., Neumann, T.: Dynamic programming strikes back. In: SIGMOD, pp. 539\u2013552 (2008)","key":"11_CR4","DOI":"10.1145\/1376616.1376672"},{"issue":"3","key":"11_CR5","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1145\/1270.1498","volume":"9","author":"T. Ibaraki","year":"1984","unstructured":"Ibaraki, T., Kameda, T.: On the optimal nesting order for computing n-relational joins. ACM Trans. Database Syst.\u00a09(3), 482\u2013502 (1984)","journal-title":"ACM Trans. Database Syst."},{"doi-asserted-by":"crossref","unstructured":"Swami, A.N., Iyer, B.R.: A polynomial time algorithm for optimizing join queries. In: ICDE, pp. 345\u2013354 (1993)","key":"11_CR6","DOI":"10.1109\/ICDE.1993.344047"},{"doi-asserted-by":"crossref","unstructured":"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\u2013177 (1991)","key":"11_CR7","DOI":"10.1145\/119995.115813"},{"unstructured":"Abadi, D.J., Ahmad, Y., Balazinska, M., \u00c7etintemel, 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\u2013289 (2005)","key":"11_CR8"},{"unstructured":"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\u20131298 (2005)","key":"11_CR9"},{"doi-asserted-by":"crossref","unstructured":"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\u20131356 (2004)","key":"11_CR10","DOI":"10.1016\/B978-012088469-8.50145-5"},{"doi-asserted-by":"crossref","unstructured":"Madden, S., Shah, M.A., Hellerstein, J.M., Raman, V.: Continuously adaptive continuous queries over streams. In: SIGMOD, pp. 49\u201360 (2002)","key":"11_CR11","DOI":"10.1145\/564691.564698"},{"doi-asserted-by":"crossref","unstructured":"Ayad, A., Naughton, J.F.: Static optimization of conjunctive queries with sliding windows over infinite streams. In: SIGMOD, pp. 419\u2013430 (2004)","key":"11_CR12","DOI":"10.1145\/1007568.1007616"},{"doi-asserted-by":"crossref","unstructured":"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.\u00a0665 (2003)","key":"11_CR13","DOI":"10.1145\/872757.872854"},{"doi-asserted-by":"crossref","unstructured":"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)","key":"11_CR14","DOI":"10.1145\/872757.872857"},{"doi-asserted-by":"crossref","unstructured":"Babu, S., Motwani, R., Munagala, K., Nishizawa, I., Widom, J.: Adaptive ordering of pipelined stream filters. In: SIGMOD, pp. 407\u2013418 (2004)","key":"11_CR15","DOI":"10.1145\/1007568.1007615"},{"doi-asserted-by":"crossref","unstructured":"Zhu, Y., Rundensteiner, E.A., Heineman, G.T.: Dynamic plan migration for continuous queries over data streams. In: SIGMOD, pp. 431\u2013442 (2004)","key":"11_CR16","DOI":"10.1145\/1007568.1007617"},{"unstructured":"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\u00a01455, p. 396 (2000)","key":"11_CR17"},{"doi-asserted-by":"crossref","unstructured":"Viglas, S., Naughton, J.F., Burger, J.: Maximizing the output rate of multi-way join queries over streaming information sources. In: VLDB, pp. 285\u2013296 (2003)","key":"11_CR18","DOI":"10.1016\/B978-012722442-8\/50033-1"},{"doi-asserted-by":"crossref","unstructured":"Golab, L., \u00d6zsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: VLDB, pp. 500\u2013511 (2003)","key":"11_CR19","DOI":"10.1016\/B978-012722442-8\/50051-3"},{"doi-asserted-by":"crossref","unstructured":"Kang, J., Naughton, J.F., Viglas, S.: Evaluating window joins over unbounded streams. In: ICDE, pp. 341\u2013352 (2003)","key":"11_CR20","DOI":"10.1109\/ICDE.2003.1260804"},{"doi-asserted-by":"crossref","unstructured":"Hammad, M.A., Franklin, M.J., Aref, W.G., Elmagarmid, A.K.: Scheduling for shared window joins over data streams. In: VLDB, pp. 297\u2013308 (2003)","key":"11_CR21","DOI":"10.1016\/B978-012722442-8\/50034-3"},{"doi-asserted-by":"crossref","unstructured":"Ganguly, S., Hasan, W., Krishnamurthy, R.: Query optimization for parallel execution. In: SIGMOD, pp. 9\u201318 (1992)","key":"11_CR22","DOI":"10.1145\/130283.130291"},{"doi-asserted-by":"crossref","unstructured":"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\u2013442 (2006)","key":"11_CR23","DOI":"10.1145\/1142473.1142522"},{"doi-asserted-by":"crossref","unstructured":"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\u2013382 (2005)","key":"11_CR24","DOI":"10.1145\/1066157.1066200"},{"unstructured":"Krishnamurthy, R., Boral, H., Zaniolo, C.: Optimization of nonrecursive queries. In: VLDB, pp. 128\u2013137 (1986)","key":"11_CR25"}],"container-title":["Lecture Notes in Computer Science","Dataspace: The Final Frontier"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02843-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:07:22Z","timestamp":1558397242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02843-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028427","9783642028434"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02843-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}