Presentation 1999/7/22
Efficient Compression of Inverted Files and Suffix Arrays
KUNIHIKO SADAKANE, HIROSHI IMAI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We propose word-based block sorting, which is used for compressing both texts and their full-text indexes, inverted files. Since texts are separated into words, morphological analysis, which is time consuming, is not necessary in the decoder. By using the proposed compression scheme, we can reduce space for storing full-text indexes and a load for transferring them via network. We also propose an algorithm for creating an inverted file from a compressed file by the ordinary block sorting which has better compression ratio than the word-based block sorting.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # DE99-40
Date of Issue

Conference Information
Committee DE
Conference Date 1999/7/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Efficient Compression of Inverted Files and Suffix Arrays
Sub Title (in English)
Keyword(1)
1st Author's Name KUNIHIKO SADAKANE
1st Author's Affiliation Department of Information Science, University of Tokyo()
2nd Author's Name HIROSHI IMAI
2nd Author's Affiliation Department of Information Science, University of Tokyo
Date 1999/7/22
Paper # DE99-40
Volume (vol) vol.99
Number (no) 202
Page pp.pp.-
#Pages 6
Date of Issue