On the complexity of bounded deletion propagation

DOI10.1007/978-3-319-48749-6_33zbMATH Open1409.68084OpenAlexW2540275979MaRDI QIDQ2958337FDOQ2958337

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

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

zbMATH Keywords

complexitydatabaseview updatebounded deletion propagation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Approximating power node-deletion problems
• SEF view deletion under bounded condition
• New results on the complexity of deletion propagation
• Title not available (Why is that?)
• Title not available (Why is that?)

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)