Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Skip B-Trees Ittai Abraham1
 

Summary: Skip B-Trees
Ittai Abraham1
, James Aspnes2
, and Jian Yuan3
1
The Institute of Computer Science, The Hebrew University of Jerusalem,
ittaia@cs.huji.ac.il
2
Department of Computer Science, Yale University, aspnes@cs.yale.edu
3
Google, yuanjian@gmail.com
Abstract. We describe a new data structure, the Skip B-Tree, that
combines the advantages of skip graphs with features of traditional B-
trees. A skip B-Tree provides efficient search, insertion and deletion op-
erations. The data structure is highly fault tolerant even to adversarial
failures, and allows for particularly simple repair mechanisms. Related
resource keys are kept in blocks near each other enabling efficient range
queries.
Using this data structure, we describe a new distributed peer-to-peer
network, the Distributed Skip B-Tree. Given m data items stored in

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences