The SkipTrie: low-depth concurrent search without rebalancing
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 de...
| Автори: | , |
|---|---|
| Інші автори: | |
| Формат: | Стаття |
| Мова: | en_US |
| Опубліковано: |
Association for Computing Machinery (ACM)
2014
|
| Онлайн доступ: | http://hdl.handle.net/1721.1/90889 https://orcid.org/0000-0002-4552-2414 |