DBScholar

Back to papers

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)

Paper ID
h76179a97a9dd8d82
Venue
SIGMOD
Year
2021
Pagerank
9.4014537e-05
Overall Rank
1,901 | 87.23%
DOI
10.1145/3448016.3457265

Incoming Non-self Citations Over Time

Authors

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 41 of 41 citing papers.

Rank Citing Paper Year Venue Pagerank
2,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1954989e-05
3,012 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7512751e-05
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
4,512 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5650165e-05
5,383 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1533182e-05
5,426 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1332147e-05
5,880 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9584658e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.9234316e-05
6,235 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8403639e-05
6,506 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.758981e-05
6,517 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.7563618e-05
6,966 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6301341e-05
7,535 Fast Local Subgraph Counting 2024 VLDB 5.4983904e-05
7,579 A Framework for Privacy Preserving Localized Graph Pattern Query Processing 2023 SIGMOD 5.4908669e-05
8,900 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2534908e-05
9,038 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2315688e-05
9,368 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1843659e-05
9,804 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1233734e-05
10,067 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0851868e-05
10,259 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.0480912e-05
10,260 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.0480912e-05
10,264 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.0480912e-05
10,305 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0392037e-05
10,432 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9769913e-05
10,517 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9769913e-05
10,628 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9769913e-05
10,651 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9769913e-05
10,686 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.9769913e-05
10,718 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9769913e-05
10,744 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9769913e-05
10,750 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9769913e-05
10,756 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9769913e-05
10,796 MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs 2026 VLDB 4.9769913e-05
10,798 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9769913e-05
10,827 A Unified Query Planning Framework for Conjunctive Regular Path Queries 2026 VLDB 4.9769913e-05
10,998 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9769913e-05
11,054 Scalable Approximate Biclique Counting over Large Bipartite Graphs 2026 VLDB 4.9769913e-05
11,062 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9769913e-05
11,294 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9769913e-05
11,438 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9769913e-05
11,817 Density Personalized Group Query 2023 VLDB 4.9769913e-05
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.

Rank Cited Paper Year Venue Pagerank
176 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00026688651
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024899872
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023499655
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020116134
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018278591
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
713 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014571507
737 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014357361
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011621825
1,507 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010447258
2,168 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9292584e-05
2,212 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.8195478e-05
3,499 iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques 2010 VLDB 7.2515431e-05
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.246695e-05
4,819 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3954734e-05
Previous Page 1 / 1 Next

Semantically Similar Papers