Simulation-based Approximate Graph Pattern Matching
Summary: Simulation-based approximate graph pattern matching for attributed graphs; efficient matches via graph simulations. It captures reasonable matches missed by existing algorithms, addressing performance and recall gaps. (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. Xiaoshuang Chen (University of New South Wales)
BibTeX Citation
@inproceedings{chen_sigmod20,
title = {{Simulation-based Approximate Graph Pattern Matching}},
author = {Chen, Xiaoshuang},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3384401},
url = {https://dl.acm.org/doi/10.1145/3318464.3384401},
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 |
|---|---|---|---|---|
| 438 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018278591 |
| 489 | TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases | 2013 | SIGMOD | 0.00017440023 |
| 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.00015048943 |
| 1,150 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011804185 |
| 1,247 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011348258 |
| 1,374 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00010875727 |
| 2,238 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.7738068e-05 |
| 2,701 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.114832e-05 |
| 4,585 | Event Pattern Matching over Graph Streams | 2015 | VLDB | 6.5156965e-05 |
| 5,606 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB | 6.0667077e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,701 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD |
| 2 | 9,904 | Auto-Approximation of Graph Computing | 2014 | VLDB |
| 3 | 4,585 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 4 | 3,980 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 5 | 784 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 6 | 2,774 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB |
| 7 | 1,318 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 8 | 5,606 | Capturing Topology in Graph Pattern Matching | 2012 | VLDB |
| 9 | 12,065 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 10 | 1,150 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |