Biased Skip Lists

Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
2005 Algorithmica  
We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight w i , 1 ≤ i ≤ n, the time to access item i is O wi; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both. Search(X, i). Determine if i is in X. Insert(X,
more » ... ). Add i to X. Delete(X, i). Delete i from X. Join(X L , X R ). Assuming that i < j for each i ∈ X L and j ∈ X R , create a new set X = X L ∪ X R . The operation destroys X L and X R .
doi:10.1007/s00453-004-1138-6 fatcat:dlpg24hye5cbhlkhxvb5zx44oq