DBScholar

Back to papers

ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks

Summary: Introduces ABFlow, a new streaming query for temporal flow networks that finds the most bursty S→T flow, i.e., max flow/duration, to support alert/anomaly detection in applications like fraud. Core technical novelty is a suffix-flow reformulation plus incremental/recursive streaming optimizations (SuffixFlowstr), delivering large speedups over baselines. (summarized by gpt-5-mini on Apr 11 2026)

Paper ID
h6de246b08d35ca1b
Venue
SIGMOD
Year
2026
Pagerank
4.9769913e-05
Overall Rank
10,624 | 28.60%
DOI
10.1145/3786619
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zhao_sigmod26,
        title = {{ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks}},
        author = {Zhao, Yunxiang and Xu, Lyu and Jiang, Jiaxin and Choi, Byron and Xu, Jianliang and He, Bingsheng},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786619},
        url = {https://dl.acm.org/doi/10.1145/3786619},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,106 Path Problems in Temporal Graphs 2014 VLDB 0.0001199079
1,622 Efficient Route Planning on Public Transportation Networks: A Labelling Approach 2015 SIGMOD 0.00010049301
1,724 Querying Shortest Paths on Time Dependent Road Networks 2019 VLDB 9.7886535e-05
2,258 Regular Path Query Evaluation on Streaming Graphs 2020 SIGMOD 8.7393197e-05
2,947 Online Density Bursting Subgraph Detection from Temporal Graphs 2019 VLDB 7.8212985e-05
3,376 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.3556068e-05
4,340 Constrained Shortest Path Query in a Large Time-Dependent Graph 2019 VLDB 6.6487196e-05
4,504 NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams 2024 VLDB 6.5709602e-05
5,151 Minimum Spanning Trees in Temporal Graphs 2015 SIGMOD 6.2506509e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.9234316e-05
6,205 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.8483206e-05
7,014 Incremental Sliding Window Connectivity over Streaming Graphs 2024 VLDB 5.6184803e-05
7,349 Spade: A Real-Time Fraud Detection Framework on Evolving Graphs 2023 VLDB 5.5435164e-05
7,408 Space-Efficient Random Walks on Streaming Graphs 2023 VLDB 5.5328449e-05
8,218 LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs 2024 VLDB 5.3747366e-05
8,404 From Anomaly Detection to Rumour Detection using Data Streams of Social Platforms 2019 VLDB 5.3371779e-05
8,677 MWP: Multi-Window Parallel Evaluation of Regular Path Queries on Streaming Graphs 2024 SIGMOD 5.2892731e-05
9,160 Truss-based Community Search over Streaming Directed Graphs 2024 VLDB 5.2155399e-05
9,377 RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs 2024 VLDB 5.1843659e-05
11,132 Bursting Flow Query on Large Temporal Flow Networks 2025 SIGMOD 4.9769913e-05
Previous Page 1 / 1 Next

Semantically Similar Papers