Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences
Summary: FiPE eliminates subgraph-search redundancy beyond individual query vertices via vertex-pair and deferred group equivalences, clustering isomorphic neighborhood patterns. Matching-order optimization and conflict resolution yield 2–3 orders-of-magnitude EPS speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yujie Lu (Fudan University)
- 2. Zhijie Zhang (Fudan University)
- 3. Weiguo Zheng (Fudan University)
- 4. Lei Zou (Peking University)
BibTeX Citation
@article{lu_vldb25,
title = {{Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences}},
author = {Lu, Yujie and Zhang, Zhijie and Zheng, Weiguo and Zou, Lei},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {11},
pages = {3896--3909},
doi = {10.14778/3749646.3749662},
url = {https://doi.org/10.14778/3749646.3749662},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,740 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 4.9793485e-05 |
| 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 27 of 27 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 | 5,672 | Subgraph Matching over Graph Federation | 2022 | VLDB |
| 2 | 10,253 | BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching | 2026 | SIGMOD |
| 3 | 2,014 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 4 | 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD |
| 5 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 6 | 10,254 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 7 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 8 | 4,075 | A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction | 2024 | SIGMOD |
| 9 | 10,746 | gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs | 2026 | VLDB |
| 10 | 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD |