On the complexity and approximability of repair position selection problem

DOI10.1007/S10878-018-0362-YzbMATH Open1480.90214OpenAlexW2900713997WikidataQ128906179 ScholiaQ128906179MaRDI QIDQ2051902FDOQ2051902

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

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

zbMATH Keywords

complexityinconsistent dataRPSrepair position

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A threshold of ln n for approximating set cover
• Title not available (Why is that?)
• Title not available (Why is that?)
• The dense \(k\)-subgraph problem
• Minimal-change integrity maintenance using tuple deletions
• Answer sets for consistent query answering in inconsistent databases
• First-order query rewriting for inconsistent databases
• Title not available (Why is that?)
• Updates of Relational Views
• On the complexity of sampling query feedback restricted database repair of functional dependency violations

Cited In (4)

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

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)