Translatable Updates of Selection Views under Constant Complement
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.
KeywordsIntegrity Constraint Relation Symbol Source Relation Target Instance Selection View
Unable to display preview. Download preview PDF.
- 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.Guagliardo, P., Pichler, R., Sallinger, E.: Enhancing the updatability of projective views. In: AMW 2013. CEUR Workshop Proceedings, vol. 1087 (2013)Google Scholar
- 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
- 10.Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)Google Scholar