Indexing Data-Oriented Overlay Networks

The application of structured overlay networks to implement index structures for data-oriented applications such as peer-to-peer databases or peer-to-peer information retrieval, requires highly efficient approaches for overlay construction, as changing application requirements frequently lead to re-indexing of the data and hence (re-)construction of overlay networks. This problem has so far not been addressed in the literature and thus the authors describe an approach for the efficient construction of data-oriented, structured overlay networks from scratch in a self-organized way. Standard maintenance algorithms for overlay networks cannot accomplish this efficiently, as they are inherently sequential.

Provided by: Ecole Polytechnique Federale de Lausanne Topic: Data Management Date Added: Jan 2011 Format: PDF

Find By Topic