Breadth-first Minimum Spanning Tree And Hownet Lexical Semantic Similarity-based Heuristic P2p Search Technology And Realization

P2P (Peer-to-Peer) has been a concept focused in IT industry in resent years. As Moore Theorem being developed, calculating and storing ability together with adjoining bandwidth of the broad network terminal nodes (Nodes owned by ordinary consumers, mean terminal devices in general concept) gradually grow. And using P2P technique will greatly increase the utilization ration of these nodes to further improve efficiency of network, devices and information service. P2P is displaying its powerful current technical advantage in aspects such as communication online, files exchange, distributive calculation and server sharing.This dissertation is concerned about P2P searching. It is to analyze mechanism in P2P network broadcasting message to study necessity and feasibility of Gnutella network rejecting adjoining and propose broad first minimum spanning tree based on Prim algorithm and expatiate peers affiliating and quitting within the algorithm, its complexity and superiority as well as the disadvantage.The paper introduces HowNet glossary semantic similarity into P2P information retrieval system under broad first minimum spanning tree for the first time and proposes P2P heuristic searching algorithm and P2P peer information retrieval method (based on both broad first minimum spanning tree and HowNet glossary semantic similarity) and then further expatiate the algorithm to point out its disadvantage.Finally, this paper comes to the algorithms and methods proposed and prove the validity as well as feasibility.