Counting subset repairs with functional dependencies

DOI10.1016/J.JCSS.2020.10.001zbMATH Open1485.68089OpenAlexW3110372784WikidataQ114162796 ScholiaQ114162796MaRDI QIDQ2221807

Jef Wijsen, Benny Kimelfeld, Ester Livshits

Publication date: 2 February 2021

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2020.10.001

zbMATH Keywords

inconsistent databasesfunctional dependenciesrepairconflict graphrepair countingsubset repair

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• Measuring Consistency Gain and Information Loss in Stepwise Inconsistency Resolution
• On the measure of conflicts: Shapley inconsistency values
• Complement reducible graphs
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The complexity of counting in sparse, regular, and planar graphs
• Minimum Covers in Relational Database Model
• A dichotomy in the complexity of counting database repairs
• Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
• Repair-based degrees of database inconsistency
• Analysing inconsistent information using distance-based measures

This page was built for publication: Counting subset repairs with functional dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221807)