|
Rakesh Agrawal:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Yannis E. Ioannidis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Yannis E. Ioannidis cite Rakesh AgrawalOrdered by citing publication[Change the order to 'ordered by cited']
-
Yannis E. Ioannidis, Yezdi Lashkari
Incomplete Path Expressions and their Disambiguation. [Citation Graph (4, 13)][DBLP] SIGMOD Conference, 1994, pp:138-149 [Conf] Cites:
-
Chee Yong Chan, Yannis E. Ioannidis
Hierarchical Prefix Cubes for Range-Sum Queries. [Citation Graph (4, 11)][DBLP] VLDB, 1999, pp:675-686 [Conf] Cites:
-
Eben M. Haber, Yannis E. Ioannidis, Miron Livny
OPOSSUM: Desk-Top Schema Management through Customizable Visualization. [Citation Graph (4, 30)][DBLP] VLDB, 1995, pp:527-538 [Conf] Cites:
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf] Cites:
-
Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger
Transitive Closure Algorithms Based on Graph Traversal. [Citation Graph (14, 21)][DBLP] ACM Trans. Database Syst., 1993, v:18, n:3, pp:512-576 [Journal] Cites:
-
Rakesh Agrawal, H. V. Jagadish
Direct Algorithms for Computing the Transitive Closure of Database Relations. [Citation Graph (30, 11)][DBLP] VLDB, 1987, pp:255-266 [Conf]
-
Rakesh Agrawal, H. V. Jagadish
Hybrid Transitive Closure Algorithms. [Citation Graph (13, 20)][DBLP] VLDB, 1990, pp:326-334 [Conf]
-
Rakesh Agrawal, Shaul Dar, H. V. Jagadish
Direct Transitive Closure Algorithms: Design and Performance Evaluation. [Citation Graph (20, 26)][DBLP] ACM Trans. Database Syst., 1990, v:15, n:3, pp:427-458 [Journal]
|