Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
Summary: Introduces vertex-equivalence techniques to speed subgraph search and matching. Static equivalence among query-graph vertices yields a fixed, efficient matching order; dynamic equivalence among data-graph candidates prunes redundant search paths, delivering large speedups over state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hyunjoon Kim (SAP; Seoul National University)
- 2. Yunyoung Choi (Seoul National University)
- 3. Kunsoo Park (Seoul National University)
- 4. Xuemin Lin (University of New South Wales)
- 5. Seok-Hee Hong (University of Sydney)
- 6. Wook-Shin Han (Pohang University of Science and Technology)
BibTeX Citation
@inproceedings{kim_sigmod21,
title = {{Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching}},
author = {Kim, Hyunjoon and Choi, Yunyoung and Park, Kunsoo and Lin, Xuemin and Hong, Seok-Hee and Han, Wook-Shin},
series = {{SIGMOD} '21},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3448016.3457265},
url = {https://dl.acm.org/doi/10.1145/3448016.3457265},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 38 of 38 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,006 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 2 | 1,487 | Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs | 2015 | VLDB |
| 3 | 2,035 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 4 | 10,050 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD |
| 5 | 4,983 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 6 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 7 | 10,952 | Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences | 2025 | VLDB |
| 8 | 3,709 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |
| 9 | 442 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 10 | 659 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |