AAAAAA
Results:
1-9
|
Results: 9
Authors:
HAAS PJ
NAUGHTON JF
SESHADRI S
SWAMI AN
Citation: Pj. Haas et al., SELECTIVITY AND COST ESTIMATION FOR JOINS BASED ON RANDOM SAMPLING, Journal of computer and system sciences, 52(3), 1996, pp. 550-569
Authors:
SRIVASTAVA D
SUDARSHAN S
RAMAKRISHNAN R
NAUGHTON JF
Citation: D. Srivastava et al., SPACE OPTIMIZATION IN DEDUCTIVE DATABASES, ACM transactions on database systems, 20(4), 1995, pp. 472-516
Authors:
NAUGHTON JF
RAMAKRISHNAN R
SAGIV Y
ULLMAN JD
Citation: Jf. Naughton et al., ARGUMENT REDUCTION BY FACTORING, Theoretical computer science, 146(1-2), 1995, pp. 269-310
Authors:
SESHADRI S
NAUGHTON JF
Citation: S. Seshadri et Jf. Naughton, ON THE EXPECTED SIZE OF RECURSIVE DATALOG QUERIES, Journal of computer and system sciences, 51(2), 1995, pp. 137-148
Authors:
LIPTON RJ
NAUGHTON JF
Citation: Rj. Lipton et Jf. Naughton, QUERY SIZE ESTIMATION BY ADAPTIVE SAMPLING, Journal of computer and system sciences, 51(1), 1995, pp. 18-25
Authors:
CAREY MJ
DEWITT DJ
KANT C
NAUGHTON JF
Citation: Mj. Carey et al., A STATUS-REPORT ON THE OO7-OODBMS BENCHMARKING EFFORT, ACM SIGPLAN NOTICES, 29(10), 1994, pp. 414-426
Authors:
LI K
NAUGHTON JF
PLANK JS
Citation: K. Li et al., LOW-LATENCY, CONCURRENT CHECKPOINTING FOR PARALLEL PROGRAMS, IEEE transactions on parallel and distributed systems, 5(8), 1994, pp. 874-879
Authors:
NAUGHTON JF
RAMAKRISHNAN R
Citation: Jf. Naughton et R. Ramakrishnan, HOW TO FORGET THE PAST WITHOUT REPEATING IT, Journal of the Association for Computing Machinery, 41(6), 1994, pp. 1151-1177
Authors:
LIPTON RJ
NAUGHTON JF
SCHNEIDER DA
SESHADRI S
Citation: Rj. Lipton et al., EFFICIENT SAMPLING STRATEGIES FOR RELATIONAL DATABASE OPERATIONS, Theoretical computer science, 116(1), 1993, pp. 195-226
Risultati:
1-9
|