Concurrent non-blocking hash tries have good cache locality, and horizontally scalable operations. However, operations on most existing concurrent hash tries run in O(log n) time.
No takes yet. Share an insight, caveat, or question.
Aleksandar Prokopec (2018) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: