On the complexity of bounded deletion propagation

DOI10.1007/978-3-319-48749-6_33MaRDI QIDQ2958337zbMATH OpenOpenAlexFDO

Authors Dongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li

Publication date 1 February 2017

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-48749-6_33

zbMATH Keywords

bounded deletion propagationcomplexitydatabaseview update

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• SEF view deletion under bounded condition
• New results on the complexity of deletion propagation
• On the Complexity of Insertion Propagation with Functional Dependency Constraints
• Functional dependency restricted insertion propagation
• Theorem proving techniques for view deletion in databases

Cites work

• On the complexity of sampling query feedback restricted database repair of functional dependency violations
• On the correct translation of update operations on relational views
• Update semantics of relational views
• Updates of Relational Views

Cited in

(5)

• SEF view deletion under bounded condition
• New results on the complexity of deletion propagation
• scientific article; zbMATH DE number 1763413 (Why is no real title available?)
• scientific article; zbMATH DE number 7278081 (Why is no real title available?)
• Approximating power node-deletion problems

This page was built for publication: On the complexity of bounded deletion propagation

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