DBScholar

Back to papers

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)

Paper ID
11118
Venue
VLDB
Year
2014
Pagerank
0.0001225302
Overall Rank
1,085 | 92.56%
DOI
10.14778/2732286.2732289

Incoming Non-self Citations Over Time

Authors

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.

Rank Citing Paper Year Venue Pagerank
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
3,439 COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks 2015 SIGMOD 7.4144782e-05
4,025 Beyond Macrobenchmarks: Microbenchmark-based Graph Database Evaluation 2019 VLDB 6.947875e-05
4,832 Association Rules with Graph Patterns 2015 VLDB 6.4877e-05
6,325 Combining Sampling and Synopses with Worst-Case Optimal Runtime and Quality Guarantees for Graph Pattern Cardinality Estimation 2021 SIGMOD 5.9125893e-05
7,099 Discovering Graph Functional Dependencies 2018 SIGMOD 5.7043774e-05
7,393 Maverick: Discovering Exceptional Facts from Knowledge Graphs 2018 SIGMOD 5.6261241e-05
7,601 Systems for Scalable Graph Analytics and Machine Learning: Trends and Methods 2025 VLDB 5.5866563e-05
8,095 Towards Event Prediction in Temporal Graphs 2022 VLDB 5.4877864e-05
8,179 GraphINC: Graph Pattern Mining at Network Speed 2023 SIGMOD 5.472762e-05
8,206 Mining Top-k Pairs of Correlated Subgraphs in a Large Network 2020 VLDB 5.4666548e-05
8,478 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.4170414e-05
9,124 Ontological Pathfinding: Mining First-Order Knowledge from Large Knowledge Bases 2016 SIGMOD 5.319248e-05
9,131 TED: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database 2023 SIGMOD 5.3184767e-05
9,627 Making It Tractable to Catch Duplicates and Conflicts in Graphs 2023 SIGMOD 5.2434488e-05
9,685 GARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs 2016 VLDB 5.2351356e-05
9,703 Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs 2017 SIGMOD 5.2351259e-05
10,011 Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs 2020 VLDB 5.1772034e-05
11,072 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.093636e-05
11,756 Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees 2020 SIGMOD 5.093636e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers