Reasoning about record matching rules

Fan, Wenfei; Jia, Xibei; Li, Jianzhong; Ma, Shuai

doi:10.14778/1687627.1687674

Cited by 177 publications

(214 citation statements)

References 30 publications

Supporting

Mentioning

214

Contrasting

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%

Monoidal functional dependencies

Vychodil

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express stronger relationships between attribute values than the ordinary FDs. In our setting, the dependencies not only express that certain values are determined by others but also express that similar values of attributes imply similar values of other attributes. We show complete axiomatization using a system of Armstrong-like rules, comment on related computational issues, and the relational vs. propositional semantics of the dependencies.

show abstract

Section: Related Workmentioning

confidence: 99%

Monoidal functional dependencies

Vychodil

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…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%

Tractable vs. Intractable Cases of Query Answering under Matching Dependencies

Bertossi

Gardezi

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Matching Dependencies (MDs) are a recent proposal for declarative entity resolution. They are rules that specify, on the basis of similarities satisfied by values in a database, what values should be considered duplicates, and have to be matched. On the basis of a chase-like procedure for MD enforcement, we can obtain clean (duplicate-free), and possibly several, resolved instances. The resolved answers to a query are invariant under the class of resolved instances. Previous work identified classes of queries and sets of MDs for which resolved query answering is tractable, with special emphasis on cyclic sets of MDs. In this work we further investigate the complexity of this problem, identifying intractable cases, and exploring the frontier between tractability and intractability. We concentrate mostly on acyclic sets of MDs. For a special case we obtain a dichotomy result relative to NP-hardness.

show abstract

“…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%

Towards certain fixes with editing rules and master data

et al. 2010

Self Cite

View full text Add to dashboard Cite

A variety of integrity constraints have been studied for data cleaning. While these constraints can detect the presence of errors, they fall short of guiding us to correct the errors. Indeed, data repairing based on these constraints may not find certain fixes that are absolutely correct, and worse, may introduce new errors when repairing the data. We propose a method for finding certain fixes, based on master data, a notion of certain regions, and a class of editing rules. A certain region is a set of attributes that are assured correct by the users. Given a certain region and master data, editing rules tell us what attributes to fix and how to update them. We show how the method can be used in data monitoring and enrichment. We develop techniques for reasoning about editing rules, to decide whether they lead to a unique fix and whether they are able to fix all the attributes in a tuple, relative to master data and a certain region. We also provide an algorithm to identify minimal certain regions, such that a certain fix is warranted by editing rules and master data as long as one of the regions is correct. We experimentally verify the effectiveness and scalability of the algorithm.

show abstract

Reasoning about record matching rules

Cited by 177 publications

References 30 publications

Monoidal functional dependencies

Monoidal functional dependencies

Tractable vs. Intractable Cases of Query Answering under Matching Dependencies

Towards certain fixes with editing rules and master data

Contact Info

Product

Resources

About