Algorithmica

, Volume 42, Issue 1, pp 3–10

Key-Independent Optimality

Article

Abstract

A new form of optimality for comparison-based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.

Data structures Dictionary Splay tree 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2005

Authors and Affiliations

  1. 1.Department of Computer and Information Science, Polytechnic University, 5 MetroTech Center, Brooklyn, NY 11201USA

Personalised recommendations