GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
Summary: GRAMI performs frequent subgraph mining on a single large graph, emitting only the minimal instances needed to meet the threshold, avoiding total instance enumeration. It adds frequent patterns, plus CGRAMI (structural/semantic constraints) and AGRAMI (approximate with no false positives), with heuristics delivering up to 100× speedups and deeper pattern discovery. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 21 of 21 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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 |
| 206 | Storing Semistructured Data with STORED | 1999 | SIGMOD | 0.00034583517 |
| 460 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022679846 |
| 648 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018688754 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 1,630 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.00011073047 |
| 1,720 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 0.00010757565 |
| 5,158 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD | 5.6510256e-05 |
Previous
Page 1 / 1
Next