Advertisement

On the Complexity of Bounded Deletion Propagation

  • Dongjing Miao
  • Yingshu Li
  • Xianmin Liu
  • Jianzhong Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Bounded deletion propagation View update Database Complexity 

References

  1. 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. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557–575 (1981)CrossRefzbMATHGoogle Scholar
  4. 4.
    Cosmadakis, S.S., Papadimitriou, C.H.: Updates of relational views. J. ACM 31(4), 742–760 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 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. 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. 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)CrossRefGoogle Scholar
  8. 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. 9.
    Kimelfeld, B., Vondrák, J., Williams, R.: Maximizing conjunctive views in deletion propagation. ACM Trans. Database Syst. 37(4), 1–37 (2012)CrossRefGoogle Scholar
  10. 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. 11.
    Kimelfeld, B., Vondrák, J., Woodruff, D.P.: Multi-tuple deletion propagation: approximations and complexity. Proc. VLDB Endow. 6(13), 1558–1569 (2013)CrossRefGoogle Scholar
  12. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 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. 15.
    Cosmadakis, S.S., Papadimitriou, C.H.: Updates of relational views. J. ACM 31(4), 742–760 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Lechtenbörger, J., Vossen, G.: On the computation of relational view complements. ACM Trans. Database Syst. 28(2), 175–208 (2003)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Dongjing Miao
    • 1
  • Yingshu Li
    • 1
  • Xianmin Liu
    • 2
  • Jianzhong Li
    • 2
  1. 1.Department of Computer ScienceGeorgia State UniversityAtlantaUSA
  2. 2.Harbin Institute of TechnologyHarbinChina

Personalised recommendations