Back to papers
Fast Local Subgraph Counting
Summary: Tree-decomposition-based method for local k-node subgraph counting Q=(p,o): decompose pattern p into best tree T and reduce global subgraph-isomorphism to a constrained homomorphism on T plus per-tree-node subgraph-isomorphisms. Applies symmetry-breaking and a novel multi-join algorithm to speed per-node isomorphism counts; single-core single-machine implementation outperforms prior approaches and is aimed at producing GNN-ready node features.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 13431
- Venue
- VLDB
- Year
- 2024
- Pagerank
- 4.613363e-05
- Overall Rank
- 7,934 | 44.81%
- DOI
-
10.14778/3659437.3659451
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 30 of 30 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 |
Access Path Selection in a Relational Database Management System |
1979 |
SIGMOD |
0.0040449103 |
| 342 |
EmptyHeaded: A Relational Engine for Graph Processing |
2016 |
SIGMOD |
0.00026795977 |
| 502 |
Worst-case Optimal Join Algorithms |
2012 |
PODS |
0.00021526612 |
| 506 |
On Graph Query Optimization in Large Networks |
2010 |
VLDB |
0.00021475362 |
| 612 |
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism |
2008 |
VLDB |
0.0001920234 |
| 764 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017018712 |
| 1,180 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013456907 |
| 1,328 |
Hypertree Decompositions: Questions and Answers |
2016 |
PODS |
0.00012565612 |
| 1,333 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012523806 |
| 1,561 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.00011358946 |
| 1,740 |
A General Framework for Estimating Graphlet Statistics via Random Walk |
2017 |
VLDB |
0.0001071792 |
| 1,775 |
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching |
2019 |
SIGMOD |
0.00010602927 |
| 1,924 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010077055 |
| 1,953 |
Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows |
2018 |
VLDB |
9.9665955e-05 |
| 2,162 |
Scalable Subgraph Enumeration in MapReduce |
2015 |
VLDB |
9.3964337e-05 |
| 2,997 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.7559339e-05 |
| 3,001 |
Neural Subgraph Counting with Wasserstein Estimator |
2022 |
SIGMOD |
7.7404487e-05 |
| 3,036 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6735171e-05 |
| 3,187 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.4136521e-05 |
| 3,215 |
Fractal: A General-Purpose Graph Pattern Mining System |
2019 |
SIGMOD |
7.3645742e-05 |
| 3,410 |
Motivo: fast motif counting via succinct color coding and adaptive sampling |
2019 |
VLDB |
7.1253867e-05 |
| 3,641 |
GPU-Accelerated Subgraph Enumeration on Partitioned Graphs |
2020 |
SIGMOD |
6.8884895e-05 |
| 3,778 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7747398e-05 |
| 4,470 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.1557462e-05 |
| 4,556 |
Distributed Subgraph Matching on Timely Dataflow |
2019 |
VLDB |
6.0883757e-05 |
| 5,009 |
HUGE: An Efficient and Scalable Subgraph Enumeration System |
2021 |
SIGMOD |
5.761237e-05 |
| 5,053 |
DunceCap: Query Plans Using Generalized Hypertree Decompositions |
2015 |
SIGMOD |
5.7323846e-05 |
| 5,728 |
Circinus: Fast Redundancy-Reduced Subgraph Matching |
2023 |
SIGMOD |
5.3507988e-05 |
| 5,811 |
Fast and Robust Distributed Subgraph Enumeration |
2019 |
VLDB |
5.317401e-05 |
| 7,307 |
SUFF: Accelerating Subgraph Matching with Historical Data |
2023 |
VLDB |
4.7674113e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,512 |
Fast Hierarchy Construction for Dense Subgraphs |
2017 |
VLDB |
8.6196023e-05 |
| 5,854 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.3006473e-05 |
| 10,733 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1945683e-05 |
| 3,778 |
A Learned Sketch for Subgraph Counting |
2021 |
SIGMOD |
6.7747398e-05 |
| 2,039 |
Local Algorithms for Hierarchical Dense Subgraph Discovery |
2019 |
VLDB |
9.7061003e-05 |
| 4,494 |
Multi-Query Optimization for Subgraph Isomorphism Search |
2017 |
VLDB |
6.1414196e-05 |
| 1,635 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.0001105793 |
| 1,500 |
Parallel Subgraph Listing in a Large-Scale Graph |
2014 |
SIGMOD |
0.00011674394 |
| 5,521 |
Efficient Streaming Subgraph Isomorphism with Graph Neural Networks |
2021 |
VLDB |
5.4614637e-05 |
| 10,632 |
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach |
2025 |
VLDB |
4.1945683e-05 |