We propose a novel string search algorithm for data stored once and read many times. Our search method combines the sublinear traversal of the record (as in Boyer Moore or Knuth-M...
Witold Litwin, Riad Mokadem, Philippe Rigaux, Thom...
We present a novel language-model-based approach to reranking an initially retrieved list so as to improve precision at top ranks. Our model integrates whole-document information ...
Abstract. The retrieval of objects from a multimedia database employs a measure which defines a similarity score for every pair of objects. The measure should effectively follow th...
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...