H.-C. Liu and K. Ramamohanarao. Path-dependent Nested Relational Algebra. Technical Report 93/13, Department of Computer Science, The University of Melbourne, Australia, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algebraic Equivalences Among Nested Relational Expressions - Liu, Ramamohanarao (1994) (1 citation) Self-citation (Liu Ramamohanarao) (Correct)
....with conjunctive conditions into a cascade of SELECT operations. ffl Using rules of propositions 13 and 14, theorem 10, move each SELECT operation as far down the query tree as possible. ffl Using rules concerning associativity of binary operations 1 , p , p , Gamma p , and 1 p [9], rearrange the leaf nodes of the tree. ffl Using rules concerning cascading of PROJECT and commuting of PROJECT with other operations, move projection as far down the tree as possible. ffl Apply the knowledge of functional dependency, multivalued dependency and mutual data dependency [3, 8] to ....
....(Product(Distributor) 1 p Part(Source) The algebraic transformation of this query is as follows. 1 Note that standard relational operators and extended relational operators ( e , e , Gamma e , 1 e ) 13] are special cases of path dependent nested relational operators [9]. prodname;p Gammaname;Distributor Source(company;fee;cost) oe Warranty:w Gammaperiod3 (Product(Distributor) 1 p Part(Source) prodname;p Gammaname;Distributor Source(company;fee;cost) oe Warranty:w Gammaperiod3 Product) Distributor) 1 p Part(Source) ....
H.-C. Liu and K. Ramamohanarao. Path-dependent Nested Relational Algebra. Technical Report 93/13, Department of Computer Science, The University of Melbourne, Australia, 1993.
Multiple Paths Join for Nested Relational Databases - Liu, Ramamohanarao (1993) (1 citation) Self-citation (Liu Ramamohanarao) (Correct)
....within a restricted set of nested scheme trees, a more general form of join (P join) which does not require as many restructuring operators and combines the advantages of the extended natural join and recursive join for efficient data access. The work presented in this paper extends that of [5]. The structure of this paper is as follows. In the remainder of this section, we present a motivating example. Section 2 briefly reviews the nested relational model and recalls some well known concepts. In Section 3, we present the path dependent join (i.e. P join) In Section 4, we derive some ....
....2 d 2 e 2 f 2 (c) A;X(Z(D) s) A X Z D a 1 d 1 a 2 d 1 d 2 d 2 a 3 d 3 Figure 2: Examples of recursive selection and projection on s 3. Path dependent Join First we briefly review some auxiliary concepts and describe the P join operator with single join path which has been proposed in [5]. We then extend this to multiple join paths. 2 The definition of projection operator has the same meaning as the projection operator defined in [1] a) r A X Y B C D 1 1 1 5 3 3 10 2 2 2 10 (b) q B X Y B C D 2 1 1 5 2 2 3 4 4 5 10 (c) r Theta e q A B X Y B r C r B q C q D r D q 1 2 1 1 ....
[Article contains additional citation context not shown here]
H.C. Liu and K. Ramamohanarao. Path-dependent Nested Relational Algebra. Technical Report 93/13, Department of Computer Science, The University of Melbourne, Australia, 1993.
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