{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:45Z","timestamp":1750308765297,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-0713498CCR-00-86013EIA-01-31905CCR-02-04118DEB-04-25465"],"award-info":[{"award-number":["IIS-0713498CCR-00-86013EIA-01-31905CCR-02-04118DEB-04-25465"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["IIS-0713498CCR-00-86013EIA-01-31905CCR-02-04118DEB-04-25465","IIS-0238386"],"award-info":[{"award-number":["IIS-0713498CCR-00-86013EIA-01-31905CCR-02-04118DEB-04-25465","IIS-0238386"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-04-1-0278DAAD19-03-1-0352"],"award-info":[{"award-number":["W911NF-04-1-0278DAAD19-03-1-0352"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>\n            This article considers the problem of scalably processing a large number of continuous queries. Our approach, consisting of novel data structures and algorithms and a flexible processing framework, advances the state-of-the-art in several ways. First, our approach is query sensitive in the sense that it exploits potential overlaps in query predicates for efficient group processing. We partition the collection of continuous queries into groups based on the clustering patterns of the query predicates, and apply specialized processing strategies to heavily clustered groups (or\n            <jats:italic>hotspots<\/jats:italic>\n            ). We show how to maintain the hotspots efficiently, and use them to scalably process continuous select-join, band-join, and window-join queries. Second, our approach is also data sensitive, in the sense that it makes cost-based decisions on how to process each incoming tuple based on its characteristics. Experiments demonstrate that our approach can improve the processing throughput by orders of magnitude.\n          <\/jats:p>","DOI":"10.1145\/1567274.1567275","type":"journal-article","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T17:52:59Z","timestamp":1251827579000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Input-sensitive scalable continuous join query processing"],"prefix":"10.1145","volume":"34","author":[{"given":"Pankaj K.","family":"Agarwal","sequence":"first","affiliation":[{"name":"Duke University, Durham, NC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyi","family":"Xie","sequence":"additional","affiliation":[{"name":"Oracle Corporation, Redwood City, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Yang","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Yu","sequence":"additional","affiliation":[{"name":"Google Inc., Mountain View, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,9,3]]},"reference":[{"volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 11--20","author":"Agarwal P. K.","key":"e_1_2_2_1_1","unstructured":"Agarwal , P. K. , Arge , L. , Brodal , G. S. , and Vitter , J. S . 1999. I\/O-Efficient dynamic point location in monotone planar subdivisions . In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 11--20 . Agarwal, P. K., Arge, L., Brodal, G. S., and Vitter, J. S. 1999. I\/O-Efficient dynamic point location in monotone planar subdivisions. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 11--20."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_36"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 31--42","author":"Agarwal P. K.","key":"e_1_2_2_3_1","unstructured":"Agarwal , P. K. , Xie , J. , Yang , J. , and Yu , H . 2006. Scalable continuous query processing by tracking hotspots . In Proceedings of the International Conference on Very Large Data Bases, 31--42 . Agarwal, P. K., Xie, J., Yang, J., and Yu, H. 2006. Scalable continuous query processing by tracking hotspots. In Proceedings of the International Conference on Very Large Data Bases, 31--42."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970240481X"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066171"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 757--768","author":"Bizarro P.","key":"e_1_2_2_7_1","unstructured":"Bizarro , P. , Babu , S. , DeWitt , D. , and Widom , J . 2005. Content-based routing: Different plans for different data . In Proceedings of the International Conference on Very Large Data Bases, 757--768 . Bizarro, P., Babu, S., DeWitt, D., and Widom, J. 2005. Content-based routing: Different plans for different data. In Proceedings of the International Conference on Very Large Data Bases, 757--768."},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 215--226","author":"Carney D.","key":"e_1_2_2_8_1","unstructured":"Carney , D. , \u00c7etintemel , U. , Cherniack , M. , Convey , C. , Lee , S. , Seidman , G. , Stonebraker , M. , Tatbul , N. , and Zdonik , S. B . 2002. Monitoring streams--A new class of data management applications . In Proceedings of the International Conference on Very Large Data Bases, 215--226 . Carney, D., \u00c7etintemel, U., Cherniack, M., Convey, C., Lee, S., Seidman, G., Stonebraker, M., Tatbul, N., and Zdonik, S. B. 2002. Monitoring streams--A new class of data management applications. In Proceedings of the International Conference on Very Large Data Bases, 215--226."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0096-y"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335432"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/261226"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_38"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 443--452","author":"DeWitt D. J.","key":"e_1_2_2_13_1","unstructured":"DeWitt , D. J. , Naughton , J. F. , and Schneider , D. A . 1991. An evaluation of non-equijoin algorithms . In Proceedings of the International Conference on Very Large Data Bases, 443--452 . DeWitt, D. J., Naughton, J. F., and Schneider, D. A. 1991. An evaluation of non-equijoin algorithms. In Proceedings of the International Conference on Very Large Data Bases, 443--452."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066183"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144599352836"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.25"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0141-5"},{"key":"e_1_2_2_19_1","first-page":"1","article-title":"Special issue on data stream processing","volume":"26","author":"Gehrke J. E.","year":"2003","unstructured":"Gehrke , J. E. 2003 . Special issue on data stream processing . IEEE Data Engin. Bull. 26 , 1 . Gehrke, J. E. 2003. Special issue on data stream processing. IEEE Data Engin. Bull. 26, 1.","journal-title":"IEEE Data Engin. Bull."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1042046.1042051"},{"volume-title":"Proceedings of the Workshop on Algorithms and Data Structures. Springer, 153--164","author":"Hanson E.","key":"e_1_2_2_21_1","unstructured":"Hanson , E. and Johnson , T . 1991. The interval skip list: A data structure for finding all intervals that overlap a point . In Proceedings of the Workshop on Algorithms and Data Structures. Springer, 153--164 . Hanson, E. and Johnson, T. 1991. The interval skip list: A data structure for finding all intervals that overlap a point. In Proceedings of the Workshop on Algorithms and Data Structures. Springer, 153--164."},{"volume-title":"Proceedings of the International Conference on Data Engineering. IEEE Computer Society Press, 266--275","author":"Hanson E. N.","key":"e_1_2_2_22_1","unstructured":"Hanson , E. N. , Carnes , C. , Huang , L. , Konyala , M. , Noronha , L. , Parthasarathy , S. , Park , J. B. , and Vernon , A . 1999. Scalable trigger processing . In Proceedings of the International Conference on Data Engineering. IEEE Computer Society Press, 266--275 . Hanson, E. N., Carnes, C., Huang, L., Konyala, M., Noronha, L., Parthasarathy, S., Park, J. B., and Vernon, A. 1999. Scalable trigger processing. In Proceedings of the International Conference on Data Engineering. IEEE Computer Society Press, 266--275."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.22"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247564"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304209"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 275--286","author":"Jagadish H. V.","key":"e_1_2_2_27_1","unstructured":"Jagadish , H. V. , Koudas , N. , Muthukrishnan , S. , Poosala , V. , Sevcik , K. , and Suel , T . 1998. Optimal histograms with quality guarantees . In Proceedings of the International Conference on Very Large Data Bases, 275--286 . Jagadish, H. V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K., and Suel, T. 1998. Optimal histograms with quality guarantees. In Proceedings of the International Conference on Very Large Data Bases, 275--286."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-1006-1"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335223"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142509"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.790816"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564698"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007642"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214021"},{"volume-title":"Proceedings of the International Conference on Very Large Data Bases, 723--724","author":"Pereira J.","key":"e_1_2_2_35_1","unstructured":"Pereira , J. , Fabret , F. , Jacobsen , H. A. , Llirbat , F. , and Shasha , D . 2001. Webfilter: A high-throughput XML-based publish and subscribe system . In Proceedings of the International Conference on Very Large Data Bases, 723--724 . Pereira, J., Fabret, F., Jacobsen, H. A., Llirbat, F., and Shasha, D. 2001. Webfilter: A high-throughput XML-based publish and subscribe system. In Proceedings of the International Conference on Very Large Data Bases, 723--724."},{"volume-title":"Data Structures and Network Algorithms","author":"Tarjan R. E.","key":"e_1_2_2_36_1","unstructured":"Tarjan , R. E. 1983. Data Structures and Network Algorithms . Society for Industrial and Applied Mathematics , Philadelphia . Tarjan, R. E. 1983. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675881"},{"key":"e_1_2_2_38_1","unstructured":"Widom J. and Ceri S. 1996. Active Database Systems: Triggers and Rules for Advanced Database Processing. Morgan Kaufmann San Fransisco.   Widom J. and Ceri S. 1996. Active Database Systems: Triggers and Rules for Advanced Database Processing. Morgan Kaufmann San Fransisco."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1567274.1567275","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1567274.1567275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:31Z","timestamp":1750278151000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1567274.1567275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.1145\/1567274.1567275"],"URL":"https:\/\/doi.org\/10.1145\/1567274.1567275","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2009,8]]},"assertion":[{"value":"2008-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-09-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}