We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
This paper describes our approach to the 2006 Adhoc Monolingual Information Retrieval run for French. The goal of our experiment was to compare the performance of a proposed stati...
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...