@inproceedings{a6b08b023e4044399bf39aec8adcbb57,
title = "The SkipTrie: Low-depth concurrent search without rebalancing",
abstract = "To date, all concurrent search structures that can support predecessor queries have had depth logarithmic in m, the number of elements. This paper introduces the SkipTrie, a new concurrent search structure supporting predecessor queries in amortized expected O (log log u + c) steps, insertions and deletions in O(c log log u), and using O(m) space, where u is the size of the key space and c is the contention during the recent past. The SkipTrie is a probabilistically-balanced version of a y-fast trie consisting of a very shallow skiplist from which randomly chosen elements are inserted into a hash-table based x-fast trie. By inserting keys into the x-fast-trie probabilistically, we eliminate the need for rebalancing, and can provide a lock-free linearizable implementation. To the best of our knowledge, our proof of the amortized expected performance of the SkipTrie is the first such proof for a tree-based data structure.",
keywords = "Amortized analysis, Concurrent data structures, Predecessor queries",
author = "Rotem Oshman and Nir Shavit",
year = "2013",
doi = "10.1145/2484239.2484270",
language = "الإنجليزيّة",
isbn = "9781450320658",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "23--32",
booktitle = "PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing",
note = "2013 ACM Symposium on Principles of Distributed Computing, PODC 2013 ; Conference date: 22-07-2013 Through 24-07-2013",
}