• Corpus ID: 7477119

Deterministic skip lists

@inproceedings{Munro1992DeterministicSL,
  title={Deterministic skip lists},
  author={J. Ian Munro and Thomas Papadakis and Robert Sedgewick},
  booktitle={SODA '92},
  year={1992}
}
We explore techniques based on the notion of a skip list to guarantee logarithmic search, insert and delete costs. The basic idea is to insist that between any pair of elements above a given height are a small number of elements of precisely that height. The desired behaviour can be achieved by either using some extra space for pointers, or by adding the constraint that the physical sizes of the nodes be exponentially increasing. The first approach leads to simpler code, whereas the second is… 

Figures from this paper

Deterministic Jumplists
  • Amr Elmasry
  • Computer Science, Mathematics
    Nord. J. Comput.
  • 2005
We give a deterministic version of the randomized jumplists recently introduced by Bronnimann et al. [2003]. The new structure supports searches in worst-case logarithmic time, insertions and
Exploring the duality between skip lists and binary search trees
TLDR
It is shown that the skip list can be interpreted as a type of randomly-balanced BST whose simplicity and elegance is arguably on par with that of today's most popular BST balancing mechanisms.
Lock-Free Multiway Search Trees
TLDR
Experimental evidence shows that the lock-free skip tree outperforms a highly tuned concurrent skip list under workloads of various proportions of operations and working set sizes.
A Concurrent Skip List Balanced on Search
TLDR
Experimental results show that compared to the skip list used in a popular application - LevelDB, T-list can construct a more efficient and stable index structure and the insertion and search performances are improved by 17.8% and 33.3% respectively.
Dynamic optimality for skip lists and B-trees
TLDR
This work proves that for a class of skip lists that satisfy a weak balancing property, the working-set bound is a lower bound on the time to access any sequence, and develops a deterministic self-adjusting skip list whose running time matches theWorking- set bound, thereby achieving dynamic optimality in this class.
Biased Skip Lists
TLDR
This work designs a variation of skip lists that performs well for generally biased access sequences and presents two instantiations of biased skip lists, one of which achieves this bound in the worst case, the other in the expected case.
Cache-oblivious B-trees
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the number of memory
The Dense Skip Tree : A Cache-Conscious Randomized Data Structure
TLDR
Performance benchmarks show the dense skip tree to outperform the skip list and the self-balancing binary search tree when the working set cannot be contained in cache.
Cache-Sensitive Skip List: Efficient Range Queries on Modern CPUs
TLDR
This work presents Cache-Sensitive Skip Lists (CSSL) as a novel index structure that is optimized for range queries and exploits modern CPUs and CSSL is based on a cache-friendly data layout and traversal algorithm that minimizes cache misses, branch mispredictions, and allows to exploit SIMD instructions for search.
Median-of-k Jumplists and Dangling-Min BSTs
We extend randomized jumplists introduced by Bronnimann et al. (STACS 2003) to choose jump-pointer targets as median of a small sample for better search costs, and present randomized algorithms with
...
...

References

SHOWING 1-7 OF 7 REFERENCES
Average search and update costs in skip lists
TLDR
The exact value of the expected cost for the search of themth element in a skip list ofn elements is derived first in terms of previously studied functions, and secondly as an asymptotic expression, suggesting that Pugh's upper bound of theexpected search cost is fairly tight for the interesting cases.
Skip Lists: A Probabilistic Alternative to Balanced Trees
TLDR
In this chapter three algorithms for insertion and deletion in skip lists are studied, which are much simpler and significantly faster than equivalent algorithms for balanced trees.
A dichromatic framework for balanced trees
  • L. Guibas, R. Sedgewick
  • Computer Science
    19th Annual Symposium on Foundations of Computer Science (sfcs 1978)
  • 1978
TLDR
This paper shows how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass, on the way down towards a leaf.
Data Structures and Their Algorithms
TLDR
This text focuses on practical techniques for students to master data structures and efficient algorithm implementation and other topics pertinent to programmers also receive coverage.
AN ALGORITHM FOR THE ORGANIZATION OF INFORMATION
TLDR
The organization of information placed in the points of an automatic computer is discussed and the role of memory, storage and retrieval in this regard is discussed.
Concrete Mathematics
  • Concrete Mathematics
  • 1989
An algo- rithm for the Organization of Information
  • English translation in Soviet Mathematics Doklady
  • 1962