On the abductive or deductive nature of database schema validation and update processing problems
| Autor: | Toni Urpí, Ernest Teniente |
|---|---|
| Rok vydání: | 2003 |
| Předmět: |
FOS: Computer and information sciences
Computer Science - Logic in Computer Science Deductive reasoning Computer science computer.software_genre Theoretical Computer Science H.2.1 H.2.4 H.2.3 Set (abstract data type) Computer Science - Databases Artificial Intelligence Data integrity Information retrieval Event (computing) Materialized view Database schema Condition monitoring Databases (cs.DB) Logic in Computer Science (cs.LO) Computational Theory and Mathematics Hardware and Architecture Abductive logic programming Data mining computer Software |
| Zdroj: | Theory and Practice of Logic Programming. 3:287-327 |
| ISSN: | 1475-3081 1471-0684 |
| DOI: | 10.1017/s1471068402001631 |
| Popis: | We show that database schema validation and update processing problems such as view updating, materialized view maintenance, integrity constraint checking, integrity constraint maintenance or condition monitoring can be classified as problems of either abductive or deductive nature, according to the reasoning paradigm that inherently suites them. This is done by performing abductive and deductive reasoning on the event rules (Olive 1991), a set of rules that define the difference between consecutive database states. In this way, we show that it is possible to provide methods able to deal with all these problems as a whole. We also show how some existing general deductive and abductive procedures may be used to reason on the event rules. In this way, we show that these procedures can deal with all database schema validation and update processing problems considered in this paper. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|