On constructing small worlds in unstructured peer-to-peer systems

Authors:
Yannis Petrakis;Evaggelia Pitoura
Affiliations:
Department of Computer Science, University of Ioannina, Greece;Department of Computer Science, University of Ioannina, Greece
Venue:
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Year:
2004

Citing 9
Cited 4

Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Flexible Information Discovery in Decentralized Distributed Systems

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Routing Indices For Peer-to-Peer Systems

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
SETS: search enhanced by topic segmentation

Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Peer-to-peer information retrieval using self-organizing semantic overlay networks

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Symphony: distributed hashing in a small world

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4

A research agenda for query processing in large-scale peer data management systems

Information Systems
Data summaries for on-demand queries over linked data

Proceedings of the 19th international conference on World wide web
Comparing data summaries for processing live queries over Linked Data

World Wide Web
Viewpoints on emergent semantics

Journal on Data Semantics VI

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer systems have evolved as a means to share large amounts of data among autonomous nodes A central issue in this context is locating nodes with data matching a user query In this paper, we consider building peer-to-peer systems with small-world properties, that is, connecting the nodes to each other so that: (i) the distance between any two nodes is small and (ii) relevant nodes are connected to each other Relevance between nodes is defined based on the probability that the two nodes match similar queries We propose decentralized procedures for constructing small worlds based on routing indexes that describe the content of neighboring nodes Our experimental results show that small-world peer-to-peer systems built with these procedures increase recall, that is, the percentage of relevant results returned.