274 search results - page 20 / 55 » Approximating Edit Distance Efficiently |
SEMWEB
2010
Springer
13 years 7 months ago
2010
Springer
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
VLDB
2007
ACM
14 years 10 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 ...
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
CIKM
2000
Springer
14 years 2 months ago
2000
Springer
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...