An improved algorithm for the incremental recomputation of active relational expressions

被引：30

作者：

Griffin, T

Libkin, L

Trickey, H

机构：

[1] Bell Laboratories, Murray Hill, NJ 07974

来源：

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING | 1997年 / 9卷 / 03期

关键词：

relational algebra; incremental recomputation; change propagation; view maintenance;

D O I：

10.1109/69.599937

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In [1], Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality condition. This condition guarantees that the incremental change sets do not contain any unnecessary tuples; so, redundant computations are not performed. We show that, in fact, their algorithm violates this condition. We present an improved algorithm that does preserve this notion of minimality.

引用

页码：508 / 511

页数：4