Skip to main content
SpringerLink
Log in

Some Aspects of the Database Resilience

  • Conference paper
  • First Online:
Theoretical Aspects of Computing – ICTAC 2021 (ICTAC 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12819))

Included in the following conference series:

  • 552 Accesses

Abstract

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.

This research was supported by the Brazilian National Council for Scientific and Technological Development (CNPq) under the grant number 424188/2016-3.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Constants are allowed for relational vocabulary.

  2. 2.

    This is the strategy applied in Theorem 2.

References

  1. Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, New York (2013)

    MATH  Google Scholar 

  2. Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM (JACM) 49(6), 716–752 (2002)

    Article  MathSciNet  Google Scholar 

  3. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-29953-X

    Book  MATH  Google Scholar 

  4. 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) (2015)

    Google Scholar 

  5. Freire, C., Gatterbauer, W., Immerman, N., Meliou, A.: New results for the complexity of resilience for binary conjunctive queries with self-joins. In: Suciu, D., Tao, Y., Wei, Z. (eds.) Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2020, Portland, OR, USA, 14–19 June 2020, pp. 271–284. ACM (2020). https://doi.org/10.1145/3375395.3387647

  6. Grohe, M., Schwentick, T., Segoufin, L.: When is the evaluation of conjunctive queries tractable? In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 657–666 (2001)

    Google Scholar 

  7. Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296–303. ACM, New York (2014)

    Google Scholar 

  8. Miao, D., Cai, Z.: Parameterized complexity of resilience decision for database debugging. In: Duan, Z., Ong, L. (eds.) ICFEM 2017. LNCS, vol. 10610, pp. 332–344. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-68690-5_20

    Chapter  Google Scholar 

  9. Miao, D., Li, J., Cai, Z.: The parameterized complexity and kernelization of resilience for database queries. Theoret. Comput. Sci. 840, 199–211 (2020). https://doi.org/10.1016/j.tcs.2020.08.018

    Article  MathSciNet  MATH  Google Scholar 

  10. Nešetřil, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carol. 26(2), 415–419 (1985)

    MathSciNet  MATH  Google Scholar 

  11. Papadimitriou, C.H.: Computational Complexity. Wiley, New York (2003)

    MATH  Google Scholar 

  12. Pătraşcu, M., Williams, R.: On the possibility of faster sat algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1065–1075. SIAM, Austin (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Federal University of Paraíba, Rio Tinto, Brazil

    Luis Henrique Bustamante

  2. Federal University of Ceará, Fortaleza, Brazil

    Luis Henrique Bustamante & Ana Teresa Martins

Authors
  1. Luis Henrique Bustamante
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Teresa Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luis Henrique Bustamante .

Editor information

Editors and Affiliations

  1. Nazarbayev University, Nur-Sultan, Kazakhstan

    Antonio Cerone

  2. Department of Informatics, University of Oslo, Oslo, Norway

    Peter Csaba Ölveczky

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bustamante, L.H., Martins, A.T. (2021). Some Aspects of the Database Resilience. In: Cerone, A., Ölveczky, P.C. (eds) Theoretical Aspects of Computing – ICTAC 2021. ICTAC 2021. Lecture Notes in Computer Science(), vol 12819. Springer, Cham. https://doi.org/10.1007/978-3-030-85315-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85315-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85314-3

  • Online ISBN: 978-3-030-85315-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation