Boosting Graph Similarity Search through Pre-Computation
Summary: Introduces Nass, a pre-computation-driven graph-similarity framework that stores inter-graph GEDs to prune candidates in filtering. Coupled with an efficient GED computation module, Nass minimizes verifications and outperforms prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jongik Kim
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,996 | FedKNN: Secure Federated k-Nearest Neighbor Search | 2024 | SIGMOD | 7.7586458e-05 |
| 8,069 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5934204e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 350 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026365067 |
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 1,234 | Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints | 2008 | VLDB | 0.00013122499 |
| 1,454 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011913289 |
| 2,409 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.8776858e-05 |
| 2,525 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5981082e-05 |
| 2,592 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB | 8.4795761e-05 |
| 3,862 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.687769e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,958 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.8031038e-05 |
| 951 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00015106325 |
| 10,696 | S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 4.1945683e-05 |
| 3,849 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 6.7064042e-05 |
| 2,551 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5572574e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.6779082e-05 |
| 3,862 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.687769e-05 |
| 2,525 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5981082e-05 |
| 1,285 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012833377 |
| 3,752 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 6.7879009e-05 |