|
Frank Manola:
[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 Frank ManolaOrdered by citing publication[Change the order to 'ordered by cited']
-
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:
-
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:
-
Shaul Dar, H. V. Jagadish
A Spanning Tree Transitive Closure Algorithm. [Citation Graph (10, 24)][DBLP] ICDE, 1992, pp:2-11 [Conf] Cites:
-
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:
-
Alexandros Biliris, Shaul Dar, Narain H. Gehani, H. V. Jagadish, Krithi Ramamritham
ASSET: A System for Supporting Extended Transactions. [Citation Graph (13, 15)][DBLP] SIGMOD Conference, 1994, pp:44-54 [Conf] Cites:
-
H. V. Jagadish
A Retrieval Technique for Similar Shapes. [Citation Graph (39, 10)][DBLP] SIGMOD Conference, 1991, pp:208-217 [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:
-
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:
-
Christos Faloutsos, H. V. Jagadish, Yannis Manolopoulos
Analysis of the n-Dimensional Quadtree Decomposition for Arbitrary Hyperectangles. [Citation Graph (3, 14)][DBLP] IEEE Trans. Knowl. Data Eng., 1997, v:9, n:3, pp:373-383 [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:
-
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] Cites:
|