Programmable view update strategies on relations

  title={Programmable view update strategies on relations},
  author={Van-Dang Tran and Hiroyuki Kato and Zhenjiang Hu},
  journal={Proceedings of the VLDB Endowment},
  pages={726 - 739}
View update is an important mechanism that allows updates on a view by translating them into the corresponding updates on the base relations. The existing literature has shown the ambiguity of translating view updates. To address this ambiguity, we propose a robust language-based approach for making view update strategies programmable and validatable. Specifically, we introduce a novel approach to use Datalog to describe these update strategies. We propose a validation algorithm to check the… Expand
8 Citations

Figures and Tables from this paper

BIRDS: Programming view update strategies in Datalog
BIRDS validates the well-behavedness of user-written update strategies, then optimizes and compiles them into SQL code run in PostgreSQL databases, and further explains the unexpected behavior ofuser-written Datalog programs using generated counterexamples, thereby assists users in correcting their programs. Expand
Toward Programmable Strategy for Co-existence of Relational Schemes
A language for describing how an update is propagated across schemas is proposed and a mechanism to derive auxiliary tables and other all equipment to run on an existing RDBMS is presented. Expand
A Cheap Implementation of Resugaring in BIRDS Based on Bidirectional Transformation
The idea of resugaring for automatically transforming the evaluation sequence of the core language into the evaluation sequences of the surface language is adopted, and a cheap implementation using the existing bidirectional transformation tool BIRDS is given. Expand
Towards Guaranteeing Global Consistency for Peer-Based Data Integration Architecture
The characteristics of Dejima are analyzed from the perspective of transaction management and a transaction management method for efficiency and autonomy of peers is proposed. Expand
Software Foundations for Data Interoperability and Large Scale Graph Data Analytics: 4th International Workshop, SFDI 2020, and 2nd International Workshop, LSGDA 2020, held in Conjunction with VLDB 2020, Tokyo, Japan, September 4, 2020, Proceedings
Three attribute diversified community models are introduced in which attribute diversification takes different roles for presenting objective, query requirement, and constraint in order to find communities that are both structure and attribute cohesive. Expand
Data Integration Models and Architectures for Service Alliances
Three models of multiple service alliances using views using views are presented and these architectures are assessed for their capability of resolving the issues presented above. Expand
Programming Languages and Systems: 18th Asian Symposium, APLAS 2020, Fukuoka, Japan, November 30 – December 2, 2020, Proceedings
Two new approaches are proposed for automating the very labor-intensive and therefore time-heavy and therefore expensive and expensive process of scientific research called “model-driven” research. Expand
A Counterexample-Guided Debugger for Non-recursive Datalog
This paper provides a syntax for users to specify properties of non-recursive Datalog programs, presents a counterexample generator that verifies specified properties and generatescounterexamples to show unexpected behaviors of user-written programs, and designs a debugging engine combined with a dialog-based user interface to assist users in locating bugs in the programs with the generated countereXamples. Expand


Relational lenses: a language for updatable views
The 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. Expand
Brul: A Putback-Based Bidirectional Transformation Library for Updatable Views
This paper implements a library Brul that provides putback-based basic combinators for the user to write the put function with flexible update policies easily; from thePut function, a unique get function can be derived automatically. Expand
Updates Through Views: A New Hope
A novel approach for separating the data instance into a logical and a physical level allows us to achieve side-effect free translations of any kind of update on the view and deletes on a view can be translated without affecting the base tables. Expand
Understanding the implications of view update policies
A general algorithm that predicts the effects of arbitrary mapping policies is presented, which subsumes the results obtained by other view design tools, and generalizes their use to encompass a larger class of views. Expand
Updating relational views using knowledge at view definition and view update time
This work presents a pragmatic approach that uses syntactic as well as semantic knowledge to decide an appropriate translation that is applicable to simple and nested relational views defined using operations such as set difference, union, intersection, selection, projection and join operations. Expand
View updates in relational databases with an independent scheme
The view update translation problem for a relational data model in which the base relations may contain (indexed) nulls is studied and it is proven that the constant complement method of Bancilhon and Spyratos is too restrictive to be useful in this context. Expand
An intention-based approach to the updatability of views in relational databases
An intention-based approach is presented to resolve the view update problem by introducing the pro forma guessing of update intention approach, and Cartesian product views and join views become updatable while they are not updatable in the traditional sense. Expand
Extending the View Updatability of Relational Databases from Set Semantics to Bag Semantics and Its Implementation on PostgreSQL
To benefit relational database users, the intention-based approach for a relational database management system should be implemented on PostgreSQL, which is the prevalent open source relational databasemanagement system in the world. Expand
Compiling mappings to bridge applications and databases
This work presents a novel approach to this problem, in which the relationship between the application data and the persistent storage is specified using a declarative mapping, which is compiled into bidirectional views that drive the data transformation engine. Expand
Update semantics of relational views
The main result of the paper states that, given a complete set U of view updates, U has a translator if and only if U is translatable under constant complement. Expand