Sciweavers

51 search results - page 4 / 11
» Alphabet-Independent Compressed Text Indexing
Sort
View
DCC
2008
IEEE
14 years 7 months ago
Word-Based Statistical Compressors as Natural Language Compression Boosters
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...
Antonio Fariña, Gonzalo Navarro, José...
CIKM
2007
Springer
14 years 1 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
SIGIR
2012
ACM
11 years 10 months ago
To index or not to index: time-space trade-offs in search engines with positional ranking functions
Positional ranking functions, widely used in web search engines, improve result quality by exploiting the positions of the query terms within documents. However, it is well known ...
Diego Arroyuelo, Senén González, Mau...
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
13 years 11 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
SPIRE
2001
Springer
13 years 12 months ago
Compaction Techniques for Nextword Indexes
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...
Dirk Bahle, Hugh E. Williams, Justin Zobel