| B. Catania. Problemi di Ottimizzazione in un Linguaggio di Vincoli per Basi di Dati Deduttive. Master Thesis, University of Genova, April 1993. (In Italian). |
....the simple annotations generated in the second set are related to the commit and inconsistency freedom properties (CM;WIN ) Let A3 be the set generated in this step. The generated annotation is A1 [ A2 [ A3. The algorithm is given in the appendix A. The proof of its correctness can be found in [8]. Here, we simply analyze the behavior of the rules of the algorithm, considering in the discussion the definition of a single predicate q. For each rule, we point out the step in which it is used. Note that speaking of predicates instead of transactions cannot generate any ambiguity because of ....
B. Catania. Problemi di Ottimizzazione in un Linguaggio di Vincoli per Basi di Dati Deduttive. Master Thesis, University of Genova, April 1993. (In Italian).
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