Recent demands for storing and querying big data have revealed various shortcomings of
traditional relational database systems. This, in turn, has led to the emergence of a new kind …

Distributed computer architectures labeled" peer-to-peer" are designed for the sharing of
computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring …

Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …

Bigtable is a distributed storage system for managing structured data that is designed to
scale to a very large size: petabytes of data across thousands of commodity servers. Many …

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the
node that stores a particular data item. This paper presents Chord, a distributed lookup …

With the growing realization that current Internet protocols are reaching the limits of their
senescence, several on-going research efforts aim to design potential next-generation …

This paper presents the design and evaluation of Pastry, a scalable, distributed object
location and routing substrate for wide-area peer-to-peer applications. Pastry performs …

We describe a peer-to-peer distributed hash table with provable consistency and
performance in a fault-prone environment. Our system routes queries and locates nodes …

Hash tables-which map" keys" onto" values"-are an essential building block in modern
software systems. We believe a similar functionality would be equally valuable to large …

A fundamental problem that confronts peer-to-peer applications is the efficient location of the
node that stores a desired data item. This paper presents Chord, a distributed lookup …