Back to papers
T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph
Summary: T-FSM's task-based parallel engine delivers high concurrency with bounded memory and balanced load for large-scale subgraph mining. It introduces Fraction-Score, a more accurate anti-monotonic measure than MNI, with speedups and open-source release.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6578
- Venue
- SIGMOD
- Year
- 2023
- Pagerank
- 4.3212967e-05
- Overall Rank
- 9,561 | 33.56%
- DOI
-
10.1145/3588928
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 202 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034881375 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 1,095 |
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph |
2014 |
VLDB |
0.00014103799 |
| 1,334 |
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins |
2019 |
VLDB |
0.00012543633 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 2,933 |
Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU |
2020 |
VLDB |
7.8633648e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,135 |
Fractal: A General-Purpose Graph Pattern Mining System |
2019 |
SIGMOD |
7.4928743e-05 |
| 3,169 |
K-Automorphism: A General Framework for Privacy Preserving Network Publication |
2009 |
VLDB |
7.4545379e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 11,248 |
Mining Frequent Infix Patterns from Concurrency-Aware Process Execution Variants |
2023 |
VLDB |
4.1905499e-05 |
| 12,471 |
Optimization of Frequent Itemset Mining on Multiple-Core Processor |
2007 |
VLDB |
4.1905499e-05 |
| 4,713 |
Mining Graph Patterns Efficiently via Randomized Summaries |
2009 |
VLDB |
5.9694403e-05 |
| 6,386 |
Mining and Indexing Graphs for Supergraph Search |
2013 |
VLDB |
5.0820608e-05 |
| 8,209 |
Mining Top-k Pairs of Correlated Subgraphs in a Large Network |
2020 |
VLDB |
4.5537353e-05 |
| 11,031 |
FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition |
2024 |
VLDB |
4.1905499e-05 |
| 9,564 |
Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs |
2017 |
SIGMOD |
4.3212967e-05 |
| 3,991 |
Mind the Gap: Large-Scale Frequent Sequence Mining |
2013 |
SIGMOD |
6.5529781e-05 |
| 3,135 |
Fractal: A General-Purpose Graph Pattern Mining System |
2019 |
SIGMOD |
7.4928743e-05 |
| 10,852 |
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds |
2025 |
VLDB |
4.1905499e-05 |