Sciweavers

69 search results - page 4 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
SIGIR
2011
ACM
12 years 10 months ago
Faster top-k document retrieval using block-max indexes
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
Shuai Ding, Torsten Suel
VLDB
1993
ACM
138views Database» more  VLDB 1993»
13 years 11 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
WWW
2007
ACM
14 years 8 months ago
Efficient Update of Indexes for Dynamically Changing Web Documents
Recent work on incremental crawling has enabled the indexed document collection of a search engine to be more synchronized with the changing World Wide Web. However, this synchron...
Lipyeow Lim, Min Wang, Sriram Padmanabhan, Jeffrey...
IPPS
2007
IEEE
14 years 1 months ago
Optimized Inverted List Assignment in Distributed Search Engine Architectures
We study efficient query processing in distributed web search engines with global index organization. The main performance bottleneck in this case is due to the large amount of i...
Jiangong Zhang, Torsten Suel
IM
2007
13 years 7 months ago
Inverted Index Support for Numeric Search
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y...