Write-Optimized Skip Lists
Summary: External-memory write-optimized skip list with range queries O(log_{B^ε}N + K/B) and updates amortized O((log_{B^ε}N)/B^{1-ε}) I/Os w.h.p., matching B^ε-tree/LSM. Novel proof: extremal-graph coloring decomposes paths into uncorrelated groups so few levels suffice. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Michael A. Bender (State University of New York at Stony Brook)
- 2. Simon Mauras (École Normale Supérieure)
- 3. Martín Farach-Colton (Rutgers University)
- 4. Rob Johnson (State University of New York at Stony Brook)
- 5. Tyler Mayer (State University of New York at Stony Brook)
- 6. Cynthia A. Phillips (Sandia National Laboratories)
- 7. Helen Xu (Massachusetts Institute of Technology)
BibTeX Citation
@inproceedings{bender_pods17,
address = {New York, NY, USA},
series = {{PODS} '17},
title = {{Write-Optimized Skip Lists}},
url = {https://dl.acm.org/doi/10.1145/3034786.3056117},
doi = {10.1145/3034786.3056117},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Bender, Michael A. and Mauras, Simon and Farach-Colton, Martín and Johnson, Rob and Mayer, Tyler and Phillips, Cynthia A. and Xu, Helen},
year = {2017}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,062 | Timely Reporting of Heavy Hitters using External Memory | 2020 | SIGMOD | 4.9793485e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 258 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00022939599 |
| 789 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.0001397781 |
| 1,074 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012162592 |
| 1,757 | Write-Optimized B-Trees | 2004 | VLDB | 9.7131504e-05 |
| 2,431 | A Novel Index Supporting High Volume Data Warehouse Insertions | 1999 | VLDB | 8.4776498e-05 |
| 2,894 | Rose: Compressed, log-structured replication | 2008 | VLDB | 7.9005767e-05 |
| 12,320 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,454 | A Dynamic I/O-Efficient Structure for One-Dimensional Top-k Range Reporting | 2014 | PODS |
| 2 | 5,190 | Comparing Hierarchical Data in External Memory | 1999 | VLDB |
| 3 | 6,007 | Clustering Techniques for Minimizing External Path Length | 1996 | VLDB |
| 4 | 9,100 | Dynamic Indexability and Lower Bounds for Dynamic One-Dimensional Range Query Indexes | 2009 | PODS |
| 5 | 13,013 | Lower Bounds for Sorting with Few Random Accesses to External Memory | 2005 | PODS |
| 6 | 8,913 | I/O-Efficient Planar Range Skyline and Attrition Priority Queues | 2013 | PODS |
| 7 | 1,559 | On Two-Dimensional Indexability and Optimal Range Search Indexing (Extended Abstract) | 1999 | PODS |
| 8 | 6,782 | Adaptive Data Skipping in Main-Memory Systems | 2016 | SIGMOD |
| 9 | 12,323 | Efficient Top-k Indexing via General Reductions | 2016 | PODS |
| 10 | 12,320 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS |