TY - GEN

T1 - The SkipTrie

T2 - 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013

AU - Oshman, Rotem

AU - Shavit, Nir

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Amortized analysis

KW - Concurrent data structures

KW - Predecessor queries

UR - http://www.scopus.com/inward/record.url?scp=84883541881&partnerID=8YFLogxK

U2 - 10.1145/2484239.2484270

DO - 10.1145/2484239.2484270

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84883541881

SN - 9781450320658

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 23

EP - 32

BT - PODC 2013 - Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing

Y2 - 22 July 2013 through 24 July 2013

ER -