Database Paper Browser

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
1932
Venue
PODS
Year
2024
Pagerank
4.1945683e-05
Overall Rank
10,913 | 24.09%
DOI
10.1145/3651602

Incoming Non-self Citations Over Time

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

Authors

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

Overall Rank Paper Year Venue Pagerank
6,708 Just-In-Time Data Structures 2015 CIDR 4.953106e-05
4,756 OODB Bulk Loading Revisited: The Partitioned-List Approach 1995 VLDB 5.9450079e-05
8,081 Concise Descriptions of Subsets of Structured Sets 2003 PODS 4.5907825e-05
11,825 Efficient Top-k Indexing via General Reductions 2016 PODS 4.1945683e-05
1,488 On the Analysis of Indexing Schemes 1997 PODS 0.00011699446
5,465 Workload-Aware Storage Layout for Database Systems 2010 SIGMOD 5.4919488e-05
3,463 Towards Robust Indexing for Ranked Queries 2006 VLDB 7.069675e-05
5,196 Clustering Techniques for Minimizing External Path Length 1996 VLDB 5.6365164e-05
2,003 Indexing for Data Models with Constraints and Classes (Extended Abstract) 1993 PODS 9.8126082e-05
11,764 Write-Optimized Skip Lists 2017 PODS 4.1945683e-05