Declarative View Updates in Linear Logic Databases

Abstract

The problem of updating deductive databases through view is an important practical problem that has attracted much interest. In this paper, a systematic approach to the problem of view updating in linear logic databases is described. The semantics of views, constraints, and view updates is defined declaratively in linear logic. In contrast to classical logic, we can formalise non-shared view and transition contraints easily. An additional advantage is that the associated meaning of a given relation can be defined in terms of the validity of a legal update in a given relation. We also defined formally the update principles and showed the correctness of the update translation algorithms. In this approach, view DELETIONs are special cases of view REPLACEMENTs. This permits there transactional view update operations (INSERTION, DELETION. REPLACEMENT) in comparison to only (INSERTION, DELETION)in most exiting systems.