DBScholar

Back to papers

Layered List Labeling

Summary: Layered List Labeling unifies worst-case, adaptive, and expected list-labeling bounds with new data-structural techniques. It enables cherry-picking the best from multiple solutions to obtain joint, practical bounds for throughput, latency, and workload adaptivity in databases. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1964
Venue
PODS
Year
2024
Pagerank
5.093636e-05
Overall Rank
11,134 | 23.62%
DOI
10.1145/3651602

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{bender_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{Layered List Labeling}},
        url = {https://dl.acm.org/doi/10.1145/3651602},
        doi = {10.1145/3651602},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bender, Michael A. and Conway, Alex and Farach-Colton, Martín and Komlós, Hanna and Kuszmaul, William},
        year = {2024}
}

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