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,997 | FedKNN: Secure Federated k-Nearest Neighbor Search | 2024 | SIGMOD | 7.7569625e-05 |
| 8,072 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 4.5890162e-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 |
|---|---|---|---|---|
| 351 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026351742 |
| 949 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.0001510288 |
| 1,232 | Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints | 2008 | VLDB | 0.00013133604 |
| 1,444 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011941836 |
| 2,402 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.87387e-05 |
| 2,524 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5993622e-05 |
| 2,588 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB | 8.4872437e-05 |
| 3,864 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.6813849e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,959 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.7992713e-05 |
| 949 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.0001510288 |
| 10,704 | S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB | 4.1905499e-05 |
| 3,851 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB | 6.6999444e-05 |
| 2,557 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5484449e-05 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.673504e-05 |
| 3,864 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 6.6813849e-05 |
| 2,524 | Connected Substructure Similarity Search | 2010 | SIGMOD | 8.5993622e-05 |
| 1,280 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD | 0.00012838714 |
| 3,756 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB | 6.781373e-05 |