Access the full text.
Sign up today, get DeepDyve free for 14 days.
V. Anh, Owen Kretser, Alistair Moffat (2001)
Vector-space ranking with effective early termination
V. Anh, Alistair Moffat (2004)
Index Compression Using Fixed Binary Codewords
D. Harman (1994)
Overview of the Second Text REtrieval Conference (TREC-2)Inf. Process. Manag., 31
I. Witten, Alistair Moffat, T. Bell (1999)
Managing Gigabytes: Compressing and Indexing Documents and Images
W. Hersh (2001)
Managing Gigabytes—Compressing and Indexing Documents and Images (Second Edition)Information Retrieval, 4
H. Williams, J. Zobel (1999)
Compressing Integers for Fast File AccessComput. J., 42
Nick Craswell, D. Hawking (2002)
Overview of the TREC-2002 Web Track
I. Witten, Alistair Moffat, T. Bell (1999)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Michael Persin, J. Zobel, R. Sacks-Davis (1996)
Filtered Document Retrieval with Frequency-Sorted IndexesJ. Am. Soc. Inf. Sci., 47
Alistair Moffat, Lang Stuiver (2000)
Binary Interpolative Coding for Effective Index CompressionInformation Retrieval, 3
(1999)
Modern Information Retrieval
L. Rasmussen (1992)
In information retrieval: data structures and algorithms
Daniel Blandford, G. Blelloch (2002)
Index compression through document reorderingProceedings DCC 2002. Data Compression Conference
E. Moura, G. Navarro, N. Ziviani, Ricardo Baeza-Yates (2000)
Fast and flexible word searching on compressed textACM Trans. Inf. Syst., 18
G. Salton (1989)
Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer
I. Soboroff (2002)
Does WT10g look like the web?
P. Bailey, Nick Craswell, D. Hawking (2003)
Engineering a multi-purpose test collection for Web retrieval experimentsInf. Process. Manag., 39
Falk Scholer, H. Williams, J. Yiannis, J. Zobel (2002)
Compression of inverted indexes For fast query evaluation
J. Zobel, Alistair Moffat (1995)
Adding compression to a full‐text retrieval systemSoftware: Practice and Experience, 25
A. Trotman (2004)
Compressing Inverted FilesInformation Retrieval, 6
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.
Information Retrieval – Springer Journals
Published: Dec 20, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.