CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
Summary: CEMR: DFS-based subgraph matching with redundant-extension elimination. Uses black-white vertex encoding to merge common extensions plus reusable extension buffers and pruning, cutting duplicate work during enumeration and beating prior state of the art. (summarized by gpt-5.4-mini on May 27 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Linglin Yang (Peking University)
- 2. Xunbin Su (Peking University)
- 3. Lei Zou (Peking University)
- 4. Xiangyang Gou (University of New South Wales)
- 5. Yinnian Lin (Peking University)
BibTeX Citation
@article{yang_vldb26,
title = {{CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination}},
author = {Yang, Linglin and Su, Xunbin and Zou, Lei and Gou, Xiangyang and Lin, Yinnian},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {7},
pages = {1572--1585},
doi = {10.14778/3801059.3801070},
url = {https://doi.org/10.14778/3801059.3801070},
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 30 of 30 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,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |
| 2 | 11,432 | Mix & Match: Subgraph Matching for Absolute Coverage | 2025 | VLDB |
| 3 | 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB |
| 4 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 5 | 6,232 | Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding | 2024 | VLDB |
| 6 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 7 | 5,880 | Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach | 2025 | SIGMOD |
| 8 | 10,254 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 9 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 10 | 1,100 | CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching | 2019 | SIGMOD |