Back to papers
Mix & Match: Subgraph Matching for Absolute Coverage
Summary: Targets coverage in subgraph matching: existing enumerators produce localized, biased streams when matches are massive, so the goal is to quickly surface results representative of the whole graph. M&M mixes global exploration (prioritizing first-level backtracking to expand coverage) with local pruning of non-coverage paths, finding ~2× more unique nodes than prior work.
(summarized by gpt-5-mini on Feb 09 2026)
- Paper ID
- 14208
- Venue
- VLDB
- Year
- 2025
- Pagerank
- 4.1905499e-05
- Overall Rank
- 10,855 | 24.56%
- DOI
-
10.14778/3773731.3773737
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
Outgoing Citations (Sorted by Pagerank)
Showing 21 of 21 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank |
Cited Paper |
Year |
Venue |
Pagerank |
| 172 |
Algorithmics and Applications of Tree and Graph Searching |
2002 |
PODS |
0.00038837872 |
| 202 |
Graph Indexing: A Frequent Structure-based Approach |
2004 |
SIGMOD |
0.00034881375 |
| 460 |
Graphs-at-a-time: Query Language and Access Methods for Graph Databases |
2008 |
SIGMOD |
0.00022679846 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 749 |
TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases |
2013 |
SIGMOD |
0.00017193776 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 1,522 |
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together |
2019 |
SIGMOD |
0.0001152219 |
| 1,630 |
An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases |
2013 |
VLDB |
0.00011073047 |
| 1,906 |
In-Memory Subgraph Matching: An In-depth Study |
2020 |
SIGMOD |
0.00010135267 |
| 1,984 |
DisC Diversity: Result Diversification based on Dissimilarity and Coverage |
2013 |
VLDB |
9.8645751e-05 |
| 2,021 |
Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs |
2015 |
VLDB |
9.7730473e-05 |
| 2,963 |
Subgraph Matching: on Compression and Computation |
2018 |
VLDB |
7.8061004e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 3,707 |
iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques |
2010 |
VLDB |
6.8223857e-05 |
| 3,818 |
High-Performance Dynamic Pattern Matching over Disordered Streams |
2010 |
VLDB |
6.7279318e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 4,748 |
Diversified Top-k Graph Pattern Matching |
2013 |
VLDB |
5.9432853e-05 |
| 5,903 |
Diversified Top-k Subgraph Querying in a Large Graph |
2016 |
SIGMOD |
5.2757528e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |
| 6,086 |
Subgraph Matching over Graph Federation |
2022 |
VLDB |
5.2157921e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 10,740 |
Subgraph Matching: A New Decomposition Based Approach |
2025 |
VLDB |
4.1905499e-05 |
| 4,326 |
GuP: Fast Subgraph Matching by Guard-based Pruning |
2023 |
SIGMOD |
6.2772512e-05 |
| 3,034 |
RapidMatch: A Holistic Approach to Subgraph Query Processing |
2021 |
VLDB |
7.6737281e-05 |
| 7,456 |
BSX : Subgraph Matching with Batch Backtracking Search |
2025 |
SIGMOD |
4.7205339e-05 |
| 1,125 |
Efficient Subgraph Matching by Postponing Cartesian Products |
2016 |
SIGMOD |
0.00013829006 |
| 648 |
Efficient Subgraph Matching on Billion Node Graphs |
2012 |
VLDB |
0.00018688754 |
| 3,119 |
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching |
2021 |
SIGMOD |
7.5393376e-05 |
| 10,131 |
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] |
2026 |
SIGMOD |
4.1905499e-05 |
| 9,726 |
MatCo: Computing Match Cover of Subgraph Query over Graph Data |
2025 |
SIGMOD |
4.2901665e-05 |
| 5,968 |
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction |
2024 |
SIGMOD |
5.2469955e-05 |