Database Repairing with Soft Functional Dependencies

Author:

Carmeli Nofar1ORCID,Grohe Martin2ORCID,Kimelfeld Benny3ORCID,Livshits Ester4ORCID,Tibi Muhammad3ORCID

Affiliation:

1. Inria, LIRMM, Univ Montpellier, CNRS, Montpellier, France

2. RWTH Aachen University, Aachen, Germany

3. Technion – Israel Institute of Technology, Haifa, Israel

4. University of Edinburgh, Edinburgh, UK

Abstract

A common interpretation of soft constraints penalizes the database for every violation of every constraint, where the penalty is the cost (weight) of the constraint. A computational challenge is that of finding an optimal subset: a collection of database tuples that minimizes the total penalty when each tuple has a cost of being excluded. When the constraints are strict (i.e., have an infinite cost), this subset is a “cardinality repair” of an inconsistent database; in soft interpretations, this subset corresponds to a “most probable world” of a probabilistic database, a “most likely intention” of a probabilistic unclean database, and so on. Within the class of functional dependencies, the complexity of finding a cardinality repair is thoroughly understood. Yet, very little is known about the complexity of finding an optimal subset for the more general soft semantics. The work described in this manuscript makes significant progress in that direction. In addition to general insights about the hardness and approximability of the problem, we present algorithms for two special cases (and some generalizations thereof): a single functional dependency, and a bipartite matching. The latter is the problem of finding an optimal “almost matching” of a bipartite graph where a penalty is paid for every lost edge and every violation of monogamy. For these special cases, we also investigate the complexity of additional computational tasks that arise when the soft constraints are used as a means to represent a probabilistic database in the case of a probabilistic unclean database.

Funder

Israel Science Foundation

German Research Foundation

Publisher

Association for Computing Machinery (ACM)

Reference37 articles.

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network Flows - Theory, Algorithms and Applications. Prentice Hall.

2. Large-Scale Deduplication with Constraints Using Dedupalog

3. Nofar Carmeli Martin Grohe Benny Kimelfeld Ester Livshits and Muhammad Tibi. 2021. Database repairing with soft functional dependencies. In 24th International Conference on Database Theory (ICDT 2021) Schloss Dagstuhl-Leibniz-Zentrum für Informatik.

4. On the relative trust between inconsistent data and inaccurate constraints

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3