Enforcing Relational Matching Dependencies with Datalog for Entity Resolution

11/21/2016
by   Zeinab Bahmani, et al.
0

Entity resolution (ER) is about identifying and merging records in a database that represent the same real-world entity. Matching dependencies (MDs) have been introduced and investigated as declarative rules that specify ER policies. An ER process induced by MDs over a dirty instance leads to multiple clean instances, in general. General "answer sets programs" have been proposed to specify the MD-based cleaning task and its results. In this work, we extend MDs to "relational MDs", which capture more application semantics, and identify classes of relational MDs for which the general ASP can be automatically rewritten into a stratified Datalog program, with the single clean instance as its standard model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2016

ERBlox: Combining Matching Dependencies with Machine Learning for Entity Resolution

Entity resolution (ER), an important and common data cleaning problem, i...
research
03/07/2018

A proof of the GM-MDS conjecture

The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS ...
research
12/01/2022

xEM: Explainable Entity Matching in Customer 360

Entity matching in Customer 360 is the task of determining if multiple r...
research
07/04/2016

Generic Statistical Relational Entity Resolution in Knowledge Graphs

Entity resolution, the problem of identifying the underlying entity of r...
research
04/23/2018

Some New Constructions of Quantum MDS Codes

It is an important task to construct quantum MDS codes with good paramet...
research
06/01/2018

Pattern Search MDS

We present a novel view of nonlinear manifold learning using derivative-...
research
03/26/2021

Mobile Data Service Adoption and Use from a Service Supply Perspective: An Empirical Investigation

The paper presents the findings of an empirical study of the views of a ...

Please sign up or login with your details

Forgot password? Click here to reset