Some Aspects of the Database Resilience

The resilience problem for a Boolean query in a database is the task of finding a minimum set of tuples that, when deleted from the database, turns the query evaluation false. We examine the parameterized complexity of a particular version of this problem for fixed queries. A natural parameter for t...

Full description

Saved in:
Bibliographic Details
Published inTheoretical Aspects of Computing - ICTAC 2021 Vol. 12819; pp. 39 - 46
Main Authors Bustamante, Luis Henrique, Martins, Ana Teresa
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2021
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Conjunctive query
Database resilience
Parameterized complexity
Online AccessGet full text

Cover

More Information
Summary:The resilience problem for a Boolean query in a database is the task of finding a minimum set of tuples that, when deleted from the database, turns the query evaluation false. We examine the parameterized complexity of a particular version of this problem for fixed queries. A natural parameter for this problem is the number of tuples needed to be deleted. For this, we use a formal characterization of the solution set that proves the W[1] membership for this parameter and a fixed-parameter tractable result when considering the database treewidth.
Bibliography:This research was supported by the Brazilian National Council for Scientific and Technological Development (CNPq) under the grant number 424188/2016-3.
ISBN:3030853144
9783030853143
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-030-85315-0_3