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.5771124e-05
Overall Rank
3,164 | 78.73%
DOI
10.1145/3589312
Incoming Non-self Citations Over Time
BibTeX Citation
Copy BibTeX
@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,075
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
6.8188389e-05
5,880
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
2025
SIGMOD
5.9612878e-05
6,965
BSX : Subgraph Matching with Batch Backtracking Search
2025
SIGMOD
5.6328006e-05
7,529
Fast Local Subgraph Counting
2024
VLDB
5.5009945e-05
8,891
Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds
2025
VLDB
5.2559789e-05
9,030
MatCo: Computing Match Cover of Subgraph Query over Graph Data
2025
SIGMOD
5.2340466e-05
9,361
Subgraph Matching: A New Decomposition Based Approach
2025
VLDB
5.1868213e-05
9,650
gSWORD: GPU-accelerated Sampling for Subgraph Counting
2024
SIGMOD
5.1453267e-05
9,797
NeuSO: Neural Optimizer for Subgraph Queries
2026
SIGMOD
5.1257999e-05
10,062
TC-Match: Fast Time-constrained Continuous Subgraph Matching
2024
VLDB
5.0875952e-05
10,253
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
2026
SIGMOD
5.050482e-05
10,254
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
2026
SIGMOD
5.050482e-05
10,258
Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences
2025
VLDB
5.050482e-05
10,300
MAVIS: Materialized View for Subgraph Matching
2026
SIGMOD
5.0415903e-05
10,420
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
2026
SIGMOD
4.9793485e-05
10,445
Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks
2026
SIGMOD
4.9793485e-05
10,640
Enumerating Graph Pattern Matches with ML Oracles
2026
SIGMOD
4.9793485e-05
10,734
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
2026
VLDB
4.9793485e-05
10,740
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration
2026
VLDB
4.9793485e-05
10,746
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
2026
VLDB
4.9793485e-05
10,788
Subgraph Enumeration: Beyond Tree Decomposition
2026
VLDB
4.9793485e-05
11,053
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
2026
VLDB
4.9793485e-05
11,203
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
2025
SIGMOD
4.9793485e-05
11,286
Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach
2025
VLDB
4.9793485e-05
11,432
Mix & Match: Subgraph Matching for Absolute Coverage
2025
VLDB
4.9793485e-05
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.00024884544
288
Graphs-at-a-time: Query Language and Access Methods for Graph Databases
2008
SIGMOD
0.00021969641
332
FG-Index: Towards Verification-Free Query Processing on Graph Databases
2007
SIGMOD
0.00020765078
355
On Graph Query Optimization in Large Networks
2010
VLDB
0.00020124083
438
Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism
2008
VLDB
0.00018286607
490
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases
2013
SIGMOD
0.00017438618
511
Scalable SPARQL Querying of Large RDF Graphs
2011
VLDB
0.00017061883
657
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
0.0001505607
712
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins
2019
VLDB
0.00014578373
937
Real-time Constrained Cycle Detection in Large Dynamic Graphs
2018
VLDB
0.00012977594
960
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
0.00012836554
1,100
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
2019
SIGMOD
0.00012013426
1,180
In-Memory Subgraph Matching: An In-depth Study
2020
SIGMOD
0.00011627669
1,181
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases
2013
VLDB
0.00011627329
1,572
Scalable Subgraph Enumeration in MapReduce
2015
VLDB
0.00010197978
2,014
RapidMatch: A Holistic Approach to Subgraph Query Processing
2021
VLDB
9.1832045e-05
2,020
Scalable Distributed Subgraph Enumeration
2017
VLDB
9.1729558e-05
2,097
TripleBit: a Fast and Compact System for Large Scale RDF Data
2013
VLDB
9.053015e-05
2,101
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
2016
SIGMOD
9.0476814e-05
4,817
Taming Subgraph Isomorphism for RDF Query Processing
2015
VLDB
6.3985024e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
1,181
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases
2013
VLDB
2
1,180
In-Memory Subgraph Matching: An In-depth Study
2020
SIGMOD
3
3,011
Efficient GPU-Accelerated Subgraph Matching
2023
SIGMOD
4
657
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
5
6,232
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding
2024
VLDB
6
6,515
SUFF: Accelerating Subgraph Matching with Historical Data
2023
VLDB
7
10,746
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
2026
VLDB
8
3,767
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
9
960
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
10
1,900
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD