Paper Info
Title
Efficient Lock-Free Removing and Compaction for the Cache-Trie Data Structure.
Abstract
The recently proposed cache-trie data structure improves the performance of lock-free Ctries by maintaining an auxiliary data structure called a cache. The cache allows basic operations to run in expected O(1), instead of the previous (O(log n)) bound. While earlier work showed that cache-tries improve inserts and lookups by 1.5–5(times ) on standard workloads, the remove operation was not previously examined. One of the main challenges of remove is to compact the trie – removing the elements should recycle the unused parts of the data structure.
Year
Venue
Field
2018
Euro-Par
Data structure,Binary logarithm,Cache,Computer science,Non-blocking algorithm,Parallel computing,Trie,Compaction
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
27
1
Name
Order
Citations
PageRank
Aleksandar Prokopec116313.56