期刊文献+

倒排文档压缩技巧d-gaps的改进——文档标识号重置法

Improve the d-gaps Technique for Inverted File Compression: Document Identifier Reassignment
下载PDF
导出
摘要 倒排文档是信息检索系统中最普遍使用的索引机制 ,而索引文件的压缩能大大提高检索速度和节约磁盘空间。倒排文件压缩的传统做法是文档 (标识号 )间距法 (d- gaps)。然而 ,剧烈变化的间距值并不能被著名的前缀自由代码有效编码压缩。为了使间距值得到有效的压缩 ,本文设计了一个文档标识号重置法。模拟试验表明能更有效压缩 d- gaps倒排文档。 The inverted file is the most popular indexing mechanism in an information retrieval system. Compressing an inverted file can greatly improve document search rate and save disk space. Traditionally, the d-gaps technique is used in the inverted file compression by replacing document identifiers with usually much smaller gap values. However, fluctuating gap values cannot be efficiently compressed by some well-known prefix-free codes. In this paper, a document identifier reassignment algorithm is proposed to reduce the gap values. Simulation results show that the average gap values of the inverted files can be reduced effectively.
作者 张爱红
出处 《现代图书情报技术》 CSSCI 北大核心 2004年第8期61-65,共5页 New Technology of Library and Information Service
关键词 倒排文档 文档(标识号)间距法 文档标识号重置法 旅行商问题 贪心算法 最大生成树 Inverted file d-gaps Document identifier reassignment TSP (Traveling Salesman Problem) The greedy algorithm MaxST
  • 相关文献

参考文献16

二级参考文献40

  • 1杨忠,鲍明,张阿舟.求解中国旅行商问题的新结果[J].数据采集与处理,1993,8(3):177-184. 被引量:10
  • 2傅清洋 王晓东.算法与数据结构[M].北京:电子工业出版社,1998..
  • 3[1]Apostolopoulos G,Guerin R,Kamat S et al. QoS routing mechanisms and OSPF extensions. Internet Engineering Task Force,RFC No. 2676,1999
  • 4[2]Chen S, Nahrsted K. An overview of quality of service routing for next-generation high-speed networks: Problems and solutions. IEEE Network,1998,64-79
  • 5[3]Cormen T, Leiserson C, Rivest R. Introduction to Algorithms. Cambridge,MA: MIT Press,1990
  • 6[4]Edmonds J, Karp R M. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of ACM, 1972,19(2):248-264
  • 7[5]Fredman M, Tarjan R. Fibonancci heaps and their uses in improved network optimization problems. Journal of ACM, 1987,34(3):596-615
  • 8[6]Gabow H, Galil Z, Spencer T et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica,1986,6:109-122
  • 9[7]Guerin R, Orda A. QoS-based routing in networks with inaccurate information: Theory and algorithms. IEEE/ACM Trans Networking,1999,7(3):350-364
  • 10[8]Guerin R, Orda A, Williams D. QoS routing mechanisms and OSPF Extensions.In: Proc 2nd IEEE Global Internet Mini-Conference,Phoenix,AZ,1997:1903-1908

共引文献41

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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