Aaron Bohannon
Benjamin C. Pierce
ABSTRACT
We propose a novel approach to the classical view update problem. The view update problem arises from the fact that modifications to a database view may not correspond uniquely to modifications on the underlying database; we need a means of determining an "update policy" that guides how view updates are reflected in the database. Our approach is to define a bi-directional query language, in which every expression can be read bot(from left to right) as a view definition and (from right to left) as an update policy. The primitives of this language are based on standard relational operators. Its type system, which includes record-level predicates and functional dependencies, plays a crucial role in guaranteeing that update policies are well-behaved, in a precise sense, and that they are total—i.e., able to handle arbitrary changes to the view.
- François Bancilhon and Nicolas Spyratos. Update semantics of relational views. ACM Transactions on Database Systems, 6(4):557--575, December 1981. Google Scholar
Digital Library
- Umeshwar Dayal and Philip A. Bernstein. On the correct translation of update operations on relational views. TODS, 7(3):381--416, September 1982. Google ScholarDigital Library
- J. Nathan Foster, Michael B. Greenwald, Christian Kirkegaard, Benjamin C. Pierce, and Alan Schmitt. Exploiting schemas in data synchronization. In Database Programming Languages (DBPL), August 2005. Google ScholarDigital Library
- J. Nathan Foster, Michael B. Greenwald, Jonathan T. Moore, Benjamin C. Pierce, and Alan Schmitt. Combinators for bi-directional tree transformations: A linguistic approach to the view update problem. In ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Long Beach, California, pages 233--246, 2005. Google ScholarDigital Library
- G. Gottlob, P. Paolini, and R. Zicari. Properties and update semantics of consistent views. ACM Transactions on Database Systems (TODS), 13(4):486--524, 1988. Google ScholarDigital Library
- Stephane J. Hegner. An order-based theory of updates for closed database views. Annals of Mathematics and Artificial Intelligence, 40:63--125, 2004. Summary in Foundations of Information and Knowledge Systems, 2002, pp. 230--249. Google ScholarDigital Library
- Arthur M. Keller. Algorithms for translating view updates to database updates for views involving selections, projections, and joins. In ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Portland, Oregon, 1985. Google ScholarDigital Library
- Arthur M. Keller. Comment on Bancilhon and Spyratos' "Update semantics and relational views". ACM Trans. Database Syst., 12(3):521--523, 1987. Google ScholarDigital Library
- Jens Lechtenbörger. The impact of the constant complement approach towards view updating. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, California, pages 49--55. ACM, June 9-12 2003. Google ScholarDigital Library
Index Terms
- Relational lenses: a language for updatable views
Recommendations
Incremental relational lenses
Lenses are a popular approach to bidirectional transformations, a generalisation of the view update problem in databases, in which we wish to make changes to source tables to effect a desired change on a view. However, perhaps surprisingly, lenses have ...
Matching lenses: alignment and view update
ICFP '10: Proceedings of the 15th ACM SIGPLAN international conference on Functional programmingBidirectional programming languages are a practical approach to the view update problem. Programs in these languages, called lenses, define both a view and an update policy - i.e., every program can be read as a function mapping sources to views as well ...
Inference-proof view update transactions with forwarded refreshments
DBSEC 2008Inference control aims at disabling a participant to gain a piece of information to be kept confidential. Considering a server-client architecture for information systems, we extend Controlled Query Evaluation (CQE), an inference control method to ...
Comments