SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
Summary: Introduces SAPPER for approximate subgraph indexing and matching in large, noisy graphs. Novelty: hybrid neighborhood units, pre-generated random spanning trees, and a tailored enumeration order enable efficient, scalable approximate search. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Shijie Zhang (Case Western Reserve University)
- 2. Jiong Yang (Case Western Reserve University)
- 3. Wei Jin (Case Western Reserve University)
BibTeX Citation
@article{zhang_vldb10,
title = {{SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs}},
author = {Zhang, Shijie and Yang, Jiong and Jin, Wei},
journal = {PVLDB},
series = {{VLDB} '10},
volume = {3},
number = {1},
doi = {10.14778/1920841.1920988},
url = {https://doi.org/10.14778/1920841.1920988},
year = {2010}
}
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 27 | Fast Algorithms for Mining Association Rules | 1994 | VLDB | 0.00052255472 |
| 161 | Mining Frequent Patterns without Candidate Generation | 2000 | SIGMOD | 0.00027981772 |
| 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00027100548 |
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 431 | Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism | 2008 | VLDB | 0.00018577017 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,631 | Updating Graph Indices with a One-Pass Algorithm | 2015 | SIGMOD |
| 2 | 6,924 | SUFF: Accelerating Subgraph Matching with Historical Data | 2023 | VLDB |
| 3 | 352 | On Graph Query Optimization in Large Networks | 2010 | VLDB |
| 4 | 177 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD |
| 5 | 11,756 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |
| 6 | 9,383 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 7 | 3,477 | Performance and Scalability of Indexed Subgraph Query Processing Methods | 2015 | VLDB |
| 8 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 9 | 322 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD |
| 10 | 6,520 | Mining and Indexing Graphs for Supergraph Search | 2013 | VLDB |