Sciweavers

69 search results - page 7 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
WWW
2003
ACM
14 years 8 months ago
Dynamic maintenance of web indexes using landmarks
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...
DEXA
2010
Springer
230views Database» more  DEXA 2010»
13 years 4 months ago
Hybrid Indexing and Seamless Ranking of Spatial and Textual Features of Web Documents
Abstract. There is a significant commercial and research interest in locationbased web search engines. Given a number of search keywords and one or more locations that a user is in...
Ali Khodaei, Cyrus Shahabi, Chen Li
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
14 years 8 days ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
SIGIR
2011
ACM
12 years 10 months ago
Faster temporal range queries over versioned text
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
Jinru He, Torsten Suel
PDP
2008
IEEE
14 years 1 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín