SUFF: Accelerating Subgraph Matching with Historical Data

Summary: SUFF is a general structure-filtering framework that derives compact, sound filters from past subgraph-matching results to prune future search spaces and augment existing matching algorithms with minimal changes. Practical optimizations cut build/store costs and yield up to 15× speedups on real graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13217
Venue: VLDB
Year: 2023
Pagerank: 5.738697e-05
Overall Rank: 6,924 | 52.50%
DOI: 10.14778/3587136.3587144

Incoming Non-self Citations Over Time

Authors

1. Xun Jian (Hong Kong University of Science and Technology)
2. Zhiyuan Li (Hong Kong University of Science and Technology)
3. Lei Chen (Hong Kong University of Science and Technology)

BibTeX Citation

@article{jian_vldb23,
        title = {{SUFF: Accelerating Subgraph Matching with Historical Data}},
        author = {Jian, Xun and Li, Zhiyuan and Chen, Lei},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {7},
        pages = {1699--1711},
        doi = {10.14778/3587136.3587144},
        url = {https://doi.org/10.14778/3587136.3587144},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,251	Fast Local Subgraph Counting	2024	VLDB	5.4574671e-05
8,504	Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries	2024	VLDB	5.4132367e-05
9,693	Subgraph Matching: A New Decomposition Based Approach	2025	VLDB	5.2351259e-05
10,419	A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]	2026	SIGMOD	5.093636e-05
10,428	An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis]	2026	SIGMOD	5.093636e-05
10,919	X-Blossom: Massive Parallelization of Graph Maximum Matching	2025	VLDB	5.093636e-05
11,165	gSWORD: GPU-accelerated Sampling for Subgraph Counting	2024	SIGMOD	5.093636e-05

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
3	Pregel: A System for Large-Scale Graph Processing	2010	SIGMOD	0.0012250108
211	EmptyHeaded: A Relational Engine for Graph Processing	2016	SIGMOD	0.00024797217
294	Graphs-at-a-time: Query Language and Access Methods for Graph Databases	2008	SIGMOD	0.00022253507
352	On Graph Query Optimization in Large Networks	2010	VLDB	0.00020375193
431	Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism	2008	VLDB	0.00018577017
442	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB	0.00018398144
485	TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases	2013	SIGMOD	0.00017717377
659	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD	0.00015214062
1,006	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD	0.00012699518
1,036	Parallel Subgraph Listing in a Large-Scale Graph	2014	SIGMOD	0.00012499878
1,058	Graphflow: An Active Graph Database	2017	SIGMOD	0.00012378784
1,102	CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching	2019	SIGMOD	0.00012166591
1,237	In-Memory Subgraph Matching: An In-depth Study	2020	SIGMOD	0.00011545768
1,487	Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs	2015	VLDB	0.00010615297
1,552	Scalable Subgraph Enumeration in MapReduce	2015	VLDB	0.00010379532
2,065	Scalable Distributed Subgraph Enumeration	2017	VLDB	9.2352771e-05
2,119	DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine	2016	SIGMOD	9.141144e-05
2,187	Subgraph Matching: on Compression and Computation	2018	VLDB	8.9966682e-05
2,190	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD	8.9804702e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,204	Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching	2026	SIGMOD
2	591	Substructure Similarity Search in Graph Databases	2005	SIGMOD
3	659	Efficient Subgraph Matching by Postponing Cartesian Products	2016	SIGMOD
4	6,520	Mining and Indexing Graphs for Supergraph Search	2013	VLDB
5	10,419	A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]	2026	SIGMOD
6	9,383	S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics	2025	VLDB
7	2,190	Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching	2021	SIGMOD
8	442	Efficient Subgraph Matching on Billion Node Graphs	2012	VLDB
9	3,194	GuP: Fast Subgraph Matching by Guard-based Pruning	2023	SIGMOD
10	1,006	Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together	2019	SIGMOD