|
Raghu Ramakrishnan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
H. V. Jagadish:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of H. V. Jagadish cite Raghu RamakrishnanOrdered by citing publication[Change the order to 'ordered by cited']
-
Ashish Gupta, H. V. Jagadish, Inderpal Singh Mumick
Data Integration using Self-Maintainable Views. [Citation Graph (23, 7)][DBLP] EDBT, 1996, pp:140-144 [Conf] Cites:
-
Shaul Dar, Rakesh Agrawal, H. V. Jagadish
Optimization of Generalized Transitive Closure Queries. [Citation Graph (5, 22)][DBLP] ICDE, 1991, pp:345-354 [Conf] Cites:
-
Catriel Beeri, Raghu Ramakrishnan
On the Power of Magic. [Citation Graph (84, 10)][DBLP] PODS, 1987, pp:269-284 [Conf]
-
Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan
Magic Conditions. [Citation Graph (23, 8)][DBLP] PODS, 1990, pp:314-330 [Conf]
-
Inderpal Singh Mumick, Sheldon J. Finkelstein, Hamid Pirahesh, Raghu Ramakrishnan
Magic is Relevant. [Citation Graph (30, 21)][DBLP] SIGMOD Conference, 1990, pp:247-258 [Conf]
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf]
-
Inderpal Singh Mumick, Hamid Pirahesh, Raghu Ramakrishnan
The Magic of Duplicates and Aggregates. [Citation Graph (33, 16)][DBLP] VLDB, 1990, pp:264-277 [Conf]
-
Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman
Argument Reduction by Factoring. [Citation Graph (20, 11)][DBLP] VLDB, 1989, pp:173-182 [Conf]
-
Shaul Dar, H. V. Jagadish
A Spanning Tree Transitive Closure Algorithm. [Citation Graph (10, 24)][DBLP] ICDE, 1992, pp:2-11 [Conf] Cites:
-
Byoung-Kee Yi, H. V. Jagadish, Christos Faloutsos
Efficient Retrieval of Similar Time Sequences Under Time Warping. [Citation Graph (2, 9)][DBLP] ICDE, 1998, pp:201-208 [Conf] Cites:
-
H. V. Jagadish, Alberto O. Mendelzon, Tova Milo
Similarity-Based Queries. [Citation Graph (6, 11)][DBLP] PODS, 1995, pp:36-45 [Conf] Cites:
-
H. V. Jagadish, Inderpal Singh Mumick, Abraham Silberschatz
View Maintenance Issues for the Chronicle Data Model. [Citation Graph (15, 18)][DBLP] PODS, 1995, pp:113-124 [Conf] Cites:
-
Praveen Seshadri, Miron Livny, Raghu Ramakrishnan
Sequence Query Processing. [Citation Graph (16, 25)][DBLP] SIGMOD Conference, 1994, pp:430-441 [Conf]
-
Raghu Ramakrishnan, Kenneth A. Ross, Divesh Srivastava, S. Sudarshan
Efficient Incremental Evaluation of Queries with Aggregation. [Citation Graph (4, 0)][DBLP] SLP, 1994, pp:204-218 [Conf]
-
Inderpal Singh Mumick, Hamid Pirahesh, Raghu Ramakrishnan
The Magic of Duplicates and Aggregates. [Citation Graph (33, 16)][DBLP] VLDB, 1990, pp:264-277 [Conf]
-
Rakesh Agrawal, Alexander Borgida, H. V. Jagadish
Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. [Citation Graph (21, 20)][DBLP] SIGMOD Conference, 1989, pp:253-262 [Conf] Cites:
-
H. V. Jagadish, Rakesh Agrawal, Linda Ness
A Study of Transitive Closure As a Recursion Mechanism. [Citation Graph (33, 18)][DBLP] SIGMOD Conference, 1987, pp:331-344 [Conf] Cites:
-
Flip Korn, H. V. Jagadish, Christos Faloutsos
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences. [Citation Graph (4, 12)][DBLP] SIGMOD Conference, 1997, pp:289-300 [Conf] Cites:
-
Rakesh Agrawal, H. V. Jagadish
Hybrid Transitive Closure Algorithms. [Citation Graph (13, 20)][DBLP] VLDB, 1990, pp:326-334 [Conf] Cites:
-
Narain H. Gehani, H. V. Jagadish, Oded Shmueli
Composite Event Specification in Active Databases: Model & Implementation. [Citation Graph (26, 12)][DBLP] VLDB, 1992, pp:327-338 [Conf] Cites:
-
H. V. Jagadish, Laks V. S. Lakshmanan, Divesh Srivastava
What can Hierarchies do for Data Warehouses? [Citation Graph (3, 22)][DBLP] VLDB, 1999, pp:530-541 [Conf] Cites:
-
H. V. Jagadish, J. Madar, Raymond T. Ng
Semantic Compression and Pattern Extraction with Fascicles. [Citation Graph (2, 17)][DBLP] VLDB, 1999, pp:186-198 [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] Cites:
-
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] Cites:
-
H. V. Jagadish
A Compression Technique to Materialize Transitive Closure. [Citation Graph (10, 26)][DBLP] ACM Trans. Database Syst., 1990, v:15, n:4, pp:558-598 [Journal] Cites:
-
Catriel Beeri, Paris C. Kanellakis, François Bancilhon, Raghu Ramakrishnan
Bounds on the Propagation of Selection into Logic Programs. [Citation Graph (31, 19)][DBLP] PODS, 1987, pp:214-226 [Conf]
-
François Bancilhon, Raghu Ramakrishnan
An Amateur's Introduction to Recursive Query Processing Strategies. [Citation Graph (187, 17)][DBLP] SIGMOD Conference, 1986, pp:16-52 [Conf]
-
Yannis E. Ioannidis, Raghu Ramakrishnan
Efficient Transitive Closure Algorithms. [Citation Graph (40, 12)][DBLP] VLDB, 1988, pp:382-394 [Conf]
|