Advertisement

Translatable Updates of Selection Views under Constant Complement

  • Enrico Franconi
  • Paolo Guagliardo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8645)

Abstract

Given a lossless view associating a source relation with a set of target relations defined by selection queries over the source, we study how updates of the target relations can be consistently and univocally propagated to the underlying source relation. We consider a setting where some of the attributes in the schema are interpreted over some specific domain (e.g., the reals or the integers) whose data values can be compared beyond equality, by means of special predicates (e.g., smaller/greater than) and functions (e.g., addition and subtraction). The source schema is constrained by conditional domain constraints, which restrict the values that are admissible for the interpreted attributes whenever a certain condition is satisfied by the values taken by the non-interpreted ones.

We show how to decide whether insertions, deletions and replacements, as well as sequences of insertions and deletions, can be univocally propagated through lossless selection views. In general, a lossy view, which does not preserve the whole informative content of the source, can always be turned into a lossless one by means of a view complement, which provides the missing information. For lossy selection views, we show how to find complements that provide the smallest amount of information needed to achieve losslessness, so as to maximise the number of updates that can be propagated under the so-called constant complement principle, prescribing that the complement be invariant during update propagation.

Keywords

Integrity Constraint Relation Symbol Source Relation Target Instance Selection View 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bancilhon, F., Spyratos, N.: Update semantics of relational views. ACM Trans. Database Syst. 6(4), 557–575 (1981)CrossRefzbMATHGoogle Scholar
  2. 2.
    Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. Journal of Computer and System Sciences 41(3), 274–306 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Feinerer, I., Franconi, E., Guagliardo, P.: Lossless horizontal decomposition with domain constraints on interpreted attributes. In: Gottlob, G., Grasso, G., Olteanu, D., Schallhart, C. (eds.) BNCOD 2013. LNCS, vol. 7968, pp. 77–91. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  4. 4.
    Franconi, E., Guagliardo, P.: On the translatability of view updates. In: AMW 2012. CEUR Workshop Proceedings, vol. 866, pp. 154–167. CEUR-WS.org (2012)Google Scholar
  5. 5.
    Guagliardo, P., Pichler, R., Sallinger, E.: Enhancing the updatability of projective views. In: AMW 2013. CEUR Workshop Proceedings, vol. 1087 (2013)Google Scholar
  6. 6.
    Hegner, S.J.: FD covers and universal complements of simple projections. In: Lukasiewicz, T., Sali, A. (eds.) FoIKS 2012. LNCS, vol. 7153, pp. 184–202. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Jaffar, J., Maher, M.J., Stuckey, P.J., Yap, R.H.C.: Beyond finite domains. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 86–94. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  8. 8.
    Lahiri, S.K., Musuvathi, M.: An efficient decision procedure for UTVPI constraints. In: Gramlich, B. (ed.) FroCoS 2005. LNCS (LNAI), vol. 3717, pp. 168–183. Springer, Heidelberg (2005)Google Scholar
  9. 9.
    Maier, D., Ullman, J.D.: Fragments of relations. SIGMOD Rec. 13(4), 15–22 (1983)CrossRefGoogle Scholar
  10. 10.
    Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)Google Scholar
  11. 11.
    Schutt, A., Stuckey, P.J.: Incremental satisfiability and implication for UTVPI constraints. INFORMS Journal on Computing 22(4), 514–527 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Seshia, S.A., Subramani, K., Bryant, R.E.: On solving boolean combinations of UTVPI constraints. JSAT 3(1-2), 67–90 (2007)zbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Enrico Franconi
    • 1
  • Paolo Guagliardo
    • 1
  1. 1.Free University of Bozen-BolzanoItaly

Personalised recommendations