|
Haran Boral:
[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 Haran BoralOrdered by citing publication[Change the order to 'ordered by cited']
-
Yannis E. Ioannidis, Eugene Wong
Query Optimization by Simulated Annealing. [Citation Graph (41, 23)][DBLP] SIGMOD Conference, 1987, pp:9-22 [Conf] Cites:
-
Yannis E. Ioannidis, Younkyung Cha Kang
Randomized Algorithms for Optimizing Large Join Queries. [Citation Graph (45, 11)][DBLP] SIGMOD Conference, 1990, pp:312-321 [Conf] Cites:
-
Yannis E. Ioannidis, Younkyung Cha Kang
Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization. [Citation Graph (30, 8)][DBLP] SIGMOD Conference, 1991, pp:168-177 [Conf] Cites:
-
Yannis E. Ioannidis
On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP] VLDB, 1986, pp:403-411 [Conf] Cites:
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf] Cites:
-
Viswanath Poosala, Yannis E. Ioannidis
Estimation of Query-Result Distribution and its Application in Parallel-Join Load Balancing. [Citation Graph (5, 23)][DBLP] VLDB, 1996, pp:448-459 [Conf] Cites:
-
Haran Boral, William Alexander, Larry Clay, George P. Copeland, Scott Danforth, Michael J. Franklin, Brian E. Hart, Marc G. Smith, Patrick Valduriez
Prototyping Bubba, A Highly Parallel Database System. [Citation Graph (51, 35)][DBLP] IEEE Trans. Knowl. Data Eng., 1990, v:2, n:1, pp:4-24 [Journal]
-
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:
|