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
- 2. Simon Mauras
- 3. Martín Farach-Colton
- 4. Rob Johnson
- 5. Tyler Mayer
- 6. Cynthia A. Phillips
- 7. Helen Xu
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 11,566 | Timely Reporting of Heavy Hitters using External Memory | 2020 | SIGMOD | 5.1725247e-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 |
|---|---|---|---|---|
| 271 | bLSM: A General Purpose Log Structured Merge Tree | 2012 | SIGMOD | 0.00022782446 |
| 1,008 | Don't Thrash: How to Cache Your Hash on Flash | 2012 | VLDB | 0.00012764791 |
| 1,108 | Cache-Oblivious String B-trees | 2006 | PODS | 0.00012228543 |
| 1,713 | Write-Optimized B-Trees | 2004 | VLDB | 0.00010029279 |
| 2,382 | A Novel Index Supporting High Volume Data Warehouse Insertions | 1999 | VLDB | 8.7366381e-05 |
| 2,809 | Rose: Compressed, log-structured replication | 2008 | VLDB | 8.154373e-05 |
| 11,830 | Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries | 2016 | PODS | 5.1725247e-05 |
Previous
Page 1 / 1
Next