Research Of Personalized Search Based On Trie Tree

Search engine is a way for the majority of Internet users more convenient and fast access to information in the massive database of instant search for the search system.Through the investigation of the relevant background of the search engine,found that the current search engine has been unable to adapt to different industries in different industries.For different areas,the comprehensive search engine will be ambiguous and inefficient problems,so this paper presents a personalized search engine TheThe main work of this paper is as follows:First,because Trie tree has good prefix query efficiency and compact spatial structure,it is determined that the traditional tuple algorithm based on Trie tree is too expensive for the traditional triad Trie,and it is only suitable for English And then further proposed a decision algorithm used to choose to completely reallocate the Trie tree node or redefine the current node.By adding the current position state to the Trie tree and the suffix child node table,the time complexity of the decision can be O(1).Second,the double segment matching algorithm is not suitable for the multipattern matching problem.The multi-pattern matching algorithm is investigated and combined with the double array Trie tree using the AC automata algorithm.This paper designs a double array Trie tree AC algorithm,and the reassignment decision if the matching amount of this factor,the algorithm more adapt to multi-mode matching.Thirdly,the definition of user's browsing behavior is defined.This paper presents a calculation model of user interest and behavior factors,and uses two kinds of word worders proposed by text to query the keywords in the document,Interest in the query model,the establishment of a personalized search engine structure.Fourthly,based on Solr's personalized search engine system,and using 1000 Chinese word segmentation confused word test cases,through the experiment to verify the proposed Chinese word segmentation algorithm and the traditional Chinese word segmentation IK Analyzer comparison,and then two based on Trie Tree segmentation algorithm for Chinese and English test text comparison.The results show that the improved Chinese word segmentation algorithm has different degrees of accuracy,recall rate and F value.Through this article's personalized search engine tool,you can solve the individual industry or theme search engine personalized development needs,and has a very good availability.