H. V. Jagadish :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Rakesh Agrawal :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Which papers of Rakesh Agrawal cite H. V. Jagadish Ordered by citing publication [Change the order to 'ordered by cited' ]
Rakesh Agrawal Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries. [Citation Graph (43, 18)][DBLP ] ICDE, 1987, pp:580-590 [Conf ] Cites:
Rakesh Agrawal , Premkumar T. Devanbu Moving Selections into Linear Least Fixpoint Queries. [Citation Graph (9, 14)][DBLP ] ICDE, 1988, pp:452-461 [Conf ] Cites:
Rakesh Agrawal , Shaul Dar , Narain H. Gehani The O++ Database Programming Language: Implementation and Experience. [Citation Graph (3, 24)][DBLP ] ICDE, 1993, pp:61-70 [Conf ] Cites:
Rakesh Agrawal , Shaul Dar , H. V. Jagadish Composition of Database Relations. [Citation Graph (4, 13)][DBLP ] ICDE, 1989, pp:102-108 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Multiprocessor Transitive Closure Algorithms. [Citation Graph (15, 0)][DBLP ] DPDS, 1988, pp:56-66 [Conf ]
H. V. Jagadish A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing. [Citation Graph (8, 0)][DBLP ] Expert Database Conf., 1988, pp:423-446 [Conf ]
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 , Jerry Kiernan An Access Structure for Generalized Transitive Closure Queries. [Citation Graph (4, 13)][DBLP ] ICDE, 1993, pp:429-438 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [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 ]
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 ]
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 ]
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:
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 ]
Kyuseok Shim , Ramakrishnan Srikant , Rakesh Agrawal High-Dimensional Similarity Joins. [Citation Graph (3, 18)][DBLP ] ICDE, 1997, pp:301-311 [Conf ] Cites:
H. V. Jagadish A Retrieval Technique for Similar Shapes. [Citation Graph (39, 10)][DBLP ] SIGMOD Conference, 1991, pp:208-217 [Conf ]
King-Ip Lin , H. V. Jagadish , Christos Faloutsos The TV-Tree: An Index Structure for High-Dimensional Data [Citation Graph (33, 20)][DBLP ] VLDB J., 1994, v:3, n:4, pp:517-542 [Journal ]
Rakesh Agrawal , Ramakrishnan Srikant Privacy-Preserving Data Mining. [Citation Graph (0, 26)][DBLP ] SIGMOD Conference, 2000, pp:439-450 [Conf ] Cites:
Christos Faloutsos , H. V. Jagadish , Nikolaos Sidiropoulos Recovering Information from Summary Data. [Citation Graph (8, 19)][DBLP ] VLDB, 1997, pp:36-45 [Conf ]
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 ]
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:
Rakesh Agrawal , H. V. Jagadish Multiprocessor Transitive Closure Algorithms. [Citation Graph (15, 0)][DBLP ] DPDS, 1988, pp:56-66 [Conf ]
H. V. Jagadish A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing. [Citation Graph (8, 0)][DBLP ] Expert Database Conf., 1988, pp:423-446 [Conf ]
H. V. Jagadish Incorporating Hierarchy in a Relational Model of Data. [Citation Graph (6, 17)][DBLP ] SIGMOD Conference, 1989, pp:78-87 [Conf ]
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 ]
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:
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 ] Cites:
Rakesh Agrawal , H. V. Jagadish Efficient Search in Very Large Databases. [Citation Graph (5, 5)][DBLP ] VLDB, 1988, pp:407-418 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Hybrid Transitive Closure Algorithms. [Citation Graph (13, 20)][DBLP ] VLDB, 1990, pp:326-334 [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 ]
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 ]
Rakesh Agrawal , Giuseppe Psaila , Edward L. Wimmers , Mohamed Zaït Querying Shapes of Histories. [Citation Graph (8, 6)][DBLP ] VLDB, 1995, pp:502-514 [Conf ] Cites:
Rakesh Agrawal , Roberta Cochrane , Bruce G. Lindsay On Maintaining Priorities in a Production Rule System. [Citation Graph (16, 23)][DBLP ] VLDB, 1991, pp:479-487 [Conf ] Cites:
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [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 ]
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 ]
John C. Shafer , Rakesh Agrawal Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications. [Citation Graph (1, 15)][DBLP ] VLDB, 1997, pp:176-185 [Conf ] Cites:
Rakesh Agrawal , Premkumar T. Devanbu Moving Selections into Linear Least Fixpoint Queries. [Citation Graph (4, 18)][DBLP ] IEEE Trans. Knowl. Data Eng., 1989, v:1, n:4, pp:424-432 [Journal ] Cites:
Rakesh Agrawal , H. V. Jagadish Algorithms for Searching Massive Graphs. [Citation Graph (3, 17)][DBLP ] IEEE Trans. Knowl. Data Eng., 1994, v:6, n:2, pp:225-238 [Journal ] Cites:
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [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 ]
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 ]
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 ]
Shaul Dar , Rakesh Agrawal Extending SQL with Generalized Transitive Closure Functionality. [Citation Graph (3, 37)][DBLP ] IEEE Trans. Knowl. Data Eng., 1993, v:5, n:5, pp:799-812 [Journal ] 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 ]
Shaul Dar , H. V. Jagadish A Spanning Tree Transitive Closure Algorithm. [Citation Graph (10, 24)][DBLP ] ICDE, 1992, pp:2-11 [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 ]
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:
Rakesh Agrawal , H. V. Jagadish Multiprocessor Transitive Closure Algorithms. [Citation Graph (15, 0)][DBLP ] DPDS, 1988, pp:56-66 [Conf ]
H. V. Jagadish A Compressed Transitive Closure Technique for Efficient Fixed-Point Query Processing. [Citation Graph (8, 0)][DBLP ] Expert Database Conf., 1988, pp:423-446 [Conf ]
Rakesh Agrawal , Shaul Dar , H. V. Jagadish Composition of Database Relations. [Citation Graph (4, 13)][DBLP ] ICDE, 1989, pp:102-108 [Conf ]
Rakesh Agrawal , H. V. Jagadish Materialization and Incremental Update of Path Information. [Citation Graph (9, 14)][DBLP ] ICDE, 1989, pp:374-383 [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 ]
H. V. Jagadish Incorporating Hierarchy in a Relational Model of Data. [Citation Graph (6, 17)][DBLP ] SIGMOD Conference, 1989, pp:78-87 [Conf ]
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 ]
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 ]