Dynamic interpolation search in o(log log n) time

  • Arne Andersson
  • Christer Mattsson
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 700)

Abstract

A new efficient data structure, based on the augmentation technique used in the interpolation search tree by Mehlhorn and Tsakalidis, is presented. We achieve:
  • a trade-off between input distribution and search cost for dynamic interpolation search.

  • θ(log log n) expected time for search and update operations for a larger class of densities than Mehlhorn and Tsakalidis.

  • o(log log n) expected time for search and update operations for a large class of densities. As an example, we give an unbounded density for which we achieve θ(log*n) expected time. We also show θ(1) expected time for all bounded densities, in particular, the uniform distribution.

  • improved worst-case cost from θ(log2n) to θ(log n) for searches and from θ(n) to θ(log n) for updates.

We also include a discussion of terminology: which methods should be termed “interpolation search”?

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Arne Andersson
    • 1
  • Christer Mattsson
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden

Personalised recommendations