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
h50fef9c13f3aaf42
Venue
SIGMOD
Year
2026
Pagerank
4.9605343e-05
Overall Rank
10,498 | 29.64%
DOI
10.1145/3802022
PDF
Download
(CC BY-NC-ND 4.0)
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
208
EmptyHeaded: A Relational Engine for Graph Processing
2016
SIGMOD
0.00024929198
235
The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing
2018
VLDB
0.00023701614
288
Graphs-at-a-time: Query Language and Access Methods for Graph Databases
2008
SIGMOD
0.00022009138
390
QPipe: A Simultaneously Pipelined Relational Query Engine
2005
SIGMOD
0.00019232929
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
670
SharedDB: Killing One Thousand Queries With One Stone
2012
VLDB
0.00014929358
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,046
Parallel Subgraph Listing in a Large-Scale Graph
2014
SIGMOD
0.00012315969
1,049
Graphflow: An Active Graph Database
2017
SIGMOD
0.00012293903
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,565
Scalable Subgraph Enumeration in MapReduce
2015
VLDB
0.00010185615
1,907
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD
9.379165e-05
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
2,128
Subgraph Matching: on Compression and Computation
2018
VLDB
8.9879343e-05
2,705
TreeSpan: Efficiently Computing Similarity All-Matching
2012
SIGMOD
8.0936619e-05
3,107
GuP: Fast Subgraph Matching by Guard-based Pruning
2023
SIGMOD
7.6265309e-05
3,286
In-depth Analysis of Graph-based RAG in a Unified Framework
2025
VLDB
7.441688e-05
3,771
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
7.0132957e-05
4,099
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
2024
SIGMOD
6.7940875e-05
4,133
HUGE: An Efficient and Scalable Subgraph Enumeration System
2021
SIGMOD
6.7738028e-05
4,370
Circinus: Fast Redundancy-Reduced Subgraph Matching
2023
SIGMOD
6.6213567e-05
4,485
Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction
2023
SIGMOD
6.5644966e-05
4,595
Influential Community Search over Large Heterogeneous Information Networks
2023
VLDB
6.4993083e-05
4,835
Taming Subgraph Isomorphism for RDF Query Processing
2015
VLDB
6.3793473e-05
6,251
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
2023
VLDB
5.8179719e-05
9,079
Optimizing Disjunctive Queries with Tagged Execution
2024
SIGMOD
5.2106452e-05
10,281
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query
2020
SIGMOD
5.0334833e-05
Semantically Similar Papers
#
Overall Rank
Paper
Year
Venue
1
8,899
Subgraph Matching: A New Decomposition Based Approach
2025
VLDB
2
658
Efficient Subgraph Matching by Postponing Cartesian Products
2016
SIGMOD
3
5,676
Subgraph Matching over Graph Federation
2022
VLDB
4
1,907
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
2021
SIGMOD
5
10,817
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
2026
VLDB
6
10,303
GraphMatch: Subgraph Query Processing on Steroids
2026
SIGMOD
7
10,811
Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration
2026
VLDB
8
3,771
Multi-Query Optimization for Subgraph Isomorphism Search
2017
VLDB
9
440
Efficient Subgraph Matching on Billion Node Graphs
2012
VLDB
10
10,281
Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query
2020
SIGMOD