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...
Main Authors: | Oshman, Rotem, Shavit, Nir N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90889 https://orcid.org/0000-0002-4552-2414 |
Similar Items
-
On Greedy Trie Execution
by: Zbigniew Gołębiewski, et al.
Published: (2012-01-01) -
SplitTrie: A Fast Update Packet Classification Algorithm with Trie Splitting
by: Yifei Li, et al.
Published: (2022-01-01) -
Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage
by: Jae-Yun Kim, et al.
Published: (2024-01-01) -
On the Inherent Sequentiality of Concurrent Objects
by: Ellen, Faith, et al.
Published: (2012) -
Multiset-Trie Data Structure
by: Mikita Akulich, et al.
Published: (2023-03-01)