|
Yannis E. Ioannidis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Raghu Ramakrishnan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Raghu Ramakrishnan cite Yannis E. IoannidisOrdered by citing publication[Change the order to 'ordered by cited']
-
Renée J. Miller, Yannis E. Ioannidis, Raghu Ramakrishnan
Schema Equivalence in Heterogeneous Systems: Bridging Theory and Practice (Extended Abstract). [Citation Graph (0, 9)][DBLP] EDBT, 1994, pp:73-80 [Conf] Cites:
-
Joseph Albert, Yannis E. Ioannidis, Raghu Ramakrishnan
Conjunctive Query Equivalence of Keyed Relational Schemas. [Citation Graph (1, 15)][DBLP] PODS, 1997, pp:44-50 [Conf] Cites:
-
Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi
Proof-Tree Transformation Theorems and Their Applications. [Citation Graph (14, 12)][DBLP] PODS, 1989, pp:172-181 [Conf] Cites:
-
Shaul Dar, Raghu Ramakrishnan
A Performance Study of Transitive Closure Algorithms. [Citation Graph (2, 23)][DBLP] SIGMOD Conference, 1994, pp:454-465 [Conf] Cites:
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf]
-
Robert Kabler, Yannis E. Ioannidis, Michael J. Carey
Performance evaluation of algorithms for transitive closure. [Citation Graph (3, 0)][DBLP] Inf. Syst., 1992, v:17, n:5, pp:415-441 [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]
-
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pirahesh, T. Y. Cliff Leung, Raghu Ramakrishnan, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
Cost-Based Optimization for Magic: Algebra and Implementation. [Citation Graph (13, 24)][DBLP] SIGMOD Conference, 1996, pp:435-446 [Conf] Cites:
-
Raghu Ramakrishnan, Donko Donjerkovic, Arvind Ranganathan, Kevin S. Beyer, Muralidhar Krishnaprasad
SRQL: Sorted Relational Query Language. [Citation Graph (2, 7)][DBLP] SSDBM, 1998, pp:84-95 [Conf] Cites:
-
Donko Donjerkovic, Raghu Ramakrishnan
Probabilistic Optimization of Top N Queries. [Citation Graph (2, 12)][DBLP] VLDB, 1999, pp:411-422 [Conf] Cites:
-
Yannis E. Ioannidis, Stavros Christodoulakis
On the Propagation of Errors in the Size of Join Results. [Citation Graph (28, 5)][DBLP] SIGMOD Conference, 1991, pp:268-277 [Conf]
-
Viswanath Poosala, Yannis E. Ioannidis, Peter J. Haas, Eugene J. Shekita
Improved Histograms for Selectivity Estimation of Range Predicates. [Citation Graph (46, 17)][DBLP] SIGMOD Conference, 1996, pp:294-305 [Conf]
-
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
ICICLES: Self-Tuning Samples for Approximate Query Answering. [Citation Graph (0, 13)][DBLP] VLDB, 2000, pp:176-187 [Conf] Cites:
-
Daniel Barbará, William DuMouchel, Christos Faloutsos, Peter J. Haas, Joseph M. Hellerstein, Yannis E. Ioannidis, H. V. Jagadish, Theodore Johnson, Raymond T. Ng, Viswanath Poosala, Kenneth A. Ross, Kenneth C. Sevcik
The New Jersey Data Reduction Report. [Citation Graph (17, 69)][DBLP] IEEE Data Eng. Bull., 1997, v:20, n:4, pp:3-45 [Journal]
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf] Cites:
-
Renée J. Miller, Yannis E. Ioannidis, Raghu Ramakrishnan
The Use of Information Capacity in Schema Integration and Translation. [Citation Graph (17, 27)][DBLP] VLDB, 1993, pp:120-133 [Conf] Cites:
-
Raghu Ramakrishnan, Divesh Srivastava, S. Sudarshan
Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs. [Citation Graph (5, 5)][DBLP] VLDB, 1990, pp:359-371 [Conf] Cites:
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Containment of Conjunctive Queries: Beyond Relations as Sets [Citation Graph (5, 19)][DBLP] ACM Trans. Database Syst., 1995, v:20, n:3, pp:288-324 [Journal] Cites:
-
Odysseas G. Tsatalos, Marvin H. Solomon, Yannis E. Ioannidis
The GMAP: A Versatile Tool for Physical Data Independence. [Citation Graph (14, 27)][DBLP] VLDB, 1994, pp:367-378 [Conf]
-
Yannis E. Ioannidis, Eugene Wong
Towards an Algebraic Theory of Recursion. [Citation Graph (7, 0)][DBLP] J. ACM, 1991, v:38, n:2, pp:329-381 [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:
-
Ru-Mei Kung, Eric N. Hanson, Yannis E. Ioannidis, Timos K. Sellis, Leonard D. Shapiro, Michael Stonebraker
Heuristic Search in Data Base Systems. [Citation Graph (29, 0)][DBLP] Expert Database Workshop, 1984, pp:537-548 [Conf]
-
Yannis E. Ioannidis
On the Computation of the Transitive Closure of Relational Operators. [Citation Graph (37, 11)][DBLP] VLDB, 1986, pp:403-411 [Conf]
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf]
-
Robert Kabler, Yannis E. Ioannidis, Michael J. Carey
Performance evaluation of algorithms for transitive closure. [Citation Graph (3, 0)][DBLP] Inf. Syst., 1992, v:17, n:5, pp:415-441 [Journal]
|