期刊文献+

密文动态后继树精简索引模型研究

Study of Streamline Dynamic Successive Trees Index Model for Ciphertext
下载PDF
导出
摘要 随着信息技术的发展,很多单位累积了海量的科研和生产数据,其中部分是涉密数据.如何从这些海量数据中安全且快速找到所需的涉密信息是用户面临的难题.密文索引是密文全文检索系统的核心模块,为保证在密文状态下进行高效的全文检索,提出了一种密文动态后继树精简索引模型.该索引模型支持密文子串查询、潜在分词查询和索引动态更新,具有较高的查全率和查准率;给出该模型密文索引的创建、检索、和索引密文更新算法,并对其安全性和效率进行分析.实验表明,与其他已有的索引模型相比,该模型具有较好的时间效率,更适合应用于密文全文检索领域. With the development of the information technology,Many units have accumulated mass of scientific research and production data,some of them is ciphertext,It is a problem for the users about how to find the information needed quickly and safety.Safe index is the core apartment in the full-text retrieval of ciphertext.In order to ensure the efficient full-text retrieval in the cipher text state,a streamline dynamic successive trees of ciphertext(SDSTC) index model w as proposed,the SDSTC index model supports queries of substring,queries of potential terms and dynamic updates of index,has a high recall and precision ratio in retrieval.Given algorithms of model index creation,retrieval,and ciphertext index update and the analysis of its security and efficiency.With other existing index models,experiments show that the SDSTC index model has good time efficiency and more suitable for areas of ciphertext security of full-text retrieval
作者 霍林 邢霄
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第7期1610-1614,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61064002)资助 广西壮族自治区教育厅项目(20100712)资助 广西南宁市科学技术局科技攻关项目(20100791)资助 广西大学科研基金项目(XB2100102)资助
关键词 安全索引 密文全文检索 密文动态后继树索引模型 safe index the full-text retrieval of ciphertext streamline dynamic successive trees of ciphertext
  • 相关文献

参考文献3

二级参考文献38

  • 1申展,江宝林,陈祎,唐磊,胡运发.全文检索模型综述[J].计算机科学,2004,31(5):61-64. 被引量:12
  • 2雷向欣,胡运发,杨智应,刘勇,张凯.基于互关联后继树的XML索引技术[J].计算机研究与发展,2005,42(7):1261-1271. 被引量:6
  • 3Boitsov L M. Using signature hashing for approximate string matching[ J]. Computational Mathematics and Modeling,2002, 13 (3) : 314-326.
  • 4Manber U, Myers E. Suffix arrays: a new method for on-line suing scarches[C]. In: Proc. Of the FISTREE Ann. ACM-SIAM Syrup. on Discrete Algorithms, 1990, 319-327.
  • 5Rajasekaran S, Luo J, Nick H, et al. Efficient algorithms for similarity search[J]. Journal of Combinatorial Optimization,2001, 5 (1): 125-132.
  • 6Manber U, Myers G. Suffix arrays: a new method for on-line suing searches[J]. SIAM Journal on Computing. 1993, 22(5): 935-948.
  • 7Tao Xiao-peng, Hu Yun-fa, Zhou Shui-geng. Subsequent array: a new full text index [ C ]. Proceeding World Multiconference on Systemics, Cybernetics and Informatics, Florida, USA, 2001:551- 556.
  • 8Justin Zobel, Alistair Moffat. Inverted files for text search engines [J]. ACM Computing Surveys (CSUR), 2006, 38(2).
  • 9Vo Ngoc Anh, Alistair Moffat. Inverted index compression using word-aligned binary codes[J]. Information Retrieval,2005, 8( 1 ) : 151-166.
  • 10Lampson B W.Protection[A].Proc.of The 5th Princeton Symposium on Information Science and Systems[C].Princeton,New Jersey,USA,March,1971.437-443.

共引文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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