2009
DOI: 10.14778/1687627.1687674
|View full text |Cite
|
Sign up to set email alerts
|

Reasoning about record matching rules

Abstract: To accurately match records it is often necessary to utilize the semantics of the data. Functional dependencies (FDs) have proven useful in identifying tuples in a clean relation, based on the semantics of the data. For all the reasons that FDs and their inference are needed, it is also important to develop dependencies and their reasoning techniques for matching tuples from unreliable data sources. This paper investigates dependencies and their reasoning for record matching. (a) We introduce a class of matchi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
215
0
1

Year Published

2010
2010
2020
2020

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 183 publications
(216 citation statements)
references
References 30 publications
0
215
0
1
Order By: Relevance
“…The approaches are developed in the context of the classic Boolean logic. Examples of such approaches include the matching dependencies [20,22] which formalize constraints for matching records from unreliable data sources, cf. also [21].…”
Section: Related Workmentioning
confidence: 99%
“…The approaches are developed in the context of the classic Boolean logic. Examples of such approaches include the matching dependencies [20,22] which formalize constraints for matching records from unreliable data sources, cf. also [21].…”
Section: Related Workmentioning
confidence: 99%
“…2 This semantics captures as close as possible the spirit of MDs as originally, and rather informally introduced in [11], and also uncommitted in the sense that the MDs do not specify how the matchings have to be realized (also as in [11]). …”
Section: Example 2 For Schema R(a B) Consider the MD R[a] = R[a] →mentioning
confidence: 99%
“…For this, a declarative language with a precise semantics can be used. In this direction, matching dependencies (MDs) have been recently introduced [10,11]. They represent rules for resolving pairs of duplicate representations (two tuples at a time).…”
Section: Introductionmentioning
confidence: 99%
“…Closer to editing rules are matching dependencies (mds [13]). We shall elaborate their differences in Section 2.…”
Section: Contributionsmentioning
confidence: 99%
“…It is also much harder than mds, which is in quadratic-time [13]. Nevertheless, it is decidable, as opposed to the undecidability for reasoning about rules for active databases [29].…”
Section: Theorem 31: the Consistency Problem Is Conp-complete Even mentioning
confidence: 99%