DBScholar

Back to papers

DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs

Summary: DLCR maintains 2-hop LCR indexes under edge insertions/deletions, including batched updates, on dynamic edge-labeled graphs. Surprisingly, a query-friendly rather than update-friendly layout delivers strong update performance while retaining equivalent asymptotic complexity. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12856
Venue
VLDB
Year
2022
Pagerank
5.644647e-05
Overall Rank
7,322 | 49.77%
DOI
10.14778/3529337.3529348

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{chen_vldb22,
        title = {{DLCR: Efficient Indexing for Label-Constrained Reachability Queries on Large Dynamic Graphs}},
        author = {Chen, Xin and Peng, You and Wang, Sibo and Yu, Jeffrey Xu},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {8},
        pages = {1645--1657},
        doi = {10.14778/3529337.3529348},
        url = {https://doi.org/10.14778/3529337.3529348},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 11 of 11 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