Skip lists: A randomized dictionary
ثبت نشده
چکیده
The standard data structures for this problem is the balanced binary tree. It supports all the above operations in worst case time O(logn) and uses O(n) space. Well known classes of balanced trees are for example AVL-trees, BB[α]-trees and red-black-trees. In order to maintain their worst case time behaviour all those data structures need more or less elaborate rebalancing operations which make an implementation non-trivial, which in turn leads not to the best practical run times.
منابع مشابه
Lecture Notes Selected Topics in Data Structures (ausgeww Ahlte Kapitel Aus Datenstrukturen) 3 Range Trees and the Post-ooce Problem 33 3.1 from the Exact L 1 -problem to the Approximate L 4 Mantaining Order in a List 57
Preface This text contains the lecture notes for the course Ausgeww ahlte Kapitel aus Datenstruk-turen, which was given by the author at the Universitt at des Saarlandes during the winter semester 1993/94. The course was intended for 3rd/4th year students having some basic knowledge in the eld of algorithm design. The course was accompanied by Ubungen. The Ubungsaufgaben are given in Chapter 5....
متن کاملLecture Notes Selected Topics in Data Structures (ausgeww Ahlte Kapitel Aus Datenstrukturen) 4 Mantaining Order in a List 57
Preface This text contains the lecture notes for the course Ausgeww ahlte Kapitel aus Datenstruk-turen, which was given by the author at the Universitt at des Saarlandes during the winter semester 1993/94. The course was intended for 3rd/4th year students having some basic knowledge in the eld of algorithm design. The course was accompanied by Ubungen. The Ubungsaufgaben are given in Chapter 5....
متن کاملImplementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing
We present the software architecture and implementation of an efficient data structure for dynamically maintaining an authenticated dictionary. The building blocks of the data structure are skip lists and one-way commutative hash functions. We also present the results of a preliminary experiment on the performance of the data structure. Applications of our work include certificate revocation in...
متن کاملA Design of a Parallel Dictionary Using Skip Lists
We present a topdown design of a parallel PRAM dictionary using skip lists. More precisely, we give detailed algorithms to search for, insert or delete k elements in a skip list of n elements in parallel. The algorithms are iterative and easy to implement on real machines. We discuss some implementation issues and give concrete examples in C*. The algorithms run on an EREW PRAM in expected time...
متن کاملA Limit Theory for Random Skip
The skip list was introduced by Pugh in 1989 as a data structure for dictionary operations. Using a binary tree representation of skip lists, we obtain the limit law for the path lengths of the leaves in the skip list . We also show that the height (maximal path length) of a skip list holding n elements is in probability asymptotic to c log, / n, where c is the unique solution greater than 1 of...
متن کامل