We present incremental evaluation algorithms to compute changes to materialized views in
relational and deductive database systems, in response to changes (insertions, deletions …

What is a view? A view is a derived relation defined in terms of base (stored) relations. A
view thus defines a function from a set of base tables to a derived table; this function is …

In this paper we define the concept of self-maintainable views—these are views that can be
maintained using only the contents of the view and the database modifications, without …

Datalog-based systems often materialise all consequences of a datalog program and the
data, allowing users' queries to be evaluated directly in the materialisation. This process …

Extract, Transform, and Load (ETL) processes physically integrate data from multiple,
heterogeneous sources in a central repository referred to as data warehouse. Physically …

When updating a knowledge base, several problems may arise. One of the most important
problems is that of integrity constraints satisfaction. The classic approach to this problem has …

Datalog is a rule-based formalism that can axiomatise recursive properties such as
reachability and transitive closure. Datalog implementations often materialise (ie …

Most work on query optimization in relational and object-oriented databases has
concentrated on tuning algebraic expressions and the physical access to the database …

Incremental computation has recently been studied using the concepts of change structures
and derivatives of programs, where the derivative of a function allows updating the output of …

Tabling has emerged as an important evaluation technique in logic programming. Currently,
changes to a program (due to addition/deletion of rules/facts) after query evaluation …