Toward automation of generating incremental computation mechanisms

Authors:
Bambang N. Prastowo
Affiliations:
Department of Computing and Information Science, Queen's University, Kingston, Ontario, K7L 3N6
Venue:
CASCON '94 Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
Year:
1994

Citing 4
Cited 0

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Query processing in the ObjectStore database system

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Incremental evaluation of computational circuits

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for on-line updating of minimum spanning trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

In interactive applications, a user often modifies small parts of some base structure and expects the system to immediately feed back some information reflecting the modification. Obtaining the required information may involve some expensive computation. When a user modification only affects a localized part of the computation, the system should perform only minimal work necessary to present updated computation output. A schema relating incremental and non incremental programs is formalized. The goal is that, given formal semantics of some programming language, we can easily refine the schema to a complete specification of a system transforming a program written in the language into a semantically equivalent program capable of performing incremental computations.