Unique complements and decompositions of database schemata
Journal of Computer and System Sciences
Uniqueness of Update Strategies for Database Views
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
An Order-Based Theory of Updates for Closed Database Views
Annals of Mathematics and Artificial Intelligence
The complexity of embedded axiomatization for a class of closed database views
Annals of Mathematics and Artificial Intelligence
Combinators for bidirectional tree transformations: A linguistic approach to the view-update problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
View update translation for XML
Proceedings of the 14th International Conference on Database Theory
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Supporting feature model refinement with updatable view
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
A closed view of a database schema is one which is totally encapsulated. Insofar as the user is concerned, the view is the database schema. The rest of the database system is not visible through the view, and is is not required for complete use of the view. Similarly, the updates which may be effected through the view have their scope limited entirely to that view. In this paper, we lay the mathematical foundations for the systematic support of such views. The proper context is shown to be that of update translation under constant meet complement, a refinement of the constant complement strategy of Bancilhon and Spyratos. The central complexity result for relational schemata is that checking the legality of updates is “infinitely” simpler than blindly checking that the new state is legal for the view schema, and in the particular case that the base schema is constrained by functional dependencies, may always be performed in constant time, even if the view schema is not finitely axiomatizable. We further establish that, under very natural assumptions, update strategies for closed views are unique.