期刊文献+

高性能文本索引系统的设计与实现 被引量:1

Design and implementation of high-performance text index system
下载PDF
导出
摘要 针对传统文本索引技术空间消耗大、分词不准确等问题,设计并实现了高性能文本索引系统。该系统采用压缩的全文自索引算法,节省了空间开销,避免了自然语言分词方法的影响,配合通配符搜索算法扩展了模糊搜索的功能,在众核CPU高性能处理器上可实现多线程并行处理,提高了处理速度,整个系统的实现是基于Web方式的,可以跨平台运行。实验结果表明,该系统将文本索引的空间消耗降为原文本的50%左右,具有较高的实用价值。 The traditional text index technology has problems like oversize space consumption,inaccurate word segmentation,etc. In order to solve these problems,a high-performance text index system is designed and implemented.This system employs com-pressed full-text self-index algorithm,which helps save space and avoid influence from natural language word segmentation.Com-bined with wildcard search algorithm,its search function is enriched.And applied on high-performance processors with many-core CPU,this system can execute in a parallel multi-thread way,which increases processing speed.The entire system is Web-based,so that it can be run in different operating systems.Experimental results show that this systemhas high practical value in thatit reduces space consumption to about 50%of primary text.
出处 《中国科技论文》 CAS 北大核心 2014年第1期92-95,107,共5页 China Sciencepaper
基金 国家高技术研究发展计划(863计划)资助项目(2011AA010703) 国家自然科学基金资助项目(61202477) 中国科学院战略性先导科技专项资助项目(XD06030602) 河北省教育厅资助科研项目(QN20131164)
关键词 计算机应用 文本索引 全文索引 自索引 通配符搜索 computer application text index full-text index self-index wildcard search
  • 相关文献

参考文献13

  • 1Gusfield D. Algorithms on Strings,Trees and Se-quences:Computer Science and Computational Biology[M].{H}Cambridge:Cambridge University Press,1997.
  • 2Manber U,Myers G. Suffix arrays:a new method for on-line string searches[J].{H}SIAM Journal on Computing,1993,(05):935-948.
  • 3Ian H W,Alistair M,Timothy C B. Managing Giga-bytes:Compressing and Indexing Documents and Ima-ges[M].Los Altos:Morgan Kaufmann Publishers,1999.
  • 4Navarro G,Mkinen V. Compressed full-text indexes[J].{H}ACM COMPUTING SURVEYS,2007,(01):articleNo.2.
  • 5Ferragina P,González R,Navarro G. Com-pressed text indexes:from theory to practice[J].Jour-nal of Experimental Algorithmics,2009,(12):1-35.
  • 6Paolo F,Gonzalo N. Pizza&Chili Corpus-Compressed indexes and their testbeds[OL].ht-tp://pizzachili.dcc.uchile.cl/index.html,2013.
  • 7Sirén J,Vlimki N,Mkinen V. Run-length compressed indexes are superior for highly repetitive se-quence collections[A].Springer Berlin Heidelberg,2009.164-175.
  • 8Ferragina P,Sirén J,Venturini R. Distribution-aware compressed full-text indexes[A].{H}Springer-Verlag,2011.760-771.
  • 9Sirén J. Compressed Full-Text Indexes for Highly Re-petitive Collections[D].Helsinki:University of Hel-sinki,2012.
  • 10Gagie T,Karhu K,Navarro G. Document List-ing on Repetitive Collections[A].Springer Berlin Heidelberg,2013.107-119.

同被引文献7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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