Sciweavers

22 search results - page 1 / 5
» Index compression is good, especially for random access
Sort
View
CIKM
2007
Springer
13 years 11 months ago
Index compression is good, especially for random access
Index compression techniques are known to substantially decrease the storage requirements of a text retrieval system. As a side-effect, they may increase its retrieval performanc...
Stefan Büttcher, Charles L. A. Clarke
DCC
2010
IEEE
13 years 11 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
13 years 11 months ago
Estimating the compression fraction of an index using sampling
—Data compression techniques such as null suppression and dictionary compression are commonly used in today’s database systems. In order to effectively leverage compression, it...
Stratos Idreos, Raghav Kaushik, Vivek R. Narasayya...
DCC
2008
IEEE
14 years 4 months ago
On Self-Indexing Images - Image Compression with Added Value
Recent advances in compressed data structures have led to the new concept of self-indexing; it is possible to represent a sequence of symbols compressed in a form that enables fas...
Veli Mäkinen, Gonzalo Navarro
ER
2009
Springer
111views Database» more  ER 2009»
13 years 11 months ago
A New Point Access Method Based on Wavelet Trees
Abstract. The development of index structures that allow ecient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been d...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...