DBScholar

Back to papers

GuP: Fast Subgraph Matching by Guard-based Pruning

Summary: GuP uses guard-based pruning for subgraph matching, attaching guards to candidates to prune non-productive search states. This adaptive, state-aware filtering dramatically reduces search space and enables hard queries beyond prior methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h4fc4c7b805669116
Venue
SIGMOD
Year
2023
Pagerank
7.5735255e-05
Overall Rank
3,165 | 78.73%
DOI
10.1145/3589312

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{arai_sigmod23,
        title = {{GuP: Fast Subgraph Matching by Guard-based Pruning}},
        author = {Arai, Junya and Fujiwara, Yasuhiro and Onizuka, Makoto},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3589312},
        url = {https://dl.acm.org/doi/10.1145/3589312},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 25 of 25 citing papers.

Rank Citing Paper Year Venue Pagerank
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
5,880 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9584658e-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
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,657 gSWORD: GPU-accelerated Sampling for Subgraph Counting 2024 SIGMOD 5.142891e-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,456 Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks 2026 SIGMOD 4.9769913e-05
10,651 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 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,798 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9769913e-05
11,062 Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching 2026 VLDB 4.9769913e-05
11,212 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 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
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024899872
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
332 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00020756016
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
512 Scalable SPARQL Querying of Large RDF Graphs 2011 VLDB 0.00017053842
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
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012971451
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
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,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001019315
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,022 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1686153e-05
2,098 TripleBit: a Fast and Compact System for Large Scale RDF Data 2013 VLDB 9.0487308e-05
2,102 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0433983e-05
4,819 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3954734e-05
Previous Page 1 / 1 Next

Semantically Similar Papers