Skip to main content
SpringerLink
Log in
Book cover

International Conference on Combinatorial Optimization and Applications

COCOA 2016: Combinatorial Optimization and Applications pp 453–462Cite as

On the Complexity of Bounded Deletion Propagation

  • Conference paper
  • First Online:

  • 1205 Accesses

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

Abstract

Deletion propagation problem is a class of view update problem in relational databases [1]. Given a source database D, a monotone relational algebraic query Q, the view V generated by the query Q(D) and an update on view \(\varDelta V\), deletion propagation is to find a side effect free update \(\varDelta D\) on database D such that \(Q(D{\setminus }\varDelta D)=V{\setminus }\varDelta V\). In general, the database updated may be very distant from the original database. In this paper, we propose a new approach, bounded version deletion propagation problem (\(\textit{b}\text {-}\mathsf{dp}\) for short), where number of tuples deleted ‘\(|\varDelta D|\)’ is bounded by constant b, in which it aims to find the view side-effect free and bounded \(\varDelta D\), then analyze its computational complexity. Our results show that in many cases both the data and combined complexity drop, even for functional dependency restricted version deletion propagation.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. 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)

    Google Scholar 

  2. Dayal, U., Bernstein, P.A.: On the correct translation of update operations on relational views. ACM Trans. Database Syst. 7(3), 381–416 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557–575 (1981)

    Article  MATH  Google Scholar 

  4. Cosmadakis, S.S., Papadimitriou, C.H.: Updates of relational views. J. ACM 31(4), 742–760 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bohannon, A., Pierce, B.C., Vaughan, J.A.: Relational lenses: a language for updatable views. In: Proceedings of the Twenty-Fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2006, pp. 338–347. ACM, New York (2006)

    Google Scholar 

  6. Keller, A.M.: Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In: Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, PODS 1985, pp. 154–163. ACM, New York (1985)

    Google Scholar 

  7. 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)

    Article  Google Scholar 

  8. 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)

    Google Scholar 

  9. Kimelfeld, B., Vondrák, J., Williams, R.: Maximizing conjunctive views in deletion propagation. ACM Trans. Database Syst. 37(4), 1–37 (2012)

    Article  Google Scholar 

  10. 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)

    Google Scholar 

  11. Kimelfeld, B., Vondrák, J., Woodruff, D.P.: Multi-tuple deletion propagation: approximations and complexity. Proc. VLDB Endow. 6(13), 1558–1569 (2013)

    Article  Google Scholar 

  12. 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)

    Article  MathSciNet  MATH  Google Scholar 

  13. Cong, G., Fan, W., Geerts, F., Li, J., Luo, J.: On the complexity of view update analysis and its application toannotation propagation. IEEE Trans. Knowl. Data Eng. 24(3), 506–519 (2012)

    Article  Google Scholar 

  14. 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)

    Google Scholar 

  15. Cosmadakis, S.S., Papadimitriou, C.H.: Updates of relational views. J. ACM 31(4), 742–760 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  16. Lechtenbörger, J., Vossen, G.: On the computation of relational view complements. ACM Trans. Database Syst. 28(2), 175–208 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Georgia State University, Atlanta, GA, 30303, USA

    Dongjing Miao & Yingshu Li

  2. Harbin Institute of Technology, Harbin, Heilongjiang, 150001, China

    Xianmin Liu & Jianzhong Li

Authors
  1. Dongjing Miao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yingshu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xianmin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jianzhong Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yingshu Li .

Editor information

Editors and Affiliations

  1. University of Hong Kong, Hong Kong, China

    T-H. Hubert Chan

  2. City University of Hong Kong, Hong Kong, China

    Minming Li

  3. City University of Hong Kong, Hong Kong, China

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Miao, D., Li, Y., Liu, X., Li, J. (2016). On the Complexity of Bounded Deletion Propagation. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-48749-6_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-48748-9

  • Online ISBN: 978-3-319-48749-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation