期刊文献+

基于邻接字符对的三元后缀树全文索引模型 被引量:1

Three Dimensional Suffix Tree Full-text Index Model Based on Adjacent Character Pair
下载PDF
导出
摘要 传统后缀树全文索引模型的索引建立复杂、难以维护,且空间消耗大。为此,提出一种改进的后缀树全文索引模型。将一棵完整后缀树划分为若干个三元后缀树,从而简化后缀树的组织结构,便于其建立和维护索引。将邻接字符对的公共前缀作为后缀树的根结点,以降低模型的空间消耗,提高查询效率。实验结果表明,与传统模型相比,该模型具有较高的时空效率。 Because of indexical high complexity of establishment,superior difficulty of maintenance and high consumption of space,an improved suffix tree full-text index model is proposed for those drawbacks of the traditional one.It divides the relatively large suffix tree into several Three Dimensional Suffix Tree(3DST).It makes the establishment and maintenance of index more convenient and faster by simplifying the structure of the suffix tree.Meanwhile,the improved model reduces the space and increases time and space efficiency by making the common prefix of Adjacent Character Pair(ACP) root node of the suffix tree.Experimental result shows that the improved model has a higher space and time efficiency than the traditional one.
出处 《计算机工程》 CAS CSCD 2012年第18期42-44,49,共4页 Computer Engineering
关键词 后缀树 全文索引 邻接字符对 三元后缀树 公共前缀 时空效率 suffix tree; full-text index; Adjacent Character Pair(ACP); Three Dimensional Suffix Tree(3DST); common prefix; time and space efficiency
  • 相关文献

参考文献8

二级参考文献37

  • 1刘小珠,孙莎,曾承,彭智勇.基于缓存的倒排索引机制研究[J].计算机研究与发展,2007,44(z3):153-158. 被引量:8
  • 2姚全珠,丁晓剑,任雪利,张志锋.一种新的基于XML的索引机制[J].计算机工程,2006,32(15):90-92. 被引量:5
  • 3[1]Zeng Haiquan, Shen Zhan, Hu Yunfa. Mining Sequence Pattern from Time Series Based on Inter-Relevant Successive Trees Model. In:Proc. of 9th. Intl. Conf. on Rough Sets, Fuzzy Sets,Data Mining and Granular Computing (RSFDGrC'2003), LNCS/LNAI, Spring-Verlag, Chongqing, China, 2003 被引量:1
  • 4[3]Knuth D E. The Art of Computer Programming, Sorting and Searching. 1st edition. Addision-Wesley Pub. Co. , 1973 被引量:1
  • 5[4]Weiner P. Linear pattern matching algorithm. In: Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973.1~11 被引量:1
  • 6[5]Manber U,Myers E. Suffix arrays: A new method for on-line string searches. In: Proc. of the FISTREE Ann. ACM-SIAM Symp. on Discrete Algorithms, 1990. 319~327 被引量:1
  • 7[6]Hu Yunfa, Zhou Shuigeng. A New Model of Chinese Full-text databases. In: Proc. World Multiconference on Systemics,Cybernetics and Informatics, Florida, USA, 2001. 528~533 被引量:1
  • 8[7]Tao Xiaopeng, Hu Yunfa, Zhou Shuigeng. Subsequent Array: A New Full Text Index. In: Proc. World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, 2001. 551~556 被引量:1
  • 9[11]Zobel J, Moffat A, Ramamohanarao K. Inverted files versus signature files for text indexing. Transactions on Database Systems,1998,23(4): 453~490 被引量:1
  • 10[12]Grossi R, Vitter J S. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extendedabstract). STOC 2000. 397~406, 1999 被引量:1

共引文献36

同被引文献27

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部