GlOSS: text-source discovery over the Internet
ACM Transactions on Database Systems (TODS)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On scaling latent semantic indexing for large peer-to-peer systems
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
PlanetSim: a new overlay network simulation framework
SEM'04 Proceedings of the 4th international conference on Software Engineering and Middleware
Improved search latency in peer to peer networks with content links
IMSAA'09 Proceedings of the 3rd IEEE international conference on Internet multimedia services architecture and applications
Hi-index | 0.00 |
In order for peer-to-peer (P2P) content sharing network to be scalable, it is imperative to efficiently route queries through the network. Semantic based search should, with as little messages (traffic) as possible, return just those relevant documents stored throughout the network thus achieving precision and recall values comparable to those of correspondent centralized system. In this article we propose protocols for self-organizing P2P network that arranges links between peers according to peer's content. In proposed network peers organize themselves into "semantic communities" but without losing links to other semantic communities. Proposed network has no prior knowledge of the semantics of documents that are to be stored in the system.