Dynamic Interpolation Search

Abstract

New data structure called interpolation search tree (1ST) is presented which supports interpolation search and insertions and deletions. Amortized insertion and deletion cost is O(log n). The expected search time in a random file is O(log log n). This is not only true for the uniform distribution but for a wide class of probability distributions. © 1993, ACM. All rights reserved.