Sciweavers

18 search results - page 2 / 4
» Inverted indexes for phrases and strings
Sort
View
SPIRE
2010
Springer
13 years 2 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
VLDB
1993
ACM
138views Database» more  VLDB 1993»
13 years 8 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
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 8 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
MM
2006
ACM
250views Multimedia» more  MM 2006»
13 years 10 months ago
Effective and efficient object-based image retrieval using visual phrases
In this paper, we draw an analogy between image retrieval and text retrieval and propose a visual phrase-based approach to retrieve images containing desired objects. The visual p...
Qing-Fang Zheng, Wei-Qiang Wang, Wen Gao
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
13 years 9 months 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