Compression of index term dictionary in an inverted-file-orientated database: Some effective algorithms
References (12)
A practitioner's guide to data base compression
Inf. Systems
(1983)Selection of prefix and postfix word fragments for data compression
Inf. Proc. Manage.
(1978)- et al.
A mathematical model for estimating the effectiveness of bigram coding
Inf. Proc. Manage.
(1976) - et al.
Analysis of the microstructure of titles in the Inspec database
Inf. Storage Retrieval
(1973) File Structures for On-line Systems
(1969)The comparative efficiency of two dictionary structures for document retrieval
INFOR
(1974)
There are more references available in the full text version of this article.
Cited by (7)
Managing misspelled queries in IR applications
2011, Information Processing and ManagementCitation Excerpt :Such advantageous features have not been ignored by the IR research community either (McNamee & Mayfield, 2004a; Robertson & Willett, 1998). Initially, during the 1970s and 1980s, the main interest for applying n-grams to IR was focused on the use of compression and dictionary-reduction techniques in order to reduce the demand of the at-the-time expensive disk storage resources (Schuegraf & Heaps, 1973; Willett, 1979; Wisniewski, 1986). Later, in the 90s, n-grams started to be considered as alternative indexing terms on their own (Cavnar, 1994; Damashek, 1995; Huffman, 1995).
Enhancing query retrieval efficiency using BGIT coding: Bigram based index term coding applied to Arabic language
2012, IEEE CITS 2012 - 2012 International Conference on Computer, Information and Telecommunication SystemsQuery retrieval enhancement based on Huffman index terms encoding
2012, ACM International Conference Proceeding SeriesApplications of N-grams in textual information systems
1998, Journal of DocumentationModeling word occurrences for the compression of concordances
1997, ACM Transactions on Information SystemsText compression methods
1991, Journal of Soviet Mathematics
Copyright © 1986 Published by Elsevier Ltd.