Annotation propagation revisited for key preserving views

This paper revisits the analysis of annotation propagation from source databases to views defined in terms of conjunctive (SPJ) queries. Given a source database D, an SPJ query Q, the view Q(D) and a tuple V in the view, the view (resp. source) side-effect problem is to find a minimal set D of tuples such that the deletion of D from D results in the deletion of V from Q(D) while minimizing the side effects on the view (resp. the source). A third problem, referred to as the annotation placement problem, is to find a single base tuple D such that annotation in a field of D propagates to V while minimizing the propagation to other fields in the view Q(D). These are important for data provenance and the management of view updates. However important, these problems are unfortunately NP-hard for most subclasses of SPJ views [5]. To make the annotation propagation analysis feasible in practice, we propose a key preserving condition on SPJ views, which requires that the projection fields of a...

• Type: Conference
• Year: 2006
• Where: CIKM
• Authors: Gao Cong, Wenfei Fan, Floris Geerts
• Keywords: Annotation Placement Problem, Annotation Propagation, CIKM 2006, Information Management, Spj Views