In this paper, a new compression scheme for text is presented. The same is
efficient in giving high compression ratios and enables super fast searching
within the compressed text. Typical compression ratios of 70-80% and reducing
the search time by 80-85% are the features of this paper. Till now, a trade-off
between high ratios and searchability within compressed text has been seen. In
this paper, we show that greater the compression, faster the search. This finds
applicability in so many places where data as natural language text is present.
%0 Generic
%1 citeulike:217740
%A Khurana, Udayan
%A Koul, Anirudh
%D 2005
%K compression searching superfast text
%T Text Compression and Superfast Searching
%U http://arxiv.org/abs/cs.IR/0505056
%X In this paper, a new compression scheme for text is presented. The same is
efficient in giving high compression ratios and enables super fast searching
within the compressed text. Typical compression ratios of 70-80% and reducing
the search time by 80-85% are the features of this paper. Till now, a trade-off
between high ratios and searchability within compressed text has been seen. In
this paper, we show that greater the compression, faster the search. This finds
applicability in so many places where data as natural language text is present.
@misc{citeulike:217740,
abstract = {In this paper, a new compression scheme for text is presented. The same is
efficient in giving high compression ratios and enables super fast searching
within the compressed text. Typical compression ratios of 70-80% and reducing
the search time by 80-85% are the features of this paper. Till now, a trade-off
between high ratios and searchability within compressed text has been seen. In
this paper, we show that greater the compression, faster the search. This finds
applicability in so many places where data as natural language text is present.},
added-at = {2007-08-18T13:22:24.000+0200},
author = {Khurana, Udayan and Koul, Anirudh},
biburl = {https://www.bibsonomy.org/bibtex/229de0ac0f49858793fe1eea6896cd7a0/a_olympia},
citeulike-article-id = {217740},
description = {citeulike},
eprint = {cs.IR/0505056},
interhash = {a8150c23f14fe4e96952756c20f27e55},
intrahash = {29de0ac0f49858793fe1eea6896cd7a0},
keywords = {compression searching superfast text},
month = May,
priority = {2},
timestamp = {2007-08-18T13:22:49.000+0200},
title = {Text Compression and Superfast Searching},
url = {http://arxiv.org/abs/cs.IR/0505056},
year = 2005
}