S. Naqvi and S. Tsur. A Logical Language for' Data and Knowledge Bases, volume 2. Computer Science Press, 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Deductive Object Databases - Bertino, Guerrini (1994) (1 citation) (Correct)
....consistent. If the set is not consistent the trensection is aborted end no updete in the set is performed. The notion of consistency is en iraportent one, in thet it prevents e set of updetes conreining both en insertion end e deletion of the seine feet to be executed. By contrest in DLP [47] D [54], Tq [20] end DL [5] updetes ere executed es soon es they ere evelueted. This epproech leeds to complex sementics end to computetions performed in e sequence of stetes 12 instead of in a single one. In the following we recall the language and its informal behavior (see [53] for a complete ....
S. Naqvi and S. Tsur. A Logical Language for' Data and Knowledge Bases, volume 2. Computer Science Press, 1989.
Transaction Optimization in Rule Databases - Bertino, Catania, Guerrini.. (1994) (1 citation) (Correct)
....more user friendly and higher level than traditional programming and database languages. On the other side they extend the properties of relational domain calculus into a rule based language, adding to relational based languages inferential and reactive features. Many advanced database systems [9, 10, 12, 14, 15, 16] are based on rule languages. Moreover, current extensions to relational DBMS and object oriented DBMS also provide some rule capabilities. Indeed, rules represent a powerful and simple language to relate two situations: the cause and the effect. A rule can be seen as . This rule should be read as ....
....of the form where is a deductive atom, as in Datalog) is the query part, is the update part and is the binding part. The update and query parts cannot be both empty. Transaction) A (or simple transaction) is a rule with no head of the form where and are as in Definition 2.2 and cannot be empty. [14] and DLP [13] with respect to these languages our language has a fully declarative semantics which is independent from the evaluation order of atoms (both query and update atoms) in the rules. The main concern of this paper is related to the efficient execution of this kind of rules. In ....
S. Naqvi and S. Tsur. . Computer Science Press, 1989.
Rule-Based Languages - Vianu (1996) (Correct)
....and ffl is defined by a N Datalog : 8 program. 6. 3 The choice operator Another way to provide nondeterminism in rule based languages is provided by the choice operator first presented in [KN88] This construct has been included in the language LDL, an implementation of Datalog : NT89] Variations of the choice operator, and its connection with stable models of Datalog : programs, are further studied in [SZ90, GPSZ91] The expressive power of the choice operator in the context of Datalog is investigated in [CGP93] The following extension of Datalog 6= with a variation of ....
S. Naqvi and S. Tsur. A language for data and knowledge bases. Computer Science Press, Rockville, Maryland, 1989.
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