354 search results - page 8 / 71 » Approximate String Joins |
110
Voted
IGIS
1994
15 years 4 months ago
1994
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
136
Voted
CPM
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
104
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
103
Voted
ICDE
2010
IEEE
16 years 13 hour 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 ...
WIA
2005
Springer
15 years 5 months ago
2005
Springer
Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important regarding to applications. It is shown how to compu...