1567 search results - page 14 / 314 » Compressing Relations and Indexes |
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Large inverted indices are by now common in the construction of web-scale search engines. For faster access, inverted indices are indexed internally so that it is possible to skip...
ALENEX
2008
13 years 8 months ago
2008
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
EDBT
2004
ACM
14 years 7 months ago
2004
ACM
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— This paper considers compression in packet networks. Since data packets may be dropped or arrive reordered, streaming compression algorithms result in a considerable de...