9 search results - page 1 / 2 » Space-Constrained Gram-Based Indexing for Efficient Approxim... |
ICDE
2009
IEEE
14 years 6 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
SIGMOD
2008
ACM
14 years 4 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
ICDE
2010
IEEE
14 years 4 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 ...
SIGMOD
2009
ACM
14 years 4 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
JDA
2008
13 years 4 months ago
2008
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...