AN IMPROVED ALGORITHM FOR THE INCREMENTAL RECOMPUTATION OF ACTIVE RELATIONAL EXPRESSIONS

Authors
GRIFFIN T LIBKIN L TRICKEY H
Citation
T. Griffin et al., AN IMPROVED ALGORITHM FOR THE INCREMENTAL RECOMPUTATION OF ACTIVE RELATIONAL EXPRESSIONS, IEEE transactions on knowledge and data engineering, 9(3), 1997, pp. 508-511
Citations number
2
Categorie Soggetti
Information Science & Library Science","Computer Sciences, Special Topics","Engineering, Eletrical & Electronic","Computer Science Artificial Intelligence","Computer Science Information Systems
Journal title
IEEE transactions on knowledge and data engineering → ACNP
ISSN journal
10414347
Volume
9
Issue
3
Year of publication
1997
Pages
508 - 511
Database
ISI
SICI code
1041-4347(1997)9:3<508:AIAFTI>2.0.ZU;2-#
Abstract
In [1], Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to p reserve 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, the ir algorithm violates this condition. We present an improved algorithm that does preserve this notion of minimality.