10 search results - page 1 / 2 » An Improvement and an Extension on the Hybrid Index for Appr... |
SPIRE
2004
Springer
13 years 10 months ago
2004
Springer
SPIRE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
SPIRE
1998
Springer
13 years 9 months ago
1998
Springer
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
ICDE
2010
IEEE
14 years 5 months ago
2010
IEEE
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 ...