Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees
Summary: Novel optimization opportunities enable a scalable pipeline for approximate graph pattern matching with 100% precision and recall for k-edit-distance subgraphs of a template. It fuses edit-distance matching with pruning, supports arbitrary patterns, and scales to graphs with hundreds of billions to trillions of edges. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Tahsin Reza (University of British Columbia)
- 2. Matei Ripeanu (University of British Columbia)
- 3. Geoffrey Sanders (Lawrence Livermore National Laboratory)
- 4. Roger Pearce (Lawrence Livermore National Laboratory)
BibTeX Citation
@inproceedings{reza_sigmod20,
title = {{Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees}},
author = {Reza, Tahsin and Ripeanu, Matei and Sanders, Geoffrey and Pearce, Roger},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380566},
url = {https://dl.acm.org/doi/10.1145/3318464.3380566},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012092602 |
| 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018197688 |
| 1,027 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.00012422544 |
| 1,121 | Counting and Sampling Triangles from a Graph Stream | 2013 | VLDB | 0.000119396 |
| 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011809728 |
| 1,244 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011353487 |
| 1,997 | GraphMat: High performance graph analytics made productive | 2015 | VLDB | 9.2158333e-05 |
| 3,979 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB | 6.8802947e-05 |
| 4,350 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB | 6.645396e-05 |
| 6,996 | Bridging the Gap Between HPC and Big Data Frameworks | 2017 | VLDB | 5.6256144e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,569 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 2 | 3,979 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 3 | 4,291 | Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs | 2008 | SIGMOD |
| 4 | 6,232 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 5 | 3,453 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |
| 6 | 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 7 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 8 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 9 | 783 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 10 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |