DBScholar

Back to papers

Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach

Summary: FlowSC combines stronger bipartite candidate filtering with a bottom-up flow-learning GNN that simulates candidate-tree counting via controlled message flow and aggregation. It delivers up to 4-order-of-magnitude higher accuracy and 3× speedups, scaling to billion-edge graphs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
14100
Venue
VLDB
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,885 | 25.32%
DOI
10.14778/3742728.3742758

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{guo_vldb25,
        title = {{Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach}},
        author = {Guo, Qiuyu and Yang, Jianye and Zhang, Wenjie and Wang, Hanchen and Zhang, Ying and Lin, Xuemin},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {8},
        pages = {2695--2708},
        doi = {10.14778/3742728.3742758},
        url = {https://doi.org/10.14778/3742728.3742758},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,520 Efficient Temporal Subgraph Management: A New Interval Index 2026 VLDB 5.093636e-05
11,067 Machine Learning for Graph Data Management and Query Processing 2025 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 29 of 29 cited papers.

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

Rank Cited Paper Year Venue Pagerank
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
490 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.000175757
593 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00016027871
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
802 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013907725
900 G-CORE: A Core for Future Graph Query Languages 2018 SIGMOD 0.00013337186
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,499 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010564536
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,731 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1959181e-05
3,028 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.8349117e-05
3,194 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6491858e-05
3,283 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.56675e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
4,995 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.4089186e-05
5,877 Neural Attributed Community Search at Billion Scale 2023 SIGMOD 6.0551011e-05
5,942 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.0334209e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
Previous Page 1 / 1 Next

Semantically Similar Papers