Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
EPFL Technical Report IC/2002/79 Efficient Search in
 

Summary: EPFL Technical Report IC/2002/79
Efficient Search in
Unbalanced, Randomized Peer-To-Peer Search Trees
Karl Aberer
School of Computer and Communication Sciences
Swiss Federal Institute of Technology (EPFL)
1015 Lausanne, Switzerland
Tel: +41-21-6934679, FAX: +41-21-6938115
karl.aberer@epfl.ch
Abstract
Scalable mechanisms to support efficient key-based search in distributed systems are
an important part of the infrastructure of peer-to-peer systems and global information sys-
tems. They received substantial attention both in information and communication systems
research. A particularly important class of approaches is based on a principle of scalable
distribution of binary search trees that has been introduced by Plaxton [9]. When adapt-
ing the shape of such a tree search structure to the data distribution in order to obtain load
balancing, the search trees may become highly unbalanced. We show that for P-Grid, a
Plaxton-like distributed search structure that we first introduced in [1], the expected com-
munication cost for searches is strictly limited by
¢¡¤£¦¥¨§©

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences