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.6265309e-05
Overall Rank
3,107 | 79.18%
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 26 of 26 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
4,099
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
6.7940875e-05
5,895
Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
2025
SIGMOD
5.9387634e-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
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,684
gSWORD: GPU-accelerated Sampling for Subgraph Counting
2024
SIGMOD
5.1258854e-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,522
Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks
2026
SIGMOD
4.9605343e-05
10,712
Enumerating Graph Pattern Matches with ML Oracles
2026
SIGMOD
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,859
Subgraph Enumeration: Beyond Tree Decomposition
2026
VLDB
4.9605343e-05
11,123
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
2026
VLDB
4.9605343e-05
11,270
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
2025
SIGMOD
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
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.00024929198
288
Graphs-at-a-time: Query Language and Access Methods for Graph Databases
2008
SIGMOD
0.00022009138
333
FG-Index: Towards Verification-Free Query Processing on Graph Databases
2007
SIGMOD
0.00020712452
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
513
Scalable SPARQL Querying of Large RDF Graphs
2011
VLDB
0.00017023182
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
942
Real-time Constrained Cycle Detection in Large Dynamic Graphs
2018
VLDB
0.00012936571
952
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
0.00012878316
1,090
CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching
2019
SIGMOD
0.00012062682
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,565
Scalable Subgraph Enumeration in MapReduce
2015
VLDB
0.00010185615
1,988
RapidMatch: A Holistic Approach to Subgraph Query Processing
2021
VLDB
9.2301018e-05
2,023
Scalable Distributed Subgraph Enumeration
2017
VLDB
9.1568397e-05
2,101
DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine
2016
SIGMOD
9.0309825e-05
2,109
TripleBit: a Fast and Compact System for Large Scale RDF Data
2013
VLDB
9.0224381e-05
4,835
Taming Subgraph Isomorphism for RDF Query Processing
2015
VLDB
6.3793473e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
1,180
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases
2013
VLDB
2
1,171
In-Memory Subgraph Matching: An In-depth Study
2020
SIGMOD
3
3,020
Efficient GPU-Accelerated Subgraph Matching
2023
SIGMOD
4
658
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
5
6,245
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding
2024
VLDB
6
6,272
SUFF: Accelerating Subgraph Matching with Historical Data
2023
VLDB
7
10,817
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
2026
VLDB
8
3,771
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
9
952
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
2019
SIGMOD
10
1,907
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD