WEKO3
アイテム
Compressing Inverted Index Using Optimal FastPFOR
https://ipsj.ixsq.nii.ac.jp/records/141418
https://ipsj.ixsq.nii.ac.jp/records/141418c44d3dd4-8584-448e-953d-be855297b632
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL5603033 (883.8 kB)
|
Copyright (c) 2015 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2015-03-15 | |||||||||
| タイトル | ||||||||||
| タイトル | Compressing Inverted Index Using Optimal FastPFOR | |||||||||
| タイトル | ||||||||||
| 言語 | en | |||||||||
| タイトル | Compressing Inverted Index Using Optimal FastPFOR | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| キーワード | ||||||||||
| 主題Scheme | Other | |||||||||
| 主題 | [特集：学生・若手研究者論文] Index Compression, Information Retrieval, Inverted File, FastPFOR | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | journal article | |||||||||
| 著者所属 | ||||||||||
| Department of Computer Applications, National Institute of Technology | ||||||||||
| 著者所属 | ||||||||||
| Department of Computer Applications, National Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer Applications, National Institute of Technology | ||||||||||
| 著者所属(英) | ||||||||||
| en | ||||||||||
| Department of Computer Applications, National Institute of Technology | ||||||||||
| 著者名 |
Veluchamy, Glory
× Veluchamy, Glory
× Sandanam, Domnic
|
|||||||||
| 著者名(英) |
Veluchamy, Glory
× Veluchamy, Glory
× Sandanam, Domnic
|
|||||||||
| 論文抄録 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Indexing plays an important role for storing and retrieving the data in Information Retrieval System (IRS). Inverted Index is the most frequently used indexing structure in IRS. In order to reduce the size of the index and retrieve the data efficiently, compression schemes are used, because the retrieval of compressed data is faster than uncompressed data. High speed compression schemes can improve the performance of IRS. In this paper, we have studied and analyzed various compression techniques for 32-bit integer sequences. The previously proposed compression schemes achieved either better compression rates or fast decoding, hence their decompression speed (disk access + decoding) might not be better. In this paper, we propose a new compression technique, called Optimal FastPFOR, based on FastPFOR. The proposed method uses better integer representation and storage structure for compressing inverted index to improve the decompression performance. We have used TREC data collection in our experiments and the results show that the proposed code could achieve better compression and decompression compared to FastPFOR and other existing related compression techniques. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.185 ------------------------------ |
|||||||||
| 論文抄録(英) | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Indexing plays an important role for storing and retrieving the data in Information Retrieval System (IRS). Inverted Index is the most frequently used indexing structure in IRS. In order to reduce the size of the index and retrieve the data efficiently, compression schemes are used, because the retrieval of compressed data is faster than uncompressed data. High speed compression schemes can improve the performance of IRS. In this paper, we have studied and analyzed various compression techniques for 32-bit integer sequences. The previously proposed compression schemes achieved either better compression rates or fast decoding, hence their decompression speed (disk access + decoding) might not be better. In this paper, we propose a new compression technique, called Optimal FastPFOR, based on FastPFOR. The proposed method uses better integer representation and storage structure for compressing inverted index to improve the decompression performance. We have used TREC data collection in our experiments and the results show that the proposed code could achieve better compression and decompression compared to FastPFOR and other existing related compression techniques. ------------------------------ This is a preprint of an article intended for publication Journal of Information Processing(JIP). This preprint should not be cited. This article should be cited as: Journal of Information Processing Vol.23(2015) No.2 (online) DOI http://dx.doi.org/10.2197/ipsjjip.23.185 ------------------------------ |
|||||||||
| 書誌レコードID | ||||||||||
| 収録物識別子タイプ | NCID | |||||||||
| 収録物識別子 | AN00116647 | |||||||||
| 書誌情報 |
情報処理学会論文誌 巻 56, 号 3, 発行日 2015-03-15 |
|||||||||
| ISSN | ||||||||||
| 収録物識別子タイプ | ISSN | |||||||||
| 収録物識別子 | 1882-7764 | |||||||||
