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.379165e-05
Overall Rank
1,907 | 87.22%
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 42 of 42 citing papers.

Rank Citing Paper Year Venue Pagerank
2,635 Neural Subgraph Counting with Wasserstein Estimator 2022 SIGMOD 8.1795762e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,370 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6213567e-05
5,271 Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach 2024 VLDB 6.1891764e-05
5,404 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.132986e-05
5,895 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9387634e-05
5,995 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.903845e-05
6,245 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.8210521e-05
6,251 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8179719e-05
6,272 SUFF: Accelerating Subgraph Matching with Historical Data 2023 VLDB 5.8112899e-05
6,711 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6854796e-05
7,552 Fast Local Subgraph Counting 2024 VLDB 5.4802093e-05
7,595 A Framework for Privacy Preserving Localized Graph Pattern Query Processing 2023 SIGMOD 5.4727106e-05
8,899 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2401722e-05
8,920 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2361195e-05
9,059 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.21427e-05
9,837 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1064323e-05
9,881 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.1043481e-05
9,882 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.1043481e-05
10,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,333 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0225409e-05
10,379 Algebraic Subgraph Counting 2027 SIGMOD 4.9605343e-05
10,498 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9605343e-05
10,583 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9605343e-05
10,689 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9605343e-05
10,712 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9605343e-05
10,747 R2O: A Dual-Layer Framework for Joint Rewriting and Ordering in Distributed Property Graph Query Optimization 2026 SIGMOD 4.9605343e-05
10,779 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9605343e-05
10,805 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
10,817 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9605343e-05
10,857 MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs 2026 VLDB 4.9605343e-05
10,859 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9605343e-05
10,888 A Unified Query Planning Framework for Conjunctive Regular Path Queries 2026 VLDB 4.9605343e-05
11,059 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9605343e-05
11,115 Scalable Approximate Biclique Counting over Large Bipartite Graphs 2026 VLDB 4.9605343e-05
11,123 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9605343e-05
11,349 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9605343e-05
11,491 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9605343e-05
11,861 Density Personalized Group Query 2023 VLDB 4.9605343e-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.00026634326
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
235 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023701614
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
706 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014622696
734 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014334121
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,171 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011677799
1,180 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011600363
1,502 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010431532
2,128 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9879343e-05
2,226 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 8.7971869e-05
3,504 iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques 2010 VLDB 7.2296629e-05
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.2286203e-05
4,835 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3793473e-05
Previous Page 1 / 1 Next

Semantically Similar Papers