M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Similar declarative semantics have also been given to object oriented database languages without updates. Updates are important database operations, how to incorporate them into deduction has been the focus of active research during the last few years and various approaches have been proposed [7, 8, 9, 10, 11, 12, 13]. However, only a few of them take object orientation into account. Until now, there has been no uniform logical framework that accounts for database updates. The major difficulty is that updates require control features that deviate from a pure declarative semantics. Because of this, several ....

....DLP [13] and LDL [14] directly provide explicit procedural update constructs and resort to dynamic logic to give procedural semantics to the update part of the languages. Recently, Kramer et al. presented an update language for deductive and object oriented databases based on object versioning [12]. For a version v of an object, an update on v creates a new version of the object represented by ins(v) mod(v) or del(v) depending on the type of updates (insert, modify, or delete) Every version corresponds to a certain time step of the entire update process. The version of an object ....

[Article contains additional citation context not shown here]

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conf. on Very Large Data Bases, pages 225--236, 1992.

....of that view. Gottlob, Paolini, and Zicari [GPZ88] describe how primitive update operators can be rewritten into complex updates and how view updates are translated into database updates. Our approach is similar to this approach in that an update is performed within a view. Kramer et al. KLS92] and Cacace et al. CCCR 90] incorporate updates into rule languages . Widom et al. WCL91] introduce an SQL based production rule language into the Starburst rule system. Our approach incorporates rules and constraints into updates . That is, the update calculus described in this paper is an ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conf. on Very Large Data Bases, pages 251--262, Vancouver, Canada, 1992.

....and to express any computable database query. Osb88] discusses object identity with special emphasis on query optimization, and [PG88] extends the relational key concept. Object identities from the deductive databases point of view are treated in [HY90] Logic databases are also considered in [KLS92] with special emphasis on updates, a topic which seems to be one of the mayor problems in this field [Abi88] For the special purpose of databases, a functional language incorporating parametrized set types is introduced. Different kinds of (not necessarily formal) object equality definitions are ....

M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In Li-Yan Yuan, editor, Proc. 18th Int. Conf. on Very Large Databases, Vancouver, pages 251---262, 1992.

....access creates even more difficulties. Datalog as a subset of Prolog is a pure declarative query language without any data manipulation part. How to incorporate them into deductive databases has been the focus of active research during the last few years and various approaches have been proposed [1, 9, 11, 10, 14, 20, 31, 36, 46, 49]. In this section, we discuss typical approaches. Datalog UT Datalog UT [42] extends Datalog by incorporating update rules that are used to update extensional predicates. Every predicate in Datalog UT is associated with a temporal argument called time point which is an integer. The updates ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conf. on Very Large Data Bases, pages 225--236, Vancouver, British Columbia, Canada, 1992. Morgan Kaufmann Publishers, Inc.

....a procedural semantics of those rules. Even the non persistent OOProlog systems include restrictions on updates: OL(P) Fromherz, 1993) forbids all dynamic updates in the definition of classes and L O (McCabe, 1992) distinguishes between static and updatable program parts. Kramer et al. (Kramer et al. 1992) discuss updates of objects in rule based language in more detail. We soften the restriction of forbidden updates in the DRL, so that socalled safe updates are allowed in subgoals and queries. Only definitions and updates of attributes and instances are allowed evolutionary. Updating methods or ....

Kramer, M., G. Lausen, G. Saake (1992). Updates in a Rule-Based Language for Objects.

....next by examining the actual state. Although bulk updates and sequential composition can be handled better than in the other approaches, there currently exist no concepts for modularization and integration of transaction models. Some other approaches dealing with updates in deductive databases are [1, 12, 20, 21]. 1] and [12] can be regarded as the starting point for the concepts mentioned in the previous paragraph. Reiter [20] characterizes similar active behaviour by the situation calculus. In [21] a modal logic for verifying database updates is developed. However, the updates are programmed in a ....

....state. Although bulk updates and sequential composition can be handled better than in the other approaches, there currently exist no concepts for modularization and integration of transaction models. Some other approaches dealing with updates in deductive databases are [1, 12, 20, 21] 1] and [12] can be regarded as the starting point for the concepts mentioned in the previous paragraph. Reiter [20] characterizes similar active behaviour by the situation calculus. In [21] a modal logic for verifying database updates is developed. However, the updates are programmed in a language like ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. 18th Int. Conf. on Very Large Data Bases, pages 251--262, 1992.

....proposed query language IQL employs object identities to represent data structures with sharing and cycles, to manipulate sets, and to express any computable database query. Object identities from the deductive databases point of view are treated in [HY90] Logic databases are also considered in [KLS92] with special emphasis on updates, a topic which seems to be one of the mayor problems in this field [Abi88] An approach to object identity from the functional programming perspective by the use of categorical monad structures is given in [Oho90] For the special purpose of databases, a ....

M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In L.-Y. Yuan, editor, Proc. 18th Int. Conf. on Very Large Databases (VLDB'92), pages 251--262. Morgan Kaufmann, 1992.

....or hierarchical state spaces. Versioning in object oriented databases is dealt with in [CJ90] There, the granularity of versioning is by objects, each database version consists of a version of each object stored in the system. Updates and versioning of objects in F Logic has been presented in [KLS92] There, updates are restricted to the form ins, mod, and del of method applications. Transaction Logic [BK94] is a deductive language focussing on the dynamic acspects of processes, supporting an abstract notion of states as theories. In [FWP97] an active rule language is incorporated into an ....

M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.

....Datalog with a notion of state, re)active production rules and deductive rules can be handled in a unified way, thereby combining the advantages of active and deductive rules. Two such (closely related) Datalog extensions are XY Datalog [Zan93,Zan95,MZ97] and Statelog [LHL95,LML96] see [KLS92] for an early precursor of the latter) The specification of operational aspects like composite event detection and coupling modes is possible in the logical language since the rules allow access to different database states even complex execution models for nested transactions can be handled ....

M. Kramer, G. Lausen, and G. Saake. Updates in a Rule-Based Language for Objects. In Intl. Conference on Very Large Data Bases (VLDB), pp. 251--262, Vancouver, 1992.

....the well known framework of logic programming, a plethora of semantics and evaluation techniques can be applied. A slightly shorter version of this paper was presented at the 2nd International East West Database Workshop, Klagenfurt, Austria, September 1994 1 We continue work started in [12] where a fixpoint semantics was defined for an update language which could only process a constant number of intermediate states. In contrast, by the use of state variables, Statelog allows to refer to arbitrary database states, which results in greater expressiveness. It turned out that Statelog ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.

....that all relations with an unconditioned frame rule like (4.1) are constant during the running phase of a transaction. 5 Related Work The idea of using state terms in Datalog has been proposed in [33, 34] to allow a unified semantics for active and deductive rules, and independently in [21, 22] as a means to specify update procedures in a declarative way. X and Y rules of [33] are very similar to local and progressive rules, respectively. However, while local and progressive rules may involve (stratified) recursion within a single state, XY rules are essentially non recursive in a ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.

....programming semantics is also adequate w.r.t. the intuitive semantics. 7 Related Work The idea of using state terms to refer to different states in logical rules has come up several times, e.g. in XY Datalog [Zan93, ZAO93] to allow a unified semantics for active and deductive rules, and in [KLS92, LL94] as a means to specify updates in a declarative way. Flat Statelog [LHL95] XY Datalog, and the temporal query languages Datalog 1S and Templog [Cho90, AM89, Bau95] are closely related, since they all extend Datalog by a linear state space. In contrast, our present approach uses a branching ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. VLDB, 1992.

....terms extends the expressiveness and control capabilities of the language which are necessary to describe active data manipulation operations. The idea of using state terms in Datalog has been proposed in [26, 27] to allow a unified semantics for active and deductive rules, and independently in [15, 16] as a means to specify update procedures in a declarative way. The main contributions of this paper are as follows. We demonstrate that the proposed language Statelog can afford both active rules and deductive rules within a unified frame 1 Although there is a natural correspondence between ....

M. Kramer, G. Lausen, and G. Saake. Updates in a rule-based language for objects. In Proc. Intl. Conference on Very Large Data Bases, Vancouver, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC