A Unique-Order Interpolative Code for Fast Querying and Space-Efficient Indexing in Information Retrieval Systems

  • Authors:
  • Cher-Sheng Cheng;Jean Jyh-Jiun Shann;Chung-Ping Chung

  • Affiliations:
  • -;-;-

  • Venue:
  • ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The word positions for any given word in the wholecollection are arranged in clusters. If we can use themethod that can take advantage of clustering, excellentresults can be achieved in compression of inverted file.However, the mechanisms of decoding in all the well-knowncompression methods that can exploit clusteringare more complex, which reduce the ability of searchingperformance in information retrieval system (IRS) atsome degree. In this paper, we proposed a new methodthat can facilitate coding and decoding of interpolativecode by using the simply applied and high-speed modelssuch as 驴 code and Golomb code in d-gap technique. Thisnew method can exploit clustering well, and theexperimental results confirm that our method can providefast decoding speed and excellent compression efficiency.