Subgraph Matching: A New Decomposition Based Approach
Summary: ASMatch integrates fractional-hypertree-width tree decompositions with computation-sharing-aware attribute ordering and adaptive bag-match materialization. This unified optimization substantially reduces intermediate costs, outperforming backtracking and worst-case-optimal joins on challenging subgraph queries. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiyan Li (Chinese University of Hong Kong)
- 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 3. Zongyan He (Chinese University of Hong Kong)
BibTeX Citation
@article{li_vldb25,
title = {{Subgraph Matching: A New Decomposition Based Approach}},
author = {Li, Qiyan and Yu, Jeffrey Xu and He, Zongyan},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {11},
pages = {4282--4294},
doi = {10.14778/3749646.3749693},
url = {https://doi.org/10.14778/3749646.3749693},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,379 | Algebraic Subgraph Counting | 2027 | SIGMOD | 4.9605343e-05 |
| 10,522 | Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks | 2026 | SIGMOD | 4.9605343e-05 |
| 10,859 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB | 4.9605343e-05 |
| 10,884 | X-Wim: Massive Parallelization of Weighted Matching in Bipartite Graphs | 2026 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 39 of 39 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,988 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 2 | 5,995 | An In-Depth Study of Continuous Subgraph Matching | 2022 | VLDB |
| 3 | 440 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 4 | 10,498 | Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching | 2026 | SIGMOD |
| 5 | 1,907 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 6 | 786 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB |
| 7 | 1,180 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |
| 8 | 952 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 9 | 658 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 10 | 10,859 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB |