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 (Jeonbuk National University)
BibTeX Citation
@inproceedings{kim_sigmod21,
title = {{Boosting Graph Similarity Search through Pre-Computation}},
author = {Kim, Jongik},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3452780},
url = {https://dl.acm.org/doi/10.1145/3448016.3452780},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,906 | FedKNN: Secure Federated k-Nearest Neighbor Search | 2024 | SIGMOD | 7.0287643e-05 |
| 8,126 | Computing Approximate Graph Edit Distance via Optimal Transport | 2025 | SIGMOD | 5.4827332e-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 |
|---|---|---|---|---|
| 326 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00021152829 |
| 911 | Ed-Join: An Efficient Algorithm for Similarity Joins With Edit Distance Constraints | 2008 | VLDB | 0.00013283031 |
| 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB | 0.00012117375 |
| 1,231 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011571594 |
| 1,886 | Pass-Join: A Partition-based Method for Similarity Joins | 2012 | VLDB | 9.5358137e-05 |
| 2,650 | TreeSpan: Efficiently Computing Similarity All-Matching | 2012 | SIGMOD | 8.2920414e-05 |
| 3,311 | Connected Substructure Similarity Search | 2010 | SIGMOD | 7.5353184e-05 |
| 3,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB | 7.3491042e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,853 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB |
| 2 | 1,115 | Comparing Stars: On Approximating Graph Edit Distance | 2009 | VLDB |
| 3 | 9,383 | S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics | 2025 | VLDB |
| 4 | 3,933 | TaGSim: Type-aware Graph Similarity Learning and Computation | 2022 | VLDB |
| 5 | 2,285 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB |
| 6 | 3,548 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB |
| 7 | 3,522 | A Partition-Based Approach to Structure Similarity Search | 2014 | VLDB |
| 8 | 3,311 | Connected Substructure Similarity Search | 2010 | SIGMOD |
| 9 | 1,394 | Neighborhood Based Fast Graph Search in Large Networks | 2011 | SIGMOD |
| 10 | 3,423 | Computing Graph Edit Distance via Neural Graph Matching | 2023 | VLDB |