External Memory Skip Lists

External Memory Skip Lists is a data structure designed to optimize skip list operations for environments with hierarchical memory by minimizing I/O costs during searches, insertions, and deletions through the use of level-distributed pointers that exploit external memory block access patterns.

Publications

Citations

Authors

Institutions

Publications per year

2017–2026

Parents

Skip Lists

Publications

Dynamic optimality for skip lists and B-trees

Prosenjit Bose, Karim Douïeb, Stefan Langerman · 2008 · 35 citations

Computing, Computer Science, Algorithms +15

Anti-Persistence on Persistent Storage

M. A. Bender, Jonathan W. Berry, Rob Johnson et al. · 2016 · 16 citations · Full text

Computing, Computer Science, Data Structures +16

The B-Skip-List: A Simpler Uniquely Represented Alternative to B-Trees

Daniel Golovin · arXiv (Cornell University) · 2010 · 12 citations · Full text

Computing, Computer Science, Computer Systems +14

A data structure for a sequence of string accesses in external memory

Valentina Ciriani, Paolo Ferragina, Fabrizio Luccio et al. · ACM Transactions on Algorithms · 2007 · 12 citations

Computing, Computer Science, Computer Systems +16

1–4 of 4

Authors

MA
M. A. Bender
Fred Hutch Cancer Center, United States
1 publications · 16 citations
1
h-index
PB
Prosenjit Bose
Carleton University, Canada
1 publications · 35 citations
1
h-index
PF
Paolo Ferragina
University of Pisa, Italy
1 publications · 12 citations
1
h-index
SS
Shikha Singh
Stony Brook University, United States
1 publications · 16 citations
1
h-index
CA
Cynthia A. Phillips
Sandia National Laboratories, United States
1 publications · 16 citations
1
h-index

1–5 of 17

Institutions

1–8 of 10

Venues

ACM Transactions on Algorithms
TALG · 1 publications · 12 citations
1
h-index
arXiv (Cornell University)
Repository · 1 publications · 12 citations
1
h-index

1–2