Counting subset repairs with functional dependencies

DOI10.1016/j.jcss.2020.10.001zbMath1485.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

repairfunctional dependenciesinconsistent databasesconflict graphrepair countingsubset repair

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

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

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