Sciweavers

74 search results - page 8 / 15
» Dual-Sorted Inverted Lists
Sort
View
INFOSCALE
2007
ACM
15 years 3 months ago
Mining query logs to optimize index partitioning in parallel web search engines
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 ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 5 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
IR
2000
15 years 1 months ago
Adding Compression to Block Addressing Inverted Indexes
Inverted index compression, block addressing and sequential search on compressed text are three techniques that have been separately developed for e cient, low-overhead text retrie...
Gonzalo Navarro, Edleno Silva de Moura, Marden S. ...
ICCV
2003
IEEE
16 years 3 months ago
Video Google: A Text Retrieval Approach to Object Matching in Videos
We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined object in a video. The object is represented by a set...
Josef Sivic, Andrew Zisserman
128
Voted
ADC
2008
Springer
135views Database» more  ADC 2008»
15 years 8 months ago
Faster Path Indexes for Search in XML Data
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
Nils Grimsmo