DBScholar

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.9769913e-05
Overall Rank
10,432 | 29.89%
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.

Authors

BibTeX Citation

@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
Previous Page 1 / 1 Next

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.00024899872
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00023499655
289 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021960834
390 QPipe: A Simultaneously Pipelined Relational Query Engine 2005 SIGMOD 0.00019265472
489 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017440023
512 Scalable SPARQL Querying of Large RDF Graphs 2011 VLDB 0.00017053842
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015048943
669 SharedDB: Killing One Thousand Queries With One Stone 2012 VLDB 0.00014975391
937 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012971451
961 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012830477
1,042 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012331317
1,046 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012316579
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012007739
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011622165
1,572 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.0001019315
1,901 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4014537e-05
2,017 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.1788573e-05
2,022 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.1686153e-05
2,098 TripleBit: a Fast and Compact System for Large Scale RDF Data 2013 VLDB 9.0487308e-05
2,102 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0433983e-05
2,168 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9292584e-05
2,701 TreeSpan: Efficiently Computing Similarity All-Matching 2012 SIGMOD 8.114832e-05
3,165 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5735255e-05
3,467 In-depth Analysis of Graph-based RAG in a Unified Framework 2025 VLDB 7.2749538e-05
3,769 Multi-Query Optimization for Subgraph Isomorphism Search 2017 VLDB 7.0282248e-05
4,077 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8156109e-05
4,124 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.7895411e-05
4,512 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.5650165e-05
4,589 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5130839e-05
4,780 Influential Community Search over Large Heterogeneous Information Networks 2023 VLDB 6.4161407e-05
4,819 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3954734e-05
6,506 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.758981e-05
9,060 Optimizing Disjunctive Queries with Tagged Execution 2024 SIGMOD 5.227932e-05
10,251 Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query 2020 SIGMOD 5.0501823e-05
Previous Page 1 / 1 Next

Semantically Similar Papers