PAT array is a new full-text indexing structure . In this paper ,we discuss it’s feasibility to chinese full-text indexing and propose our new algorithm of constructing PAT arrays. According to the theoretic analysis and the experiment result, the new algorithm has better performance .
江华,赵建新,王海岚. PAT数组全文检索技术的研究与改进[J]. 现代图书情报技术, 2005, 21(8): 37-41.
Jiang Hua,Zhao Jianxin,Wang Hailan. Research on a Full\|text Indexing Structure of PAT Array. New Technology of Library and Information Service, 2005, 21(8): 37-41.
1U.Manber and G.Myers. Suffix array:a new method for on-line string searches. SIAM journal on Computing, 1993:319-327
2K.Sadakane. A fast algorithm for making suffix arrays and for burrows-wheeler transformation. Proc. IEEE Data Compression Conference, 1998:129-138
3J.L.Bentley, R.Sedgewick. Fast algorithms for sorting and searching strings. Proc. the 8th Annual ACM SIAM Symposium on Descrete Algorithms, 1997:360-369
4陶晓鹏,胡运发,张锦. PAT数组创建算法的研究.计算机研究与发展,2000(7)
5刘学文,陶晓鹏,于玉,胡运发.一种全新的全文索引模型--后继数组模型.软件学报,2002(13)
6殷人昆等著. 数据结构(用面向对象方法与C++描述).北京:清华大学出版社,1999