Abstract
The effect of the Stream line Inter-relevant Successive Trees (SIRST) is great in the field of text search. In this paper, the binary SIRST will be extended to a ternary one. Whats more, we propose the method of calculating the K of K-ary SIRST. Finally, a sliding window retrieval algorithm is proposed. Experimental results show that the K-ary SIRST is more efficient than the binary one in the mass of information retrieval, and sliding window search algorithm is more efficient than the normal one.
Publisher
Trans Tech Publications, Ltd.
Reference14 articles.
1. Meng Xiaofeng, Ci Xiang. Big Data Management: Concepts, technique and Challenges. Journal of Computer Research and Development, Vol. 01 (2013), p.146.
2. SHI Ying-Jie, Meng Xiao-feng. A Survey of Query Techniques in Cloud Data Management Systems. Chinese Journal of Computers, Vol. 02 (2013), p.209.
3. MC S. Full-Text information retrieval: Introduction. Journal of the American Society for Information Science, Vol. 47 (1996), No. 2, p.261.
4. Zobel J, Moffat A. Inverted files for text search engines. ACM Computing Surveys, Vol. 38 (2006), No. 2, p.23.
5. Carterette B, Can F. Comparing inverted files and sigature files for searching a large lexicon. Information Processing and Management, Vol. 41 (2005), No. 8, p.615.