DBScholar

Back to papers

Asymmetric Linearizable Local Reads

Summary: Shows existing linearizable local-read algorithms incur worst-case read latency ≥ network relative diameter minus the known min message delay; proves this limitation. Introduces two algorithms exploiting asymmetric message delays to give processes near the leader/center worst-case reads below the relative diameter, with up to 50× reduction in experiments. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
14078
Venue
VLDB
Year
2025
Pagerank
5.093636e-05
Overall Rank
10,870 | 25.43%
DOI
10.14778/3742728.3742738

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{thiessen_vldb25,
        title = {{Asymmetric Linearizable Local Reads}},
        author = {Thiessen, Myles and Khazma, Guy and Toueg, Sam and de Lara, Eyal},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {8},
        pages = {2427--2439},
        doi = {10.14778/3742728.3742738},
        url = {https://doi.org/10.14778/3742728.3742738},
        year = {2025}
}

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 4 of 4 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