Sciweavers

51 search results - page 3 / 11
» Web data integration using approximate string join
Sort
View
DEBU
2010
108views more  DEBU 2010»
13 years 5 months ago
Weighted Set-Based String Similarity
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...
Marios Hadjieleftheriou, Divesh Srivastava
SBBD
2007
149views Database» more  SBBD 2007»
13 years 6 months ago
Embedding Similarity Joins into Native XML Databases
Similarity joins in databases can be used for several important tasks such as data cleaning and instance-based data integration. In this paper, we explore ways how to support such ...
Leonardo Ribeiro, Theo Härder
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 5 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
ICDE
2008
IEEE
152views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Merging and Filtering Algorithms for Approximate String Searches
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
Chen Li, Jiaheng Lu, Yiming Lu
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
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...
Xiaochun Yang, Bin Wang, Chen Li