Search Algorithm of Inter-relevant Successive Trees Based on Successive Parts

The key research work on full-text index is the search model and the efficient search algorithm upon model,with inter-relevant successive trees of excellent full-text search model,this paper presents a search algorithm based on successive parts,which accelerates the full-text search rate,and demonstrates the advantages of inter-relevant successive trees in full-text domain.