5 search results - page 1 / 1 » Distribution-Aware Compressed Full-Text Indexes |
ESA
2011
Springer
12 years 4 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
CPM
2006
Springer
13 years 8 months ago
2006
Springer
ALENEX
2008
13 years 5 months ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
VLDB
1993
ACM
13 years 8 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
JEA
2008
13 years 4 months ago
2008
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...