109 search results - page 2 / 22 » Example-driven design of efficient record matching queries |
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
This demo shows how usage information buried in query logs can play a central role in data integration and data exchange. More specifically, our system U-Map uses query logs to g...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
COLING
2010
13 years 10 days ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
CIKM
2009
Springer
13 years 9 months ago
2009
Springer
Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, a quadratic ...