{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T20:46:19Z","timestamp":1775594779044,"version":"3.50.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"name":"HKRGC GRF","award":["HKBU12203123"],"award-info":[{"award-number":["HKBU12203123"]}]},{"name":"HKRGC GRF","award":["HKBU12200524"],"award-info":[{"award-number":["HKBU12200524"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2026,4,2]]},"abstract":"<jats:p>\n                    Flow analyses on temporal flow networks have recently been found to be an appealing tool for a wide range of applications. For example, in financial fraud detection applications, suspicious activities can be alerted by bursty, substantial transfers and require continuous monitoring. Although determining bursting flows in static temporal networks has recently been proposed, its high complexity limits its applications to the emerging streaming scenarios. Motivated by these, we study the novel bursting flow query\n                    <jats:italic toggle=\"yes\">in the streaming scenario<\/jats:italic>\n                    and propose the\n                    <jats:italic toggle=\"yes\">\n                      <jats:bold>A<\/jats:bold>\n                      lert\n                      <jats:bold>B<\/jats:bold>\n                      ursting\n                      <jats:bold>Flow<\/jats:bold>\n                    <\/jats:italic>\n                    (ABFlow) query. Specifically, given two groups of nodes,\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    and\n                    <jats:italic toggle=\"yes\">T<\/jats:italic>\n                    , and a stream of temporal flow networks, our goal is to find the flow with\n                    <jats:italic toggle=\"yes\">maximum burstiness<\/jats:italic>\n                    from\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    to\n                    <jats:italic toggle=\"yes\">T<\/jats:italic>\n                    within the stream being monitored, where the burstiness of a flow is defined as the ratio of the flow value to the flow duration. To solve this query, we propose a novel\n                    <jats:italic toggle=\"yes\">suffix flow problem,<\/jats:italic>\n                    which leads to a practical incremental solution. Based on this solution, we further propose i) a novel constraint that enables a reduced-complexity recursive solution, and ii) optimizations for streaming, yielding a solution called SuffixFlow\n                    <jats:sub>str<\/jats:sub>\n                    . Our experiments verify that SuffixFlow\n                    <jats:sub>str<\/jats:sub>\n                    is up to two orders of magnitude faster than a baseline. Two case studies on real-world datasets showcase the anomaly detection applications of the ABFlow query.\n                  <\/jats:p>","DOI":"10.1145\/3786619","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T17:54:13Z","timestamp":1775584453000},"page":"1-26","source":"Crossref","is-referenced-by-count":0,"title":["ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-3435-0832","authenticated-orcid":false,"given":"Yunxiang","family":"Zhao","sequence":"first","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8999-0623","authenticated-orcid":false,"given":"Lyu","family":"Xu","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8748-3225","authenticated-orcid":false,"given":"Jiaxin","family":"Jiang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8381-336X","authenticated-orcid":false,"given":"Byron","family":"Choi","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9404-5848","authenticated-orcid":false,"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8618-4581","authenticated-orcid":false,"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2025. ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks. Technical Report. https:\/\/github.com\/Kilo-5723\/ABFlow\/blob\/master\/ABFlow-tr.pdf."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2019.02.003"},{"key":"e_1_2_1_3_1","first-page":"1860","article-title":"Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems","volume":"34","author":"Besta Maciej","year":"2023","unstructured":"Maciej Besta, Marc Fischer, Vasiliki Kalavri, Michael Kapralov, and Torsten Hoefler. 2023. Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems. IEEE TPDS 34, 6 (2023), 1860--1876.","journal-title":"IEEE TPDS"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/3632093.3632108"},{"key":"e_1_2_1_5_1","volume-title":"Indexing and Query Processing. In EDBT\/ICDT","volume":"1558","author":"Chen Xiaoying","year":"2016","unstructured":"Xiaoying Chen, Chong Zhang, Bin Ge, and Weidong Xiao. 2016. Temporal Social Network: Storage, Indexing and Query Processing. In EDBT\/ICDT, Vol. 1558."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3681954.3682028"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3358701.3358704"},{"key":"e_1_2_1_8_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, 3rd Edition. MIT Press.","edition":"3"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2479596"},{"key":"e_1_2_1_10_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in networks with power estimation","volume":"11","author":"Dinic Efim A","year":"1970","unstructured":"Efim A Dinic. 1970. Algorithm for solution of a problem of maximum flow in networks with power estimation. In Soviet Math. Doklady, Vol. 11. 1277--1280.","journal-title":"Soviet Math. Doklady"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321694.321699"},{"key":"e_1_2_1_12_1","volume-title":"Maximal flow through a network. Canadian journal of Mathematics","author":"Ford Lester Randolph","year":"1956","unstructured":"Lester Randolph Ford and Delbert R Fulkerson. 1956. Maximal flow through a network. Canadian journal of Mathematics (1956), 399--404."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2014.05.011"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3641204.3641214"},{"key":"e_1_2_1_16_1","first-page":"325","article-title":"The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem","volume":"1412","author":"Hochbaum Dorit S.","year":"1998","unstructured":"Dorit S. Hochbaum. 1998. The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem. In IPCO, Vol. 1412. 325--337.","journal-title":"IPCO"},{"key":"e_1_2_1_17_1","first-page":"992","article-title":"The Pseudoflow Algorithm","volume":"56","author":"Hochbaum Dorit S.","year":"2008","unstructured":"Dorit S. Hochbaum. 2008. The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem. Oper. Res. 56, 4 (2008), 992--1009.","journal-title":"A New Algorithm for the Maximum-Flow Problem. Oper. Res."},{"key":"e_1_2_1_18_1","volume-title":"Ada Wai-Chee Fu, and Ruifeng Liu","author":"Huang Silu","year":"2015","unstructured":"Silu Huang, Ada Wai-Chee Fu, and Ruifeng Liu. 2015. Minimum Spanning Trees in Temporal Graphs. In ACM SIGMOD. 419--430."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3356995.3364536"},{"key":"e_1_2_1_20_1","volume-title":"Filip Rosenbaum, and Aruna Seneviratne.","author":"Jiang Fangzhou","year":"2015","unstructured":"Fangzhou Jiang, Kanchana Thilakarathna, Mohamed Ali K\u00e2afar, Filip Rosenbaum, and Aruna Seneviratne. 2015. A Spatio-Temporal Analysis of Mobile Internet Traffic in Public Transportation Systems: A View of Web Browsing from The Bus. In ACM MobiCom. 37--42."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3570690.3570696"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00063"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. Prosper loans. http:\/\/konect.cc\/networks\/prosper-loans\/.","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_2_1_24_1","volume-title":"Jeffrey Xu Yu, and Qiangqiang Dai","author":"Li Rong-Hua","year":"2018","unstructured":"Rong-Hua Li, Jiao Su, Lu Qin, Jeffrey Xu Yu, and Qiangqiang Dai. 2018. Persistent Community Search in Temporal Networks. In IEEE ICDE. 797--808."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3659437.3659440"},{"key":"e_1_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Juntong Luo Scott Sallinen and Matei Ripeanu. 2023. Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs. In ACM GRADES-NDA@SIGMOD. 5:1--5:11.","DOI":"10.1145\/3594778.3594882"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData59044.2023.10386845"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00750-4"},{"key":"e_1_2_1_29_1","first-page":"1016","article-title":"From Anomaly Detection to Rumour Detection using Data Streams of Social Platforms","volume":"12","author":"Nguyen Thanh Tam","year":"2019","unstructured":"Thanh Tam Nguyen, Matthias Weidlich, Bolong Zheng, Hongzhi Yin, Quoc Viet Hung Nguyen, and Bela Stantic. 2019. From Anomaly Detection to Rumour Detection using Data Streams of Social Platforms. PVLDB 12, 9 (2019), 1016--1029.","journal-title":"PVLDB"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Anil Pacaci Angela Bonifati and M. Tamer \u00d6zsu. 2020. Regular Path Query Evaluation on Streaming Graphs. In ACM SIGMOD. 1415--1430.","DOI":"10.1145\/3318464.3389733"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00025"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565816.3565835"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00104"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565845"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-024-05545-4"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","unstructured":"Omer Shafiq. 2019. Bitcoin Transactions Data 2011--2013. https:\/\/doi.org\/10.21227\/8dfs-0261.","DOI":"10.21227\/8dfs-0261"},{"key":"e_1_2_1_37_1","first-page":"157","article-title":"On Querying Historical Connectivity in Temporal Graphs","volume":"2","author":"Song Jingyi","year":"2024","unstructured":"Jingyi Song, Dong Wen, Lantian Xu, Lu Qin, Wenjie Zhang, and Xuemin Lin. 2024. On Querying Historical Connectivity in Temporal Graphs. ACM PACMMOD 2, 3 (2024), 157.","journal-title":"ACM PACMMOD"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523218"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.10.018"},{"key":"e_1_2_1_40_1","volume-title":"Sushant Sachdeva, and Aaron Sidford.","author":"van den Brand Jan","year":"2024","unstructured":"Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, and Aaron Sidford. 2024. Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. In ACM-SIAM SODA. 2980--2998."},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Sibo Wang Wenqing Lin Yi Yang Xiaokui Xiao and Shuigeng Zhou. 2015. Efficient Route Planning on Public Transportation Networks: A Labelling Approach. In ACM SIGMOD. 967--982.","DOI":"10.1145\/2723372.2749456"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"e_1_2_1_43_1","volume-title":"Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151","author":"Gavin Wood","year":"2014","unstructured":"Gavin Wood et al. 2014. Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper 151, 2014 (2014), 1--32."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"e_1_2_1_46_1","volume-title":"Bursting Flow Query on Large Temporal Flow Networks. ACM PACMMOD 3, 1","author":"Xu Lyu","year":"2025","unstructured":"Lyu Xu, Jiaxin Jiang, Byron Choi, Jianliang Xu, and Bingsheng He. 2025. Bursting Flow Query on Large Temporal Flow Networks. ACM PACMMOD 3, 1 (2025), 18:1--18:26."},{"key":"e_1_2_1_47_1","volume-title":"Lui","author":"Yang Yi","year":"2016","unstructured":"Yi Yang, Da Yan, Huanhuan Wu, James Cheng, Shuigeng Zhou, and John C. S. Lui. 2016. Diversified Temporal Subgraph Pattern Mining. In ACM SIGKDD. 1965--1974."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-013-0204-x"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3339490.3339491"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3675034.3675040"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00052"},{"key":"e_1_2_1_52_1","volume-title":"MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs. ACM PACMMOD 2, 1","author":"Zhang Siyuan","year":"2024","unstructured":"Siyuan Zhang, Zhenying He, Yinan Jing, Kai Zhang, and X. Sean Wang. 2024. MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs. ACM PACMMOD 2, 1 (2024), 5:1--5:26."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00572-x"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00674-0"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3786619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T19:54:51Z","timestamp":1775591691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3786619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,2]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4,2]]}},"alternative-id":["10.1145\/3786619"],"URL":"https:\/\/doi.org\/10.1145\/3786619","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,2]]}}}