74 search results - page 3 / 15 » Dual-Sorted Inverted Lists |
ALENEX
2007
14 years 9 days 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...
SPIRE
2009
Springer
14 years 5 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, ...
WISE
2009
Springer
14 years 8 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 ...
SIGIR
2011
ACM
13 years 1 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
WWW
2007
ACM
14 years 11 months ago
2007
ACM
Sequential patterns of d-gaps exist pervasively in inverted lists of Web document collection indices due to the cluster property. In this paper the information of d-gap sequential...