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
he9c70f2d8a8a173a
Venue
VLDB
Year
2025
Pagerank
4.9605343e-05
Overall Rank
11,349 | 23.93%
DOI
10.14778/3742728.3742758
PDF
Download (CC BY-NC-ND 4.0)

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 3 of 3 citing papers.

Rank Citing Paper Year Venue Pagerank
9,103 Machine Learning for Graph Data Management and Query Processing 2025 VLDB 5.208561e-05
10,379 Algebraic Subgraph Counting 2027 SIGMOD 4.9605343e-05
10,776 Efficient Temporal Subgraph Management: A New Interval Index 2026 VLDB 4.9605343e-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
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
318 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021178303
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
467 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017740891
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
594 Wander Join: Online Aggregation via Random Walks 2016 SIGMOD 0.00015814493
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
793 Random Sampling over Joins Revisited 2018 SIGMOD 0.00013903938
854 G-CORE: A Core for Future Graph Query Languages 2018 SIGMOD 0.00013432811
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,444 Pessimistic Cardinality Estimation: Tighter Upper Bounds for Intermediate Join Cardinalities 2019 SIGMOD 0.00010616242
1,565 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010185615
1,907 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.379165e-05
1,988 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2301018e-05
2,023 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1568397e-05
2,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1795762e-05
2,931 Motivo: fast motif counting via succinct color coding and adaptive sampling 2019 VLDB 7.8284452e-05
3,105 A Learned Sketch for Subgraph Counting 2021 SIGMOD 7.6278115e-05
3,107 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6265309e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,133 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7738028e-05
4,485 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5644966e-05
5,271 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1891764e-05
5,717 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 6.0067263e-05
6,002 Neural Attributed Community Search at Billion Scale 2023 SIGMOD 5.9028394e-05
6,245 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8210521e-05
10,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
Previous Page 1 / 1 Next

Semantically Similar Papers