Capturing Topology in Graph Pattern Matching
Summary: Introduces strong simulation, a topology-preserving alternative to graph simulation that yields bounded, interpretable matches rather than oversized results. Retains cubic-time complexity and locality, enabling efficient pattern matching over distributed graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shuai Ma (Beihang University)
- 2. Yang Cao (Beihang University)
- 3. Wenfei Fan (University of Edinburgh)
- 4. Jinpeng Huai (Beihang University)
- 5. Tianyu Wo (Beihang University)
BibTeX Citation
@article{ma_vldb12,
title = {{Capturing Topology in Graph Pattern Matching}},
author = {Ma, Shuai and Cao, Yang and Fan, Wenfei and Huai, Jinpeng and Wo, Tianyu},
journal = {PVLDB},
series = {{VLDB} '12},
volume = {5},
number = {4},
pages = {310},
doi = {10.14778/2095686.2095690},
url = {https://doi.org/10.14778/2095686.2095690},
year = {2012}
}Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,235 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.7779518e-05 |
| 4,551 | Querying Big Graphs within Bounded Resources | 2014 | SIGMOD | 6.5401646e-05 |
| 4,583 | Event Pattern Matching over Graph Streams | 2015 | VLDB | 6.5187824e-05 |
| 5,477 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 6.1155396e-05 |
| 5,953 | Distributed Graph Simulation: Impossibility and Possibility | 2014 | VLDB | 5.9359492e-05 |
| 8,342 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB | 5.3516819e-05 |
| 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 50 | DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases | 1997 | VLDB | 0.00043130126 |
| 783 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00014021799 |
| 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00011809728 |
| 5,462 | Distributed Query Evaluation with Performance Guarantees | 2007 | SIGMOD | 6.1221387e-05 |
| 6,133 | Minimization of Tree Pattern Queries with Constraints | 2008 | SIGMOD | 5.8776885e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,053 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB |
| 2 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 3 | 4,583 | Event Pattern Matching over Graph Streams | 2015 | VLDB |
| 4 | 2,702 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD |
| 5 | 3,979 | Diversified Top-k Graph Pattern Matching | 2013 | VLDB |
| 6 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 7 | 2,773 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB |
| 8 | 1,317 | Incremental Graph Pattern Matching | 2011 | SIGMOD |
| 9 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 10 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |