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: 14205
Venue: VLDB
Year: 2025
Pagerank: 4.1905499e-05
Overall Rank: 10,852 | 24.58%
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
202	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00034881375
749	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017193776
1,095	GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00014103799
1,125	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00013829006
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,720	Mining Significant Graph Patterns by Leap Search	2008	SIGMOD	0.00010757565
1,906	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00010135267
3,034	RapidMatch: A Holistic Approach to Subgraph Query Processing	2021	VLDB	7.6737281e-05
3,119	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD	7.5393376e-05
3,644	G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching	2020	SIGMOD	6.8842065e-05
4,326	GuP: Fast Subgraph Matching by Guard-based Pruning	2023	SIGMOD	6.2772512e-05
5,903	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.2757528e-05
6,515	Towards Plug-and-Play Visual Graph Query Interfaces: Data-driven Selection of Canned Patterns for Large Networks	2021	VLDB	5.0270814e-05
6,965	BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks	2018	SIGMOD	4.8759021e-05
7,091	BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification	2023	VLDB	4.8304411e-05
7,587	Maverick: Discovering Exceptional Facts from Knowledge Graphs	2018	SIGMOD	4.6999342e-05
8,209	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB	4.5537353e-05
9,564	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD	4.3212967e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,409	A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery	2024	SIGMOD	4.3399748e-05
1,095	GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph	2014	VLDB	0.00014103799
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
5,903	Diversified Top-k Subgraph Querying in a Large Graph	2016	SIGMOD	5.2757528e-05
202	Graph Indexing: A Frequent Structure-based Approach	2004	SIGMOD	0.00034881375
10,689	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1905499e-05
8,209	Mining Top-k Pairs of Correlated Subgraphs in a Large Network	2020	VLDB	4.5537353e-05
5,041	The Complexity of Mining Maximal Frequent Subgraphs	2013	PODS	5.7356447e-05
9,564	Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs	2017	SIGMOD	4.3212967e-05
6,386	Mining and Indexing Graphs for Supergraph Search	2013	VLDB	5.0820608e-05