Research On P2P Searching Technology Based On Distributed Suffix Tree

With the rapid development of the internet, the amount of information onthe internet show the resources dynamics, more forms of resources, the newfeatures of the complex structure of the Internet, the traditional search techniquesappeared to be inadequate. A new generation of search technology based on thepeer-to-peer network provides a new idea to search on the internet. The searchtechnology based on the peer-to-peer network can achieve the much more breadthand depth than the traditional search technology, has a higher hit rate andeffectiveness.In this paper, firstly, we introduce the background and current situation ofthe search technology based on peer-to-peer network. Then made a detailedanalysis of traditional search technology and search technology based on peer-to-peer network technology, pointing out their advantages and disadvantages.Secondly, we introduce four differents topologies of the search technology basedon the peer-to-peer network: peer-to-peer network of centralized, fully distributedunstructured peer-to-peer network, fully distributed architecture of peer networksand hybrid peer-to-peer network. Then show a detailed description of structuredpeer-to-peer networks and unstructured peer-to-peer networks, and search basedon the flood of unstructured peer-to-peer networks search like random walk andsearch algorithm based on distributed hash table structured peer-to-peer networkslike the content-addressable network, and classics such as peer-to-peer networksearch algorithm to do the detailed analys is and comparison, summed up theirrespective strengths and weaknesses.On this basis, we introduce the coverage of the distributed suffix tree basednetwork search technology, the use of the suffix tree algorithm in a peer-to-peernetwork constructed a distributed suffix tree overlay network. Distributed suffixtree overlay network with the complexity of a good keyword sequence search capability. It is built on top of distributed hash table overlay network basis,through a distributed hash table to obtain the array, and then back to thedistributed suffix tree overlay network, distributed suffix tree coverage networkuse an array for further processing. In order to ac hieve the response to thesequence of keywords is given by the client to find the requested function. Basedon the suffix tree of peer-to-peer network search technology shows a goodindication of vocabulary between the semantics of the order, searching for large-scale distributed document in the peer-to-peer networks is very efficient.