EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Distributed Caching and Adaptive Search in Multilayer P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Semantic Small World: An Overlay Network for Peer-to-Peer Search
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Robust and fast similarity search for moving object trajectories
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On the marriage of Lp-norms and edit distance
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Hi-index | 0.00 |
Partitioning a P2P network into distinct semantic clusters can efficiently increase the efficiency of searching and enhance scalability of the network. In this paper, two semantic-based self-organized algorithms aimed at taxonomy hierarchy semantic space are proposed, which can dynamically partition the network into distinct semantic clusters according to network load, with semantic relationship among data within a cluster and load balance among clusters all well maintained. The experiment indicates good performance and scalability of these two clustering algorithms.