868 search results - page 1 / 174 » A general compression algorithm that supports fast searching |
IPL
2006
13 years 4 months ago
2006
CPM
1999
Springer
13 years 9 months ago
1999
Springer
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
SIGIR
1998
ACM
13 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
WWW
2006
ACM
14 years 5 months ago
2006
ACM
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
SIGIR
2006
ACM
13 years 10 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...