DEBU
2010
13 years 4 months ago
2010
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
WEBNET
2000
13 years 5 months ago
2000
: This paper presents the design criteria for an Intelligent User Interface to a search engine of an on-line document data base. The Interface is aimed at users that have little or...
VLDB
2004
ACM
13 years 9 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We resolve two open problems presented in [8]. First, we consider the problem of reconstructing an unknown string T over a fixed alphabet using queries of the form “does the st...
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...