Abstract
Resilience problem is defined on a database d, given a boolean query q where q(d) is initially true, and an integer k, it is to find the tuple set d′ of smallest size such that the query result q(d∖d′) becomes false. As a potential explanation of a specified query, resilience plays a fundamental and important role in query explanation, database debugging and error tracing. Complexity results of resilience decision on relational algebraic queries have been studied previously. In this paper, we investigate the resilience decision problem on aggregation queries. New results on the hardness are provided. We show that, this problem is polynomially intractable on nested COUNT and SUM query both under data complexity and parametric complexity, and even it is NP-hard to approximate it within a constant ratio under the active domain constraint.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
