Formalising existential rule treatment in the automatic synthesis of update transactions in deductive databases
We propose a new method for generating for (view) updates in deductive databases. The method augments the deductive database schema with a set of transition and internal events rules, which explicitly define the database dynamic behaviour in front of a database update. At transaction-design-time, a...
| Autor: | |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1994 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96963 |
| Acceso en línea: | https://hdl.handle.net/2117/96963 |
| Access Level: | acceso abierto |
| Palabra clave: | Consistency-preserving transaction programs Deductive databases Meta-programming Updating Integrity Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | We propose a new method for generating for (view) updates in deductive databases. The method augments the deductive database schema with a set of transition and internal events rules, which explicitly define the database dynamic behaviour in front of a database update. At transaction-design-time, a formal procedure can use these rules to automatically generate parameterised transaction programs for base or view-update transaction requests. This is done in such a way that those transactions will never take the database into an inconsistent state. In this report we extend a previous version of the method by incorporating existentially defined rules, and formalising their treatment. Within this context, synthesis outputs and processes are provided. The method, implemented in Prolog using meta-programming techniques, draws from our previous work in deductive databases, particularly in view updating and integrity constraint checking. |
|---|