Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Implementation and Analysis of the Skip Graph Data Structure
 

Summary: An Implementation and Analysis of the
Skip Graph Data Structure
Jonathan Kirsch
Advisor: Arvind Krishnamurthy
December 2003
Abstract
This paper describes research done in analyzing the properties of the skip graph, a highly-distributed,
fault-tolerant data structure which supports the standard dictionary operations of search, insertion, and
deletion. Unlike previous work, which employed distributed hash tables [5, 6], the skip graph can support
logarithmic-time complex queries (such as range queries) because it preserves the logical integrity of the
key space, storing logically-related keys in close proximity within the data structure. The goal of this
paper is to describe those issues left unresolved in the original paper by Aspnes and Shah [1], such as
system-wide load-balancing and the need for reduced space complexity. We propose methods for dealing
with these issues, and implement a simulator to assess the merit of these methods. We also present the
results of a distributed implementation of the skip graph.
1 Introduction
Over the past four or ve years, there has been an
increasing amount of research conducted in the area
of Peer-to-Peer (P2P) systems. While there is some
debate regarding the precise de nition of \peer-to-

  

Source: Amir, Yair - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences