J.A. Makowsky and M. Vardi. On the expressive power of data dependencies. Acta Informatica, 23.3:231-- 244, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dependency preserving refinements of relational database.. - Makowsky, Ravve (1996) Self-citation (Makowsky) (Correct)
....Dependency In this section we study the closure of dependency classes under the function Phi # for translation schemes Phi. Dependency classes which are closed allows us to transfer specific dependencies via refinements. We first recall a classification of dependencies introduced in [MV86], cf. also [Tha91, AHV94] Definition17 (Dependencies) 1. A first order formula over a set of relation symbols is a full implicational dependency (FID) if it is of the form 8 x( i R i ( x) x) where each R i is an atomic formula not containing the equality symbol, is atomic possibly ....
J.A. Makowsky and M. Vardi. On the expressive power of data dependencies. Acta Informatica, 23.3:231-- 244, 1986.
Dependency Preserving Refinements and the Fundamental Problem .. - Makowsky, Ravve (1998) (2 citations) Self-citation (Makowsky) (Correct)
....in [Mai83, AHV94, PDGV89, MR92] 3.1 Dependencies Let hR; Sigma R i be a fixed database schemes with a set of first order dependencies Sigma R . Unless otherwise stated Sigma R may contain also interrelational dependencies. Recall the classification of database dependencies as given in [BV84, MV86] in first order logic notation. For further references, cf. also [FV86, Var87, Tha91, AHV94] Definition9 (Dependencies) There are two big classes of dependencies, those which are universal first order formulae (FID) and those which are universal existential formulae (EID) FID A first order ....
J.A. Makowsky and M. Vardi. On the expressive power of data dependencies. Acta Informatica, 23.3:231--244, 1986.
Translation Schemes and the Fundamental Problem of Database.. - Makowsky, Ravve (1996) Self-citation (Makowsky) (Correct)
....to domain independent (safe) formulae, cf. AHV94] we get another closed class. We leave the proof of this last assertion as an exercise. Dependency classes which are closed allow us to transfer specific dependencies via reductions. We first recall a classification of dependencies introduced in [BV84, MV86], cf. also [FV86, Var87, Tha91, AHV94] Definition19 (Dependencies) i) A first order formula over a set of relation symbols is a full implicational dependency (FID) if it is of the form 8 x( i R i ( x) x) where each R i is an atomic formula not containing the equality symbol, is ....
J.A. Makowsky and M. Vardi. On the expressive power of data dependencies. Acta Informatica, 23.3:231--244, 1986.
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