On the complexity of sampling query feedback restricted database repair of functional dependency violations
From MaRDI portal
Publication:896157
DOI10.1016/J.TCS.2015.02.010zbMath1332.68042OpenAlexW2081489756MaRDI QIDQ896157
Xianmin Liu, Dongjing Miao, Jian-Zhong Li
Publication date: 11 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.010
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (11)
SEF view deletion under bounded condition ⋮ Parameterized complexity of completeness reasoning for conjunctive queries ⋮ On the Complexity of Bounded Deletion Propagation ⋮ The parameterized complexity and kernelization of resilience for database queries ⋮ Functional dependency restricted insertion propagation ⋮ New results on the complexity of deletion propagation ⋮ Recognizing the tractability in big data computing ⋮ On the complexity and approximability of repair position selection problem ⋮ On the Complexity of Insertion Propagation with Functional Dependency Constraints ⋮ Triangle edge deletion on planar glasses-free RGB-digraphs ⋮ Sampling-based approximate skyline calculation on big data
Cites Work
- Prioritized repairing and consistent query answering in relational databases
- First-order query rewriting for inconsistent databases
- Minimal-change integrity maintenance using tuple deletions
- Updates of Relational Views
- Calculating constraints on relational expression
- Update semantics of relational views
- On the correct translation of update operations on relational views
- Determining View dependencies using tableaux
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of sampling query feedback restricted database repair of functional dependency violations
