A Formal method for the synthesis of update transactions in deductive databases without existential rules
We propose a new method for generating consistency-preserving transaction programs for (view-)updates in deductive databases. The method augments the deductive database schema with a set of transition and internal event rules, which explicitly define the database dynamic behaviour in front of an upd...
| Autor: | |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 1994 |
| País: | España |
| Recursos: | 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/96722 |
| Acesso em linha: | https://hdl.handle.net/2117/96722 |
| Access Level: | acceso abierto |
| Palavra-chave: | Consistency-preserving transaction programs Deductive databases Meta-programming Prolog Formal procedure Àrees temàtiques de la UPC::Informàtica::Enginyeria del software |
| Resumo: | We propose a new method for generating consistency-preserving transaction programs for (view-)updates in deductive databases. The method augments the deductive database schema with a set of transition and internal event rules, which explicitly define the database dynamic behaviour in front of an 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. The method has been implemented in Prolog using meta-programming techniques. |
|---|