295 search results - page 21 / 59 » Compressed full-text indexes |
147
Voted
SPIRE
2001
Springer
15 years 11 months ago
2001
Springer
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
156
click to vote
DCC
2008
IEEE
16 years 6 months ago
2008
IEEE
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to compress natural language texts. With compression ratios around 30%, they allow di...
163
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
151
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
An efficient compression scheme for color-quantized images based on progressive coding of color informationhas been developed. Rather than sorting color indexes into a linear list...
280
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...