55 search results - page 5 / 11 » Fast index for approximate string matching |
162
click to vote
ICDE
2010
IEEE
16 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 ...
157
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
255
Voted
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
In this paper, we describe the design, architecture, and the lessons learned from the implementation of a fast regular expression indexing engine FREE. FREE uses a prebuilt index ...
243
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
168
click to vote
ALGORITHMICA
2005
15 years 5 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...