Update semantics of relational views
ACM Transactions on Database Systems (TODS)
On the correct translation of update operations on relational views
ACM Transactions on Database Systems (TODS)
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Tracing the lineage of view data in a warehousing environment
ACM Transactions on Database Systems (TODS)
On propagation of deletions and annotations through views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the computation of relational view complements
ACM Transactions on Database Systems (TODS)
Relational lenses: a language for updatable views
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Provenance management in curated databases
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
ViP: A User-Centric View-Based Annotation Framework for Scientific Data
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Updating recursive XML views of relations
Journal of Computer Science and Technology
Provenance in Databases: Why, How, and Where
Foundations and Trends in Databases
Optimizing updates of recursive XML views of relations
The VLDB Journal — The International Journal on Very Large Data Bases
Xml publishing: bridging theory and practice
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Relational completeness of query languages for annotated databases
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Relational completeness of query languages for annotated databases
Journal of Computer and System Sciences
Maximizing conjunctive views in deletion propagation
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A dichotomy in the complexity of deletion propagation with functional dependencies
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Maximizing Conjunctive Views in Deletion Propagation
ACM Transactions on Database Systems (TODS)
An annotation management system for multidimensional databases
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
International Journal of Systems and Service-Oriented Engineering
Multi-tuple deletion propagation: approximations and complexity
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
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 an SPJ view Q retain a key of each base relation involved in Q. While this condition is less restrictive than other proposals [11, 14], it often simplifies the annotation propagation analysis. Indeed, for key-preserving SPJ views the annotation placement problem coincides with the view side-effect problem, and the view and source side-effect problems become tractable. In addition we generalize the setting of [5] by allowing ΔV to be a group of tuples to be deleted, and investigate the insertion of tuples to the view. We show that group updates make the analysis harder: these problems become NP-hard for several subclasses of SPJ views. We also show that for SPJ views the source and view side-effect problems are NP-hard for single-tuple insertion, but are tractable for some subclasses of SPJ for group insertions, in the presence or in the absence of the key preservation condition.