Results 261 to 270 of about 58,364 (303)
Cellulose-Based Polymer Blends for Oral Mucoadhesion: Impact of Hydration and Surface Interactions. [PDF]
Polymers (Basel)Rojewska M +6 more
europepmc +1 more source
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
core +5 more sources
Compressed index for dynamic text [PDF]
Data Compression Conference, 2004. Proceedings. DCC 2004, 2004 This paper investigates how to index a text which is subject to updates. The best solution in the literature (P.Ferragina, et al., 1998) is based on suffix tree using O(n log n) bits of storage, where n is the length of the text. It supports finding all occurrences of a pattern P in O(|P|+occ) time, where occ is the number of occurrences.
Wing-Kai Hon +4 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An experimental study of a compressed index
Information Sciences, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paolo Ferragina, Giovanni Manzini
exaly +5 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
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
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.
Francisco Claude, Gonzalo Navarro 0001
openaire +2 more sources
Compressed Index for Property Matching
2011 Data Compression Conference, 2011In this paper, we revisit the Property Matching problem and present a better indexing scheme for the problem. Let T be a text of length n with property p, and P be a pattern of length m, both strings are over a fixed finite alphabet. In particular, the existing data structures all require O(n log n)-bit space, where n is the length of the text.
Hua Zhao, Songfeng Lu
openaire +1 more source