Abstract :
In the near future, since the huge amounts of contents (-Exa byte) are distributed over the networks, not only index server searching but also Peer-to-Peer (P2P) searching has been emphasized. Typical P2P search technologies have some problems, such as low search precision ratio and traffic explosions. In this paper, with ideas of the vector space method and CAN topology, I propose a new P2P contents searching method in which a query is effectively forwarded only to contents that are semantically similar to the desired contents and not forwarded to the same peer more than once. The effect of this method is estimated analytically, and a qualitative evaluation is conducted by simulation experiments.
