Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Inverted Index Compression Using Word-Aligned Binary Codes

Inverted Index Compression Using Word-Aligned Binary Codes We examine index representation techniques for document-based inverted files, and present a mechanism for compressing them using word-aligned binary codes. The new approach allows extremely fast decoding of inverted lists during query processing, while providing compression rates better than other high-throughput representations. Results are given for several large text collections in support of these claims, both for compression effectiveness and query efficiency. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Information Retrieval Springer Journals

Inverted Index Compression Using Word-Aligned Binary Codes

Information Retrieval , Volume 8 (1) – Dec 20, 2004

Loading next page...
 
/lp/springer-journals/inverted-index-compression-using-word-aligned-binary-codes-0WbYvlsl3f

References (20)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Kluwer Academic Publishers
Subject
Computer Science; Data Structures, Cryptology and Information Theory; Management of Computing and Information Systems
ISSN
1386-4564
eISSN
1573-7659
DOI
10.1023/B:INRT.0000048490.99518.5c
Publisher site
See Article on Publisher Site

Abstract

We examine index representation techniques for document-based inverted files, and present a mechanism for compressing them using word-aligned binary codes. The new approach allows extremely fast decoding of inverted lists during query processing, while providing compression rates better than other high-throughput representations. Results are given for several large text collections in support of these claims, both for compression effectiveness and query efficiency.

Journal

Information RetrievalSpringer Journals

Published: Dec 20, 2004

There are no references for this article.