Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds

Summary: Minting: a top-k frequent subgraph miner for single-graph MNI that uses a novel tight upper bound to drastically prune candidates, reducing the number of MNI evaluations. Also speeds each MNI via combined lower/upper bounds, yielding up to 1000× speedups and scaling to large k. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 14204
Venue: VLDB
Year: 2025
Pagerank: 4.1945683e-05
Overall Rank: 10,848 | 24.54%
DOI: 10.14778/3712221.3712225

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
203	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00034889335
764	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017018712
1,089	GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00014157922
1,180	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013456907
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,747	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD	0.00010691242
1,924	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00010077055
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,646	G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching	2020	SIGMOD	6.8853079e-05
4,470	GuP: Fast Subgraph Matching by Guard-based Pruning	2023	SIGMOD	6.1557462e-05
5,854	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.3006473e-05
6,971	BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks	2018	SIGMOD	4.8792893e-05
7,100	BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification	2023	VLDB	4.8326259e-05
7,586	Maverick: Discovering Exceptional Facts from Knowledge Graphs	2018	SIGMOD	4.7036704e-05
7,883	Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks	2021	VLDB	4.6282138e-05
8,210	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB	4.5581054e-05
9,565	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD	4.3254416e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,403	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3441378e-05
1,089	GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00014157922
2,909	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9305767e-05
5,854	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.3006473e-05
203	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00034889335
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05
8,210	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB	4.5581054e-05
5,043	The Complexity of Mining Maximal Frequent Subgraphs	2013	PODS	5.7411631e-05
9,565	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD	4.3254416e-05
6,406	Mining and Indexing Graphs for Supergraph Search	2013	VLDB	5.0765917e-05