ABSTRACT
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 one. The complexity of deletion propagation is studied, where the view is defined by a conjunctive query (CQ), and the goal is to maximize the number of tuples that remain in the view. Buneman et al. showed that for some simple CQs, this problem can be solved by a trivial algorithm. This paper identifies additional cases of CQs where the trivial algorithm succeeds, and in contrast, it proves that for some other CQs the problem is NP-hard to approximate better than some constant ratio. In fact, this paper shows that among the CQs without self joins, the hard CQs are exactly the ones that the trivial algorithm fails on. In other words, for every CQ without self joins, deletion propagation is either APX-hard or solvable by the trivial algorithm.
The paper then presents approximation algorithms for certain CQs where deletion propagation is APX-hard. Specifically, two constant-ratio (and polynomial-time) approximation algorithms are given for the class of star CQs without self joins. The first algorithm is a greedy algorithm, and the second is based on randomized rounding of a linear program. While the first algorithm is more efficient, the second one has a better approximation ratio. Furthermore, the second algorithm can be extended to a significant generalization of star CQs. Finally, the paper shows that self joins can have a major negative effect on the approximability of the problem.
- S. Balakrishnan, V. Chu, M. A. Hernández, H. Ho, R. Krishnamurthy, S. Liu, J. Pieper, J. S. Pierce, L. Popa, C. Robson, L. Shi, I. R. Stanoi, E. L. Ting, S. Vaithyanathan, and H. Yang. Midas: integrating public financial data. In SIGMOD Conference, pages 1187--1190. ACM, 2010. Google Scholar
Digital Library
- 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, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. J. ACM, 30(3):479--513, 1983. 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. ACM, 2002. Google Scholar
Digital Library
- G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint (extended abstract). In IPCO, volume 4513 of Lecture Notes in Computer Science, pages 182--196. Springer, 2007. Google Scholar
Digital Library
- G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a submodular set function subject to a matroid constraint. SIAM Journal on Computing, special issue on ACM STOC 2008, to appear. Google Scholar
Digital Library
- M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. In PODS, pages 171--176. ACM, 1982. Google Scholar
Digital Library
- G. Cong, W. Fan, and F. Geerts. Annotation propagation revisited for key preserving views. In CIKM, pages 632--641. ACM, 2006. 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
- 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. Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM, 30(3):514--550, 1983. Google Scholar
Digital Library
- R. Fagin. Combining fuzzy information from multiple systems. J. Comput. Syst. Sci., 58(1):83--99, 1999. Google Scholar
Digital Library
- R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 66(4):614--656, 2003. 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
- M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42(6):1115--1145, 1995. Google Scholar
Digital Library
- V. Guruswami. Inapproximability results for set splitting and satisfiability problems with no mixed clauses. Algorithmica, 38(3):451--469, 2003.Google Scholar
Digital Library
- V. Guruswami and S. Khot. Hardness of max 3SAT with no mixed clauses. In IEEE Conference on Computational Complexity, pages 154--162. IEEE Computer Society, 2005. Google Scholar
Digital Library
- H. J. Karloff and U. Zwick. A 7/8-approximation algorithm for max 3sat? In FOCS, pages 406--415, 1997. 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, J. Vondrák, and R. Williams. Maximizing conjunctive views in deletion propagation (extended version). Accessible at the first author's home page, 2011.Google Scholar
- J. Lechtenbörger and G. Vossen. On the computation of relational view complements. ACM Trans. Database Syst., 28(2):175--208, 2003. Google Scholar
Digital Library
- B. Liu, L. Chiticariu, V. Chu, H. V. Jagadish, and F. Reiss. Automatic rule refinement for information extraction. PVLDB, 3(1):588--597, 2010. Google Scholar
Digital Library
- 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, 2011. Google Scholar
Digital Library
- E. Riloff and R. Jones. Learning dictionaries for information extraction by multi-level bootstrapping. In AAAI/IAAI, pages 474--479, 1999. Google Scholar
Digital Library
- M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 137--146. ACM, 1982. Google Scholar
Digital Library
Index Terms
Maximizing conjunctive views in deletion propagation
Recommendations
A dichotomy in the complexity of deletion propagation with functional dependencies
PODS '12: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database SystemsA 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 ...
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 ...
New Results on the Complexity of Deletion Propagation
Algorithmic Aspects in Information and ManagementAbstractThe problem of deletion propagation in relational database has been studied in database community for decades, where tuples are deleted from the source database in order to realize a desired removal of tuples from the result of a certain query. ...






Comments