|
François Bancilhon:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Jeffrey F. Naughton:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Which papers of Jeffrey F. Naughton cite François BancilhonOrdered by citing publication[Change the order to 'ordered by cited']
-
David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman
ParSets for Parallelizing OODBMS Traversals: Implementation and Performance. [Citation Graph (3, 5)][DBLP] PDIS, 1994, pp:111-120 [Conf] Cites:
-
Ramsey W. Haddad, Jeffrey F. Naughton
Counting Methods for Cyclic Relations. [Citation Graph (7, 11)][DBLP] PODS, 1988, pp:333-340 [Conf] Cites:
-
Jeffrey F. Naughton
Data Independent Recursion in Deductive Databases. [Citation Graph (22, 9)][DBLP] PODS, 1986, pp:267-279 [Conf] Cites:
-
Jeffrey F. Naughton
One-Sided Recursions. [Citation Graph (23, 12)][DBLP] PODS, 1987, pp:340-348 [Conf] Cites:
-
François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman
Magic Sets and Other Strange Ways to Implement Logic Programs. [Citation Graph (156, 3)][DBLP] PODS, 1986, pp:1-15 [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]
-
Richard J. Lipton, Jeffrey F. Naughton
Query Size Estimation by Adaptive Sampling. [Citation Graph (19, 14)][DBLP] PODS, 1990, pp:40-46 [Conf] Cites:
-
S. Seshadri, Jeffrey F. Naughton
On the Expected Size of Recursive Datalog Queries. [Citation Graph (1, 11)][DBLP] PODS, 1991, pp:268-279 [Conf] Cites:
-
François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman
Magic Sets and Other Strange Ways to Implement Logic Programs. [Citation Graph (156, 3)][DBLP] PODS, 1986, pp:1-15 [Conf]
-
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]
-
Michael J. Carey, David J. DeWitt, Michael J. Franklin, Nancy E. Hall, Mark L. McAuliffe, Jeffrey F. Naughton, Daniel T. Schuh, Marvin H. Solomon, C. K. Tan, Odysseas G. Tsatalos, Seth J. White, Michael J. Zwilling
Shoring Up Persistent Applications. [Citation Graph (56, 18)][DBLP] SIGMOD Conference, 1994, pp:383-394 [Conf] Cites:
-
Jeffrey F. Naughton
Compiling Separable Recursions. [Citation Graph (12, 10)][DBLP] SIGMOD Conference, 1988, pp:312-319 [Conf] Cites:
-
François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman
Magic Sets and Other Strange Ways to Implement Logic Programs. [Citation Graph (156, 3)][DBLP] PODS, 1986, pp:1-15 [Conf]
-
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]
-
Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. [Citation Graph (29, 12)][DBLP] SIGMOD Conference, 1989, pp:235-242 [Conf] Cites:
-
Jeffrey F. Naughton, Raghu Ramakrishnan
How to Forget the Past Without Repeating It. [Citation Graph (2, 9)][DBLP] VLDB, 1990, pp:278-289 [Conf] Cites:
-
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] Cites:
-
David J. DeWitt, Jeffrey F. Naughton, John C. Shafer, Shivakumar Venkataraman
Parallelising OODBMS Traversals: A Performance Evaluation [Citation Graph (2, 6)][DBLP] VLDB J., 1996, v:5, n:1, pp:3-18 [Journal] Cites:
|