Nathan Goodman :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Yehoshua Sagiv :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Yehoshua Sagiv cite Nathan Goodman Ordered by citing publication [Change the order to 'ordered by cited' ]
Yaron Kanza , Werner Nutt , Yehoshua Sagiv Queries with Incomplete Answers over Semistructured Data. [Citation Graph (0, 33)][DBLP ] PODS, 1999, pp:227-236 [Conf ] Cites:
Yehoshua Sagiv , Oded Shmueli The Equivalence of Solving Queries and Production Tree Projections. [Citation Graph (2, 24)][DBLP ] PODS, 1986, pp:160-172 [Conf ] Cites:
Nathan Goodman , Oded Shmueli Transforming Cyclic Schemas into Trees. [Citation Graph (8, 11)][DBLP ] PODS, 1982, pp:49-54 [Conf ]
Nathan Goodman , Oded Shmueli Syntactic Characterization of Tree Database Schemas [Citation Graph (13, 0)][DBLP ] J. ACM, 1983, v:30, n:4, pp:767-786 [Journal ]
Nathan Goodman , Oded Shmueli The Tree Projection Theorem and Relational Query Processing. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1984, v:28, n:1, pp:60-79 [Journal ]
Nathan Goodman , Oded Shmueli , Y. C. Tay GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1984, v:29, n:3, pp:338-358 [Journal ]
Philip A. Bernstein , Nathan Goodman Power of Natural Semijoins. [Citation Graph (34, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:4, pp:751-771 [Journal ]
Nathan Goodman , Oded Shmueli Tree Queries: A Simple Class of Relational Queries. [Citation Graph (18, 26)][DBLP ] ACM Trans. Database Syst., 1982, v:7, n:4, pp:653-677 [Journal ]
Yehoshua Sagiv , Oded Shmueli On Finite FD-Acyclicity. [Citation Graph (0, 18)][DBLP ] PODS, 1986, pp:173-182 [Conf ] Cites:
Nathan Goodman , Oded Shmueli Syntactic Characterization of Tree Database Schemas [Citation Graph (13, 0)][DBLP ] J. ACM, 1983, v:30, n:4, pp:767-786 [Journal ]
Nathan Goodman , Oded Shmueli Tree Queries: A Simple Class of Relational Queries. [Citation Graph (18, 26)][DBLP ] ACM Trans. Database Syst., 1982, v:7, n:4, pp:653-677 [Journal ]
Yehoshua Sagiv Can We Use the Universal Instance Assumption Without Using Nulls? [Citation Graph (49, 23)][DBLP ] SIGMOD Conference, 1981, pp:108-120 [Conf ] Cites:
David Maier , Alberto O. Mendelzon , Yehoshua Sagiv Testing Implications of Data Dependencies. [Citation Graph (86, 16)][DBLP ] ACM Trans. Database Syst., 1979, v:4, n:4, pp:455-469 [Journal ] Cites:
Yehoshua Sagiv A Characterization of Globally Consistent Databases and Their Correct Access Paths. [Citation Graph (49, 21)][DBLP ] ACM Trans. Database Syst., 1983, v:8, n:2, pp:266-286 [Journal ] Cites:
Yehoshua Sagiv , Oded Shmueli Solving Queries by Tree Projections. [Citation Graph (0, 25)][DBLP ] ACM Trans. Database Syst., 1993, v:18, n:3, pp:487-511 [Journal ] Cites:
Nathan Goodman , Oded Shmueli Transforming Cyclic Schemas into Trees. [Citation Graph (8, 11)][DBLP ] PODS, 1982, pp:49-54 [Conf ]
Nathan Goodman , Oded Shmueli Syntactic Characterization of Tree Database Schemas [Citation Graph (13, 0)][DBLP ] J. ACM, 1983, v:30, n:4, pp:767-786 [Journal ]
Nathan Goodman , Oded Shmueli The Tree Projection Theorem and Relational Query Processing. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1984, v:28, n:1, pp:60-79 [Journal ]
Nathan Goodman , Oded Shmueli , Y. C. Tay GYO Reductions, Canonical Connections, Tree and Cyclic Schemas, and Tree Projections. [Citation Graph (3, 0)][DBLP ] J. Comput. Syst. Sci., 1984, v:29, n:3, pp:338-358 [Journal ]
Philip A. Bernstein , Nathan Goodman Power of Natural Semijoins. [Citation Graph (34, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:4, pp:751-771 [Journal ]
Nathan Goodman , Oded Shmueli Tree Queries: A Simple Class of Relational Queries. [Citation Graph (18, 26)][DBLP ] ACM Trans. Database Syst., 1982, v:7, n:4, pp:653-677 [Journal ]