Dynamic constraints for record matching

Dynamic constraints for record matching This paper investigates constraints for matching records from unreliable data sources. (a) We introduce a class of matching dependencies ( md s) for specifying the semantics of unreliable data. As opposed to static constraints for schema design, md s are developed for record matching, and are defined in terms of similarity predicates and a dynamic semantics . (b) We identify a special case of md s, referred to as relative candidate keys ( rck s), to determine what attributes to compare and how to compare them when matching records across possibly different relations. (c) We propose a mechanism for inferring md s, a departure from traditional implication analysis, such that when we cannot match records by comparing attributes that contain errors, we may still find matches by using other, more reliable attributes. Moreover, we develop a sound and complete system for inferring md s. (d) We provide a quadratic-time algorithm for inferring md s and an effective algorithm for deducing a set of high-quality rck s from md s. (e) We experimentally verify that the algorithms help matching tools efficiently identify keys at compile time for matching, blocking or windowing and in addition, that the md -based techniques effectively improve the quality and efficiency of various record matching methods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png The VLDB Journal Springer Journals

Dynamic constraints for record matching

Loading next page...
 
/lp/springer_journal/dynamic-constraints-for-record-matching-B0FmoQKyIX
Publisher
Springer-Verlag
Copyright
Copyright © 2011 by Springer-Verlag
Subject
Computer Science; Database Management
ISSN
1066-8888
eISSN
0949-877X
D.O.I.
10.1007/s00778-010-0206-6
Publisher site
See Article on Publisher Site

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

Monthly Plan

  • Read unlimited articles
  • Personalized recommendations
  • No expiration
  • Print 20 pages per month
  • 20% off on PDF purchases
  • Organize your research
  • Get updates on your journals and topic searches

$49/month

Start Free Trial

14-day Free Trial

Best Deal — 39% off

Annual Plan

  • All the features of the Professional Plan, but for 39% off!
  • Billed annually
  • No expiration
  • For the normal price of 10 articles elsewhere, you get one full year of unlimited access to articles.

$588

$360/year

billed annually
Start Free Trial

14-day Free Trial