Path-centric Cardinality Estimation for Subgraph Matching
Summary: PathCE estimates subgraph-matching cardinalities via a path-centric summary graph (PSG) encoding short-path statistics, decomposing queries into statistically annotated subpaths. It guarantees upper bounds, reduces estimation iterations, and enables linear-time parallel PSG construction. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhengdong Wang (Shanghai Jiao Tong University)
- 2. Qiang Yin (Shanghai Jiao Tong University)
- 3. Longbin Lai (Alibaba)
BibTeX Citation
@article{wang_vldb25,
title = {{Path-centric Cardinality Estimation for Subgraph Matching}},
author = {Wang, Zhengdong and Yin, Qiang and Lai, Longbin},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {9},
pages = {3063--3076},
doi = {10.14778/3746405.3746428},
url = {https://doi.org/10.14778/3746405.3746428},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,606 | Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching | 2026 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 32 of 32 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next