139 search results - page 3 / 28 » Compression of inverted indexes for fast query evaluation |
WISE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper proposes to exploit content and usage information to rearrange an inverted index for a full-text IR system. The idea is to merge the entries of two frequently ...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
CPM
2010
Springer
13 years 10 months ago
2010
Springer
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
WWW
2008
ACM
14 years 6 months ago
2008
ACM
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...