Heraclitus
- 1 September 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 21 (3), 370-426
- https://doi.org/10.1145/232753.232801
Abstract
Traditional database systems provide a user with the ability to query and manipulate one database state, namely the current database state. However, in several emerging applications, the ability to analyze “what-if” scenarios in order to reason about the impact of an update (before committing that update) is of paramount importance. Example applications include hypothetical database access, active database management systems, and version management, to name a few. The central thesis of the Heraclitus paradigm is to provide flexible support for applications such as these by elevating deltas , which represent updates proposed against the current database state, to be first-class citizens. Heraclitus[Alg,C] is a database programming language that extends C to incorporate the relational algebra and deltas. Operators are provided that enable the programmer to explicitly construct, combine, and access deltas. Most interesting is the when operator, that supports hypothetical access to a delta: the expression E when σ yields the value that side effect free expression E would have if the value of delta expression σ were applied to the current database state. This article presents a broad overview of the philosophy underlying the Heraclitus paradigm, and describes the design and prototype implementation of Heraclitus[Alg, C]. A model-independent formalism for the Heraclitus paradigm is also presented. To illustrate the utility of Heraclitus, the article presents an in-depth discussion of how Heraclitus[Alg, C] can be used to specify, and thereby implement, a wide range of execution models for rule application in active databases; this includes both prominent execution models presented in the literature, and more recent “customized” execution models with novel features.Keywords
This publication has 29 references indexed in Scilit:
- An optimal resource scheduler for continuous display of structured video objectsIEEE Transactions on Knowledge and Data Engineering, 1996
- An execution model for limited ambiguity rules and its application to derived data updateACM Transactions on Database Systems, 1995
- The Gamma database machine projectIEEE Transactions on Knowledge and Data Engineering, 1990
- An initial report on the design of Ariel DBMS with an integrated production rule systemACM SIGMOD Record, 1989
- Types and persistence in database programming languagesACM Computing Surveys, 1987
- Join processing in database systems with large main memoriesACM Transactions on Database Systems, 1986
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failureThe Journal of Logic Programming, 1985
- Design and implementation of the wisconsin storage systemSoftware: Practice and Experience, 1985
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976
- Differential filesACM Transactions on Database Systems, 1976