Balanced search trees typically use key comparisons to guide their operations, and achieve logarithmic running time. By relying on numerical properties of the keys, interpolation search achieves lower search complexity and better performance. Although interpolation-based data structures were investigated in the past, their non-blocking concurrent variants have received very little attention so far.
No takes yet. Share an insight, caveat, or question.
Brown et al. (2020) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: