139 search results - page 5 / 28 » Compression of inverted indexes for fast query evaluation |
38
Voted
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
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 ...
ALENEX
2007
13 years 9 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, ...
DAWAK
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we propose a new technique for multidimensional query processing which can be widely applied in database systems. Our new technique, called tree striping, generalize...