ABSTRACT
A classical variant of the view-update problem is deletion propagation, where tuples from the database are deleted in order to realize a desired deletion of a tuple from the view. This operation may cause a (sometimes necessary) side effect---deletion of additional tuples from the view, besides the intentionally deleted one. The goal is to propagate deletion so as to maximize the number of tuples that remain in the view. In this paper, a view is defined by a self-join-free conjunctive query (sjf-CQ) over a schema with functional dependencies. A condition is formulated on the schema and view definition at hand, and the following dichotomy in complexity is established. If the condition is met, then deletion propagation is solvable in polynomial time by an extremely simple algorithm (very similar to the one observed by Buneman et al.). If the condition is violated, then the problem is NP-hard, and it is even hard to realize an approximation ratio that is better than some constant; moreover, deciding whether there is a side-effect-free solution is NP-complete. This result generalizes a recent result by Kimelfeld et al., who ignore functional dependencies. For the class of sjf-CQs, it also generalizes a result by Cong et al., stating that deletion propagation is in polynomial time if keys are preserved by the view.
- F. Bancilhon and N. Spyratos. Update semantics of relational views. ACM Trans. Database Syst., 6(4):557--575, 1981. Google Scholar
Digital Library
- C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718--741, 1984. Google Scholar
Digital Library
- P. Buneman, S. Khanna, and W. C. Tan. On propagation of deletions and annotations through views. In PODS, pages 150--158, 2002. Google Scholar
Digital Library
- G. Cong, W. Fan, and F. Geerts. Annotation propagation revisited for key preserving views. In CIKM, pages 632--641, 2006. Google Scholar
Digital Library
- G. Cong, W. Fan, F. Geerts, J. Li, and J. Luo. On the complexity of view update analysis and its application to annotation propagation. IEEE Trans. Knowl. Data Eng., 24(3):506--519, 2012. Google Scholar
Digital Library
- S. S. Cosmadakis and C. H. Papadimitriou. Updates of relational views. J. ACM, 31(4):742--760, 1984. Google Scholar
Digital Library
- Y. Cui and J. Widom. Run-time translation of view tuple deletions using data lineage. Technical report, Stanford University, 2001. http://dbpubs.stanford.edu:8090/pub/2001-24.Google Scholar
- N. N. Dalvi, K. Schnaitter, and D. Suciu. Computing query probability with incidence algebras. In PODS, pages 203--214, 2010. Google Scholar
Digital Library
- N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB J., 16(4):523--544, 2007. Google Scholar
Digital Library
- U. Dayal and P. A. Bernstein. On the correct translation of update operations on relational views. ACM Trans. Database Syst., 7(3):381--416, 1982. Google Scholar
Digital Library
- R. Fagin, J. D. Ullman, and M. Y. Vardi. On the semantics of updates in databases. In PODS, pages 352--365. ACM, 1983. Google Scholar
Digital Library
- A. M. Keller. Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In PODS, pages 154--163. ACM, 1985. Google Scholar
Digital Library
- B. Kimelfeld. A dichotomy in the complexity of deletion propagation with functional dependencies (extended version). Accessible from the author's home page, 2012.Google Scholar
- B. Kimelfeld, J. Vondrák, and R. Williams. Maximizing conjunctive views in deletion propagation. In PODS, pages 187--198, 2011. Google Scholar
Digital Library
- P. G. Kolaitis and E. Pema. A dichotomy in the complexity of consistent query answering for queries with two atoms. In press, 2011.Google Scholar
- D. Maslowski and J. Wijsen. On counting database repairs. In LID, pages 15--22, 2011. Google Scholar
Digital Library
- A. Meliou, W. Gatterbauer, J. Y. Halpern, C. Koch, K. F. Moore, and D. Suciu. Causality in databases. IEEE Data Eng. Bull., 33(3):59--67, 2010.Google Scholar
- A. Meliou, W. Gatterbauer, K. F. Moore, and D. Suciu. The complexity of causality and responsibility for query answers and non-answers. PVLDB, 4(1):34--45, 2010. Google Scholar
Digital Library
Index Terms
A dichotomy in the complexity of deletion propagation with functional dependencies
Recommendations
Maximizing Conjunctive Views in Deletion Propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) deletion of additional tuples from the view, besides the intentionally deleted ...
Maximizing conjunctive views in deletion propagation
PODS '11: Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsIn deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) deletion of additional tuples from the view, besides the intentionally deleted ...
A Dichotomy for Real Weighted Holant Problems
CCC '12: Proceedings of the 2012 IEEE Conference on Computational Complexity (CCC)Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as #CSP and Graph Homomorphism. An effective dichotomy for such frameworks can immediately settle the complexity of all ...






Comments