GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
Summary: GraMI mines frequent subgraphs directly in one large graph, avoiding exhaustive instance enumeration by finding only the minimal instances needed to meet the support threshold. Extensions support transitive patterns, structural/semantic constraints, and false-positive-free approximation, yielding up to 100× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Mohammed Elseidy (EPFL)
- 2. Ehab Abdelhamid (King Abdullah University of Science and Technology)
- 3. Spiros Skiadopoulos (University of Peloponnese)
- 4. Panos Kalnis (King Abdullah University of Science and Technology)
BibTeX Citation
@article{elseidy_vldb14,
title = {{GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph}},
author = {Elseidy, Mohammed and Abdelhamid, Ehab and Skiadopoulos, Spiros and Kalnis, Panos},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {7},
pages = {517--528},
doi = {10.14778/2732286.2732289},
url = {https://doi.org/10.14778/2732286.2732289},
year = {2014}
}
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 |
|---|---|---|---|---|
| 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 |
| 318 | Storing Semistructured Data with STORED | 1999 | SIGMOD | 0.00021380325 |
| 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018398144 |
| 776 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00014110016 |
| 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001179597 |
| 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD | 9.3708222e-05 |
| 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD | 6.2318138e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,703 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |
| 2 | 5,401 | Towards Proximity Pattern Mining in Large Graphs | 2010 | SIGMOD |
| 3 | 1,972 | Mining Significant Graph Patterns by Leap Search | 2008 | SIGMOD |
| 4 | 591 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD |
| 5 | 4,581 | Mining Graph Patterns Efficiently via Randomized Summaries | 2009 | VLDB |
| 6 | 10,564 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 7 | 7,466 | Mining Attribute-structure Correlated Patterns in Large Attributed Graphs | 2012 | VLDB |
| 8 | 11,072 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB |
| 9 | 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD |
| 10 | 2,709 | GraphMiner: A Structural Pattern-Mining System for Large Disk-based Graph Databases and Its Applications | 2005 | SIGMOD |