{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:49:52Z","timestamp":1774986592716,"version":"3.50.1"},"reference-count":50,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"name":"The National Key Research and Development Program of China","award":["2023YFB4502303"],"award-info":[{"award-number":["2023YFB4502303"]}]},{"DOI":"10.13039\/501100006374","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP230101445, FT210100303"],"award-info":[{"award-number":["DP230101445, FT210100303"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>\n                    Multi-way join, which refers to the join operation among multiple tables, is widely used in database systems. With the development of the Internet and social networks, a new variant of the multi-way join query has emerged, requiring continuous monitoring of the query results as the database is updated. This variant is called continuous multi-way join. The join order of continuous multi-way join significantly impacts the operation's cost. However, existing methods for continuous multi-way join order selection are heuristic, which may fail to select the most efficient orders. On the other hand, the high-cost order computation will become a system bottleneck if we directly transfer join order selection algorithms for static multi-way join to the dynamic setting. In this paper, we propose a new\n                    <jats:italic toggle=\"yes\">A<\/jats:italic>\n                    daptive\n                    <jats:italic toggle=\"yes\">J<\/jats:italic>\n                    oin\n                    <jats:italic toggle=\"yes\">O<\/jats:italic>\n                    rder\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    election algorithm for the\n                    <jats:italic toggle=\"yes\">C<\/jats:italic>\n                    ontinuous multi-way join queries named AJOSC. It uses dynamic programming to find the optimal join order with a new cost model specifically designed for continuous multi-way join. We further propose a lower-bound-based incremental re-optimization algorithm to restrict the search space and recompute the join order with low cost when data distribution changes. Experimental results show that AJOSC is up to two orders of magnitude faster than the state-of-the-art methods.\n                  <\/jats:p>","DOI":"10.1145\/3725263","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["AJOSC: Adaptive Join Order Selection for Continuous Queries"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1857-7199","authenticated-orcid":false,"given":"Xinyi","family":"Ye","sequence":"first","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6657-3781","authenticated-orcid":false,"given":"Xiangyang","family":"Gou","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8586-4400","authenticated-orcid":false,"given":"Lei","family":"Zou","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2024. ldbc-snb-specification. https:\/\/ldbcouncil.org\/ldbc_snb_docs\/ldbc-snb-specification.pdf"},{"key":"e_1_2_2_2_1","unstructured":"2024. Source code of AJOSC. https:\/\/anonymous.4open.science\/r\/AJOSC\/"},{"key":"e_1_2_2_3_1","volume-title":"Frequently Fresh Views.","author":"Ahmad Yanif","year":"2012","unstructured":"Yanif Ahmad, Oliver Kennedy, Christoph Koch, and Milos Nikolic. 2012. DBToaster: Higher-order Delta Processing for Dynamic, Frequently Fresh Views. (2012)."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--28608-0_16"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0147-z"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335420"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007615"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972771.42"},{"key":"e_1_2_2_9_1","volume-title":"Automobile insurance fraud detection using social network analysis. Applications of Data Management and Analysis: Case Studies in Social Networks and Beyond","author":"Bodaghi Arezo","year":"2018","unstructured":"Arezo Bodaghi and Babak Teimourpour. 2018. Automobile insurance fraud detection using social network analysis. Applications of Data Management and Analysis: Case Studies in Social Networks and Beyond (2018), 11--16."},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-72401-0_8"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539303"},{"key":"e_1_2_2_12_1","unstructured":"Sutanay Choudhury Lawrence Holder George Chin Khushbu Agarwal and John Feo. 2015. A Selectivity Based Approach to Continuous Pattern Detection in Streaming Graphs. arXiv:1503.00849 [cs]"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_2_2_14_1","unstructured":"David DeHaan and Frank Wm Tompa. [n. d.]. Optimal Top-Down Join Enumeration (Extended Version). ([n. d.])."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9005973"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50051-3"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2007.06.001"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00590-9"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00590--9"},{"key":"e_1_2_2_22_1","first-page":"345","article-title":"Method for optimizing processing of join queries by determining optimal processing order and assigning optimal join methods to each of the join operations","volume":"5","author":"Iyer Balakrishna R","year":"1994","unstructured":"Balakrishna R Iyer and Arun N Swami. 1994. Method for optimizing processing of join queries by determining optimal processing order and assigning optimal join methods to each of the join operations. US Patent 5,345,585.","journal-title":"US Patent"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3423211.3425668"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","unstructured":"Ahmet Kara Milos Nikolic Dan Olteanu and Haozhe Zhang. 2023. F-IVM: Analytics over Relational Databases under Updates. doi:10.48550\/arXiv.2303.08583 arXiv:2303.08583 [cs]","DOI":"10.48550\/arXiv.2303.08583"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372718"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196917"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3191653"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352141"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342644"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915212"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3446980"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-020-00634-5"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457395"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164207"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551803"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523218"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588720"},{"key":"e_1_2_2_41_1","unstructured":"Kostas Tzoumas Timos Sellis and Christian S Jensen. 2008. A Reinforcement Learning Approach for Adaptive Query Processing. (2008)."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611479.3611489"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3380586"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476315"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-022-04991-6"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00785--1"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574272"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611540.3611576"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.143"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:56:58Z","timestamp":1774983418000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725263"],"URL":"https:\/\/doi.org\/10.1145\/3725263","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}