Abstract
Given a database instance d, a self join free conjunctive query q and its result q(d), contingency set \(\mathsf {\Gamma }(q,d)\) is a set of tuples from d such that \(q(d\setminus \mathsf {\Gamma })\) is false but q(d) is true initially. Finding minimum contingency set \(\mathsf {\Gamma }_{\min }(q,d)\) is an important problem in database area. An important dichotomy for this problem was identified in the most recent result, Freire et al. showed that \({\mathsf \Gamma }_\textsf {min}(q_\triangle ,d)\) is \(\mathsf {NP}\)-\(\mathsf {complete}\) if the input query includes a triad of form “\(R_{xy},S_{yz},T_{zx}\)” in a particular manner, \(\mathsf {PTime}\) otherwise. However, we have two observations: (a) if two clauses have a common variable, then this database instance should be too complex, formally speaking, the visualization of its query result will not be of planarity, this requirement is too strict, (b) there is no limitation on the length of every circle in the visualization of the query result. This makes the previous theorem of dichotomy too weak. Therefore, the natural question is that, if the query result of input database is not of planarity or there is a fixed limitation on the length of every circle, is it \({\mathsf \Gamma }_\textsf {min}(q_\triangle ,d)\) still \(\mathsf {NP}\)-\(\mathsf {complete}\)? To this end, we strengthen the hardness result, that \({\mathsf \Gamma }_\textsf {min}(q_\triangle ,d)\) is still \(\mathsf {NP}\)-\(\mathsf {complete}\), if the input database instance is of planarity, or the maximum length of every circle is limited. Our theorems also generalize the result of triangle edge deletion problem defined on general graph into directed graph, make a contribution to graph theory.
This work is supported by the National Science Foundation (NSF) under grant NOs 1252292, 1741277 and 1704287.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Freire, C., Gatterbauer, W., Immerman, N., Meliou, A.: The complexity of resilience and responsibility for self-join-free conjunctive queries. Proc. VLDB Endow. 9(3), 180–191 (2015)
Cong, G., Fan, W., Geerts, F., Li, J., Luo, J.: On the complexity of view update analysis and its application to annotation propagation. IEEE Trans. Knowl. Data Eng. 24(3), 506–519 (2012)
Cong, G., Fan, W., Geerts, F.: Annotation propagation revisited for key preserving views. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, CIKM 2006, pp. 632–641. ACM, New York (2006)
Buneman, P., Khanna, S., Tan, W.C.: On propagation of deletions and annotations through views. In: Proceedings of the Twenty-First ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2002, pp. 150–158. ACM, New York (2002)
Kimelfeld, B., Vondrák, J., Williams, R.: Maximizing conjunctive views in deletion propagation. ACM Trans. Database Syst. 37(4), 24:1–24:37 (2012)
Kimelfeld, B.: A dichotomy in the complexity of deletion propagation with functional dependencies. In: Proceedings of the 31st Symposium on Principles of Database Systems, PODS 2012, pp. 191–202. ACM, New York (2012)
Kimelfeld, B., Vondrák, J., Woodruff, D.P.: Multi-tuple deletion propagation: approximations and complexity. Proc. VLDB Endow. 6(13), 1558–1569 (2013)
Miao, D., Liu, X., Li, J.: On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theoret. Comput. Sci. 609, 594–605 (2016)
Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 137–146. ACM, New York (1982)
Brügmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electron. Notes Discrete Math. 32, 51–58 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Miao, D., Cai, Z. (2017). A Refined Characteristic of Minimum Contingency Set for Conjunctive Query. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-71150-8_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-71149-2
Online ISBN: 978-3-319-71150-8
eBook Packages: Computer ScienceComputer Science (R0)