69 search results - page 6 / 14 » Compressed Inverted Indexes for In-Memory Search Engines |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Maintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be proc...
LREC
2008
13 years 9 months ago
2008
Web count statistics gathered from search engines have been widely used as a resource in a variety of NLP tasks. For some tasks, however, the information they exploit is not fine-...
SIGIR
2006
ACM
14 years 1 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...
CIKM
2009
Springer
14 years 3 days ago
2009
Springer
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
INFOSCALE
2007
ACM
13 years 9 months ago
2007
ACM
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...