W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of view, this update query should delete only one tuple from emp non deterministically. From deductive databases point of view, this query should delete all tuples from emp. In the past decade, various approaches for the inclusion of update capabilities in rule based languages have been proposed [1, 2, 4, 7, 9, 10, 13, 21, 23, 24, 25, 27, 30]. However, most of them are logic programming based that support nondeterministic tuple at a time updates and fail to provide a natural account for setoriented (or bulk) updates in deductive databases syntactically and semantically. Some database oriented approaches either lack intuitive ....

....no bindings can be found from the extensional database, it is called not safe and cannot be executed. The above updates are called concurrent transactions. Such transactions are nondiscriminative as employees involved in the updates get the same salary increase. The next example is adopted from [6, 9] and is used to show that complex updates can be expressed using several rules. Example 5 Assume that account is a base relation giving the account number and the balance. The following rules can be used to update the relation. transfer(Acc1; Acc2; Amt) withdraw(Acc1; Amt) deposit(Acc2; ....

[Article contains additional citation context not shown here]

W. Chen. Programming with Logical Queries, Bulk Updates and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587-599, 1997.

....positive rate. It is regarded as a measure of sensitivity by Klosgen [15] The same measure was also used by Choubey et al. 5] In the context of information retrieval, the measure is referred to as the measure of recall [32] The use of change of support CS(H was discussed by some authors [4, 25]. Additional measures of one way support can be obtained by combining basic quantities introduced in the last section. Yao and Liu [31] used the following quantity for measuring the significance of a rule E S 1 (H log IND(E,H) 14) The measure is a product of a measure of one way ....

Chen, M., Han, J. and Yu, P.S. Data mining, an overview from a databases perspective, IEEE Transactions on Knowledge and Data Engineering, 8, 866-883, 1996.

....of view, this update query should delete only one tuple from emp non deterministically. From deductive databases point of view, this query should delete all tuples from emp. In the past decade, various approaches for the inclusion of update capabilities in rule based languages have been proposed [1, 2, 4, 7, 9, 10, 13, 19, 22, 23, 25, 27, 21]. However, most of them are logic programming based that support nondeterministic tuple at a time updates and fail to provide a natural account for set oriented (or bulk) updates in deductive databases syntactically and semantically. Some database oriented approaches either lack intuitive ....

....generate the new database EDB 0 , i.e. EDB 0 = EDB DEL) INS. Note that if there are employees whose salary is 0 such as emp(ann; shoe; 0) then emp(ann; shoe; 0) 2 DEL and emp(ann; shoe; 0) 2 INS. As emp(ann; shoe; 0) 62 EDB DEL, the updates are still performed. In other approaches such as [9, 21, 27], such updates are inconsistent as there are insertion and deletion of the same tuple and therefore cannot be performed. Note that there is only one state transition for the above updates even though there is more than one update and updates in DatalogU are set oriented in the same way as queries ....

[Article contains additional citation context not shown here]

W. Chen. Programming with Logical Queries, Bulk Updates and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587{ 599, 1997.

....and update propagation. We model the sources of information as deductive databases, sharing the same logical language to express queries and updates, but containing independent, even if possibly related, data. Several approaches have been proposed integrating logic and updates (see for example [1,2,6,7,13,14,32,34,35,38,45]) The language we propose is based on the U Datalog language [6] and extends it with support for active rules and with the ability to model heterogeneous databases. U Datalog has been introduced with the aim of providing a set oriented logical update language, guaranteeing update parallelism in ....

W. Chen. Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587{ 599, 1997. 36

....should not contain the reserved constant all. Update literals can be composed to form more complex update formulas. First, we de ne the general notion of update formulas, a subset of which forms the set of update goals that we will introduce later. Note that di erent from other approaches, e.g. Che97] we do not allow negated basic or de nable update atoms. Negation is permitted only at the retrieval level. De nition 2.5 [Update Formulas] The set of update formulas is de ned inductively by the following cases: 1. Every update literal is an update formula. 2. Let and be update formulas. ....

....are considered as assertions for the next state. It should be noted that neither IDB rules (or relational views) nor update rules are considered in Chen s update calculus. But Chen has also worked on the integration of deferred updates with the logic programming paradigm and developed a concept [Che97] that has turned out to be similar to the ULTRA language described in [WFF98b] as well as in Sections 2.2 and 3.3 of this paper. However, Chen s main goal is to de ne a well founded semantics for update programs by tailoring van Gelders s alternating xpoint procedure [vG89] to operate on a ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587-599, 1997.

....foundation of various kinds of information systems. However, classical logic languages refer to a single database state, whereas in modern information systems it is necessary to take dynamic behaviour into account. For this purpose, several update languages have been proposed, among them [AHV95, BK94, BK96, Che97, LHL95, MW88, MBM97, WF97a], which allow to specify complex transitions from one database state to another. From the evaluation point of view, a complex state transition can and should be considered as a transaction. Up to now, the isolation property of transactions has been poorly addressed in the context of logic update ....

....Compositionality is important for modularization and avoids the well known problems of interleaving parallelism found in various programming languages, e.g. Java. Note, that Chen independently worked on the integration of deferred updates with the logic programming paradigm and developed a concept [Che97] that is similar to the ULTRA approach [WF97a] For the discussion of other related work, e.g. AHV95, BK94, BK96, LHL95, MW88, MBM97] we refer the reader to [WF97a, WF97b] and the survey article [BK98] The semantics of ULTRA has been slightly modified as compared to [WF97a, WF97b] From the ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

....The update under constraints is a well known problem in logic programming and maybe some techniques could be applied and or extended. Finally it should be pointed out, that there is a great interest in database community on formalizations of concurrent objects. See for example Kesim Sergot [1996]. These approaches are very promising. Often it is about tabling techniques that allow for a faster execution. These techniques can be applied to the event calculus approach. Possibly they can also be apply to our approach. These techniques would be most useful if they support independent choice. ....

....that are augmented by local assertions. This would very much cover what Hammond calls success and or failure annotations. 33 On the other hand one should also investigate in general whether the process that is associated with CBR suits our needs. For an introduction see for example Leak [1996]. The problem is to first find out whether adaptation is better than generation. If this is the case one should ask about the costs and benefits of the process. It does seem that putting things on a computer does not necessarily make things simpler. For example Hua Faltings [1993] report ....

A Logic Programming Framework for Modeling Temporal Objects, IEEE Transactions on Knowledge and Data Engineering, Vol. 8, No. 5, October 1996 Lampson, B.W. and Redell, D.D.

....of update request sets which contain insertion and deletion requests for ground EDB tuples. This form of deferred updates, which describe transitions between database states, was already used in the languages Heraclitus [GHJ96] and U Datalog [MBM97] and has also been investigated by Chen [Che95, Che97] The deferred update approach has some advantages, as it provides a modular semantics for the concurrent composition of transactions as well as for bulk updates built from single updates. In [WFF98a, WFF98b] we show that an optimistic transaction processing method can be used to guarantee ....

....loosely coupled components, which can be configured and tuned independently. In particular, the scheduler can behave either more optimistic, more aggressive, or more delaying. We claim that the architecture can even be adapted to evaluate similar update concepts with updates in the rule body [Che97, MW88b, MBM97] in particular the rule based fragment of (Concurrent) Transaction Logic [BK94, BK96] In the new architecture, hypothetical reasoning can be avoided, the logical evaluation of update queries and the materialization of updates can be interleaved, and the nondeterminism can be ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

....defined in terms of update request sets which contain insertion and deletion requests for ground EDB tuples. This form of deferred updates, which describe transitions between database states, was already used in the languages Heraclitus [9] and U Datalog [15] and has also been investigated by Chen [6, 7]. The deferred update approach has some advantages, as it provides a modular semantics for the concurrent composition of transactions as well as for bulk updates built from single updates. In this paper we develop an operational model that implements a fragment of the logical semantics in terms of ....

....loosely coupled components, which can be configured and tuned independently. In particular, the scheduler can behave either more optimistic, more aggressive, or more delaying. We claim that the architecture can even be adapted to evaluate similar update concepts with updates in the rule body [7, 14, 15], in particular the rule based fragment of (Concurrent) Transaction Logic [4, 5] In the new architecture, hypothetical reasoning can be avoided, the logical evaluation of update queries and the materialization of updates can be interleaved, and the non determinism can be handled efficiently. Our ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

No context found.

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

.... at least two di#erent topics: An update and a transaction language should be provided and typical atomicity, consistency, isolation, and durability (ACID) properties have to be guaranteed [24] This requirement has led to the definition of several languages integrating logic and updates [1,2,9,10,15,16,31,32,35]. In general, all those proposals are based on including special atoms denoting updates in (typically Datalog) rules. The proposed approaches di#er for several aspects, such as the semantics assigned to the resulting language (declarative vs. operational) the evaluation techniques, the update ....

W. Chen. Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587-- 599, 1997.

....of complex update operations. From a semantical point of view, existential quantification and bulk quantification can be regarded as a generalization of disjunction and concurrent conjunction, respectively. Note that unlike other approaches we do not allow negated basic or definable update atoms. Che97] for example, uses negation and another special operator # for hypothetical reasoning at the language level. This allows rules like if the update would cause a failure, then do. where the update is never actually executed, no matter if the condition is true or false. In contrast, we do not ....

....the basic update atoms are considered as assertions for the next state. It should be noted that neither IDB rules, nor update rules are considered in Chen s update calculus. But Chen has also worked on the integration of deferred updates with the logic programming paradigm and developed a concept [Che97] that has turned out to be similar to the ULTRA language described in some earlier publications [WF96, WF97a, WFF98b] as well as in Sections 2.2 and 3.3 of this paper, where it is considered as an instance of the generic ULTRA framework, which is much more general. However, Chen s main goal is ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

....[8] for every committed subtransaction. These compensating (undo) transactions can be specified by the same means, i.e. using ULTRA rules, as the forward (do) operations. In the literature, various other logic or rule based update languages are presented, among them Chen s update approach [5], Transaction Logic [3, 4] or U Datalog [10] These approaches mainly deal with specification of updates, while execution is not in the main scope of investigation. In this paper, we apply results from database theory to ULTRA as one representative of such update languages. We extend the mapping ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

....to declare compatibility information and show how it can be used for an actual compatibility test. We further discuss the central issues concerning compensation in our framework. In the literature, various other logic or rule based update languages are presented, among them Chen s approach [Che97], Transaction Logic [BK94,BK96] and U Datalog [MBM97] These approaches mainly deal with specification of updates, while execution Logical Update Queries as Open Nested Transactions 3 is not in the main scope of investigation. In this paper, we apply results from database theory to ULTRA as one ....

W. Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, 9(4):587--599, 1997.

....suggests batching of data and sorting it prior to insertion. However, sorting phase is expensive and requires the data to be collected beforehand, while our algorithm tries to avoid the sorting phase. Bulk updates and bulk loading have been studied for various structures and in various scenarios [Che97, LRS93, LN97, CP98]. These techniques are typically specific to the structure in question and are not directly applicable to our problem. Ciaccia et al. CP98] proposed methods of bulk loading the M tree which is possibly the work closest to ours. The proposed bulk loading algorithm performs a clustering of data ....

W. Chen. Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning. IEEE Transactions on Knowledge and Data Engineering, pages 587--599, July 1997.

....rudimentary batching of data and sorting it prior to insertion to improve the performance. The algorithm is rudimentary and due to the expensive sorting phase is not expected to scale well. Bulk updates and bulk loading have been studied for various other structures and in various other scenarios [Che97] [JDJ93] LN97] CP98] These techniques are specific to the structure in question and are not directly applicable to our problem. 3 STLT: A Bulk Insertion Strategy 3.1 Background on R trees An R tree is a height balanced tree structure consisting of index nodes and leaf nodes. The leaf nodes ....

Weidong Chen. Programming with logical queries, bulk updates, and hypothetical reasoning. IEEE Transactions on Knowledge and Data Engineering, pages 587--599, July 1997.

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