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: 6639
Venue: SIGMOD
Year: 2023
Pagerank: 5.4170414e-05
Overall Rank: 8,478 | 41.84%
DOI: 10.1145/3588928

Incoming Non-self Citations Over Time

Authors

1. Lyuheng Yuan (University of Alabama)
2. Da Yan (University of Alabama)
3. Wenwen Qu (East China Normal University)
4. Saugat Adhikari (University of Alabama)
5. Jalal Khalil (University of Alabama)
6. Cheng Long (Nanyang Technological University)
7. Xiaoling Wang (East China Normal University)

BibTeX Citation

@inproceedings{yuan_sigmod23,
        title = {{T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph}},
        author = {Yuan, Lyuheng and Yan, Da and Qu, Wenwen and Adhikari, Saugat and Khalil, Jalal and Long, Cheng and Wang, Xiaoling},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588928},
        url = {https://dl.acm.org/doi/10.1145/3588928},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,601	Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods	2025	VLDB	5.5866563e-05
10,280	Periodic Community Search in Temporal Graphs: Time Series-based Methods	2026	SIGMOD	5.093636e-05
10,748	Accelerating Skyline Path Enumeration with a Core Attribute Index on Multi-attribute Graphs	2025	SIGMOD	5.093636e-05
10,898	Maximum k-Plex Finding: Choices of Pruning Techniques Matter!	2025	VLDB	5.093636e-05

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
177	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00027100548
294	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD	0.00022253507
809	Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins	2019	VLDB	0.00013874588
1,006	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00012699518
1,085	GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.0001225302
1,237	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00011545768
2,035	RapidMatch: A Holistic Approach to Subgraph Query Processing	2021	VLDB	9.2787188e-05
2,288	Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU	2020	VLDB	8.8025299e-05
2,522	Fractal: A General-Purpose Graph Pattern Mining System	2019	SIGMOD	8.4713567e-05
2,909	K-Automorphism: A General Framework for Privacy Preserving Network Publication	2009	VLDB	7.9708764e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,446	Mining Frequent Infix Patterns from Concurrency-Aware Process Execution Variants	2023	VLDB
2	12,656	Optimization of Frequent Itemset Mining on Multiple-Core Processor	2007	VLDB
3	4,581	Mining Graph Patterns Efficiently via Randomized Summaries	2009	VLDB
4	6,520	Mining and Indexing Graphs for Supergraph Search	2013	VLDB
5	11,238	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB
6	8,206	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB
7	9,703	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD
8	4,547	Mind the Gap: Large-Scale Frequent Sequence Mining	2013	SIGMOD
9	2,522	Fractal: A General-Purpose Graph Pattern Mining System	2019	SIGMOD
10	11,072	Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds	2025	VLDB