期刊文献+

一种增量倒排索引结构的设计与实现 被引量:6

Design and Implementation of an Incremental Inverted Index Framework
在线阅读 下载PDF
导出
摘要 针对主题爬行器获取网页更新速度快的特点,提出一种用于网络搜索引擎的增量索引结构.在建立倒排索引时,每个词项的记录表以链接块的形式存放于倒排索引文件中,每次新分配的块大小递增.该索引结构解决了倒排索引连续存储所带来的难以更新问题.实验结果表明,与支持实时更新的传统链表式存储方式相比,这种索引结构能提供更高效的检索,采用以空间换时间的方法有效地提高了索引的更新效率. In the present paper is proposesd an incremental index structure used in web search engine in order to deal with the high update frequency of the web pages crawled by domain-specific crawler. In the inverted index structure, the posting list of each term is partitioned into linked blocks, whose sizes form an arithmetical series. The incremental index structure resolves the problem of document update, which is expensive in inverted index of continuous storage, and experimental results show that it provides much higher retrieval efficiency than naive linked list structure, which also supports real-time update. The space-for-time approach effectively raises the update rate of index.
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2007年第6期953-958,共6页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:60373099) 教育部"符号计算与知识工程"重点实验室项目基金(批准号:93K-17) 吉林省科技发展计划项目基金(批准号:20070533)
关键词 主题式搜索引擎 增量倒排索引 实时更新 domain-specific search engine incremental inverted index real-time update
  • 相关文献

参考文献8

二级参考文献29

  • 1张长利,赫枫龄,左万利.一种基于后缀数组的无词典分词方法[J].吉林大学学报(理学版),2004,42(4):548-553. 被引量:14
  • 2吴胜远.一种汉语分词方法[J].计算机研究与发展,1996,33(4):306-311. 被引量:49
  • 3M. Araujo, G. Navarro, and N. Ziviani. Large text searching allowing error. In Pro. WSP'97, pages 2-20, Valparaiso, Chile, 1997. Carleton Universily Press.
  • 4Gonnet, G.H. et al. New indices for text: PAT trees and PAT arrays, Information Relneval: Data Structure and Algorithms (Frakes, W.B. and Baeza -Yates, R.A. ( eds. ) ), Prentice - Hall, New Jersey,pp. 66-82, 1992.
  • 5C. Faloutsos, S. Christodoulakis. Description and performance analysis of signature file methods.ACM TOIS, 5(3) :237 -257, 1987.
  • 6C. Faloutsos and R. Chan. Fast text access methods for optical and large magnetic disks:design and performance comparison. In Proc. Of VLDB'88, pages 280 -293, Los Angeles, CA, USA, 1988.
  • 7Ricardo Baeza -Yates. Modem Information Retrieval. New York. ACM Press, 1999:191 -198.
  • 8HUANG De-gen, ZHU He-he, WANG Kun-lun, et al. Chinese automatic words segmentation based on maximum matching and second-maximum matching [J]. Journal of Dalian University of Technology, 1999, 39(6): 831-835. (黄德根, 朱和合, 王昆仑, 等. 基于最长次长匹配的
  • 9Manber Udi, Gene Myers. Suffix arrays: a new method for on-line string searches [J]. SIAM Journal on Computing, 1993, 22(5): 935-948.
  • 10Mikio Yamamoto, Kenneth Church. Using suffix arrays to compute term frequency and document frequency for all substrings in a corpus [J]. Association for Computational Linguistics, 2000, 27(1): 1-30.

共引文献40

同被引文献41

引证文献6

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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