Sciweavers

1098 search results - page 4 / 220
» Compressed web indexes
Sort
View
WWW
2007
ACM
15 years 10 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
CORR
2011
Springer
181views Education» more  CORR 2011»
14 years 4 months ago
Compressed String Dictionaries
The problem of storing a set of strings – a string dictionary – in compact form appears naturally in many cases. While classically it has represented a small part of the whole ...
Nieves R. Brisaboa, Rodrigo Cánovas, Miguel...
ICDE
2010
IEEE
183views Database» more  ICDE 2010»
15 years 4 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...
KAIS
2006
247views more  KAIS 2006»
14 years 9 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
DCC
2008
IEEE
15 years 9 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