On the complexity and approximability of repair position selection problem

DOI10.1007/S10878-018-0362-YMaRDI QIDQ2051902zbMATHOpenAlexWikidataFDO

Authors Xianmin Liu, Yingshu Li, Jianzhong Li, Yuqiang Feng

Publication date 25 November 2021

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-018-0362-y

zbMATH Keywords

complexityinconsistent dataRPSrepair position

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Repair position selection for inconsistent data
• Sampling query feedback restricted repairs of functional dependency violations: complexity and algorithm
• On the data complexity of consistent query answering
• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• Advances in Databases and Information Systems

Cites work

• scientific article; zbMATH DE number 1953144 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A threshold of ln n for approximating set cover
• Answer sets for consistent query answering in inconsistent databases
• First-order query rewriting for inconsistent databases
• Minimal-change integrity maintenance using tuple deletions
• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• The dense \(k\)-subgraph problem
• Updates of Relational Views

Cited in

(4)

• A sorting based efficient heuristic for pooled repair shop designs
• The multiple-job repair kit problem
• Repair position selection for inconsistent data
• A combinatorial approach to level of repair analysis

This page was built for publication: On the complexity and approximability of repair position selection problem

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