Results 241 to 250 of about 484,851 (292)
Some of the next articles are maybe not open access.
Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, 2007
Recently [Manning et al., 2007] resorted the Permuterm indexof Garfield (1976) as a time-efficient and elegant solution to the string dictionary problem in which pattern queries may possibly include one wild-card symbol (called, Tolerant Retrieval problem).
FERRAGINA, PAOLO, VENTURINI, ROSSANO
openaire +4 more sources
Recently [Manning et al., 2007] resorted the Permuterm indexof Garfield (1976) as a time-efficient and elegant solution to the string dictionary problem in which pattern queries may possibly include one wild-card symbol (called, Tolerant Retrieval problem).
FERRAGINA, PAOLO, VENTURINI, ROSSANO
openaire +4 more sources
Proceedings of the 18th international conference on World wide web, 2009
Web search engines use indexes to efficiently retrieve pages containing specified query terms, as well as pages linking to specified pages. The problem of compressed indexes that permit such fast retrieval has a long history. We consider the problem: assuming that the terms in (or links to) a page are generated from a probability distribution, how well
CHIERICHETTI, FLAVIO +2 more
openaire +2 more sources
Web search engines use indexes to efficiently retrieve pages containing specified query terms, as well as pages linking to specified pages. The problem of compressed indexes that permit such fast retrieval has a long history. We consider the problem: assuming that the terms in (or links to) a page are generated from a probability distribution, how well
CHIERICHETTI, FLAVIO +2 more
openaire +2 more sources
Self-Indexed Grammar-Based Compression [PDF]
Fundamenta Informaticae, 2011 Self-indexes aim at representing text collections in a compressed format that allows extracting arbitrary portions and also offers indexed searching on the collection. Current self-indexes are unable of fully exploiting the redundancy of highly repetitive text collections that arise in several applications.
Claude, Francisco, Navarro, Gonzalo
openaire +2 more sources
When indexing equals compression
ACM Transactions on Algorithms, 2006We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in practice. Our experiments indicate that the resulting text index offers state-of-the-art compression.
FOSCHINI L +3 more
openaire +1 more source
2011
The compressibility properties of Zagreb-area clays are evaluated based on oedometer consolidation test results for 177 undisturbed samples tested in the period between 2002 and 2007. The compression Cc and recompression Cr indexes are statistically correlated (linear regression) with the corresponding classification index properties.
Bradvica I., Mitrović G.
openaire +1 more source
The compressibility properties of Zagreb-area clays are evaluated based on oedometer consolidation test results for 177 undisturbed samples tested in the period between 2002 and 2007. The compression Cc and recompression Cr indexes are statistically correlated (linear regression) with the corresponding classification index properties.
Bradvica I., Mitrović G.
openaire +1 more source
INDEXING OF COMPRESSED TIME SERIES
2004We describe a procedure for identifying major minima and maxima of a time series, and present two applications of this procedure. The first application is fast compression of a series, by selecting major extrema and discarding the other points. The compression algorithm runs in linear time and takes constant memory.
Fink, Eugene, Pratt, Kevin B.
openaire +2 more sources
Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, 2017
Techniques for effectively representing the postings lists associated with inverted indexes have been studied for many years. Here we combine the recently developed "asymmetric numeral systems" (ANS) approach to entropy coding and a range of previous index compression methods, including VByte, Simple, and Packed.
Alistair Moffat, Matthias Petri
openaire +1 more source
Techniques for effectively representing the postings lists associated with inverted indexes have been studied for many years. Here we combine the recently developed "asymmetric numeral systems" (ANS) approach to entropy coding and a range of previous index compression methods, including VByte, Simple, and Packed.
Alistair Moffat, Matthias Petri
openaire +1 more source
Techniques for index compression
[1991] Proceedings. Data Compression Conference, 2002Summary form only given. This paper considers the size of indexes, provides a formal definition of an index, describes three possible representations of indexes (list, array and tree) and identifies various techniques currently used for index compression. >
E.L. Ivie, J.J. Ekstrom
openaire +1 more source