Sciweavers

69 search results - page 3 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
SIGIR
2009
ACM
14 years 9 days ago
Compressing term positions in web indexes
Large search engines process thousands of queries per second on billions of pages, making query processing a major factor in their operating costs. This has led to a lot of resear...
Hao Yan, Shuai Ding, Torsten Suel
SIGIR
2011
ACM
12 years 8 months ago
Inverted indexes for phrases and strings
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...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...
ECIR
2011
Springer
12 years 9 months ago
SkipBlock: Self-indexing for Block-Based Inverted List
In large web search engines the performance of Information Retrieval systems is a key issue. Block-based compression methods are often used to improve the search performance, but c...
Stéphane Campinas, Renaud Delbru, Giovanni ...
CIKM
2010
Springer
13 years 4 months ago
Improved index compression techniques for versioned document collections
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...
Jinru He, Junyuan Zeng, Torsten Suel
SPIRE
2010
Springer
13 years 4 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi