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 we 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. Our proposed algorithm is completely decentralized, parallel, and can construct a new overlay network with short latency. At the same time it ensures good loadbalancing for skewed data key distributions which result from preserving key order relationships as necessitated by data-oriented appli...

• Type: Conference
• Year: 2005
• Where: VLDB
• Authors: Karl Aberer, Anwitaman Datta, Manfred Hauswirth, Roman Schmidt
• Keywords: Database, Overlay Network, Peer-to-Peer Information Retrieval, Structured Overlay Networks, VLDB 2005