Back to papers
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
Summary: MASC avoids costly maximum-common-subgraph discovery, instead maximizing candidate-level reuse through signature-based joint filtering and a visit-only-once paradigm. Shared-block reuse exploits multiple overlaps among queries, delivering up to two orders of magnitude speedup in batch subgraph matching.
(summarized by gpt-5.6-luna on Jul 26 2026)
Paper ID
7395
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,204 | 30.00%
DOI
10.1145/3802022
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
BibTeX Citation
Copy BibTeX
@inproceedings{zhang_sigmod26,
title = {{Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching}},
author = {Zhang, Zhijie and Yang, Sitao and Zheng, Weiguo and Qiang, Zhou and Hong, Cuntao},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802022},
url = {https://dl.acm.org/doi/10.1145/3802022},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
Outgoing Citations (Sorted by Pagerank)
Showing 34 of 34 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Rank
Cited Paper
Year
Venue
Pagerank
211
EmptyHeaded: A Relational Engine for Graph Processing
2016
SIGMOD
0.00024797217
264
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing
2018
VLDB
0.00022980015
294
Graphs-at-a-time: Query Language and Access Methods for Graph Databases
2008
SIGMOD
0.00022253507
383
QPipe: A Simultaneously Pipelined Relational Query Engine
2005
SIGMOD
0.00019520728
485
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases
2013
SIGMOD
0.00017717377
500
Scalable SPARQL Querying of Large RDF Graphs
2011
VLDB
0.00017413839
659
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
0.00015214062
670
SharedDB: Killing One Thousand Queries With One Stone
2012
VLDB
0.00015157572
927
Real-time Constrained Cycle Detection in Large Dynamic Graphs
2018
VLDB
0.00013161079
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,552
Scalable Subgraph Enumeration in MapReduce
2015
VLDB
0.00010379532
2,035
RapidMatch: A Holistic Approach to Subgraph Query Processing
2021
VLDB
9.2787188e-05
2,053
TripleBit: a Fast and Compact System for Large Scale RDF Data
2013
VLDB
9.2518674e-05
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
2,650
TreeSpan: Efficiently Computing Similarity All-Matching
2012
SIGMOD
8.2920414e-05
3,194
GuP: Fast Subgraph Matching by Guard-based Pruning
2023
SIGMOD
7.6491858e-05
3,709
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
7.1780227e-05
4,158
HUGE: An Efficient and Scalable Subgraph Enumeration System
2021
SIGMOD
6.8628196e-05
4,563
Circinus: Fast Redundancy-Reduced Subgraph Matching
2023
SIGMOD
6.6291459e-05
4,681
Influential Community Search over Large Heterogeneous Information Networks
2023
VLDB
6.5665144e-05
4,748
Taming Subgraph Isomorphism for RDF Query Processing
2015
VLDB
6.5251089e-05
4,983
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
6.4127092e-05
4,995
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
2023
SIGMOD
6.4089186e-05
6,254
In-depth Analysis of Graph-based RAG in a Unified Framework
2025
VLDB
5.9405174e-05
6,393
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
2023
VLDB
5.8879832e-05
8,893
Optimizing Disjunctive Queries with Tagged Execution
2024
SIGMOD
5.3504579e-05
10,050
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query
2020
SIGMOD
5.1685424e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
9,693
Subgraph Matching: A New Decomposition Based Approach
2025
VLDB
2
659
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
3
5,581
Subgraph Matching over Graph Federation
2022
VLDB
4
2,190
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD
5
10,564
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
2026
VLDB
6
10,375
GraphMatch: Subgraph Query Processing on Steroids
2026
SIGMOD
7
10,558
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration
2026
VLDB
8
3,709
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
9
442
Efficient Subgraph Matching on Billion Node Graphs
2012
VLDB
10
10,050
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query
2020
SIGMOD