Incremental view maintenance in extended relational databases

This paper presents a method for efficiently computing updates to a view when relations appearing in the view's definition are modified. Views that are defined using all of the relational operators, stratified negation and general recursion are considered. As a result, the method can be employed in both a traditional relational database system and also a deductive database system. The method can compute the updates without requiring access to a materialization of the view and is shown to be more efficient than related methods. The method can compute the updates even when the view's definition is modified