Sciweavers

1567 search results - page 28 / 314
» Compressing Relations and Indexes
Sort
View
SIGIR
2012
ACM
11 years 11 months ago
Optimizing positional index structures for versioned document collections
Versioned document collections are collections that contain multiple versions of each document. Important examples are Web archives, Wikipedia and other wikis, or source code and ...
Jinru He, Torsten Suel
WWW
2008
ACM
14 years 9 months ago
Application of bitmap index to information retrieval
To solve this problem, we devised the HS-bitmap index, which is hierarchically comprised of compressed data of summary bits. A summary bit in an upper matrix is obtained by logical...
Kengo Fujioka, Yukio Uematsu, Makoto Onizuka
LCPC
2000
Springer
14 years 17 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
SIGIR
2012
ACM
11 years 11 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...
ER
2009
Springer
111views Database» more  ER 2009»
14 years 3 months ago
A New Point Access Method Based on Wavelet Trees
Abstract. The development of index structures that allow ecient retrieval of spatial objects has been a topic of interest in the last decades. Most of these structures have been d...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...