PARALLEL OPTIMISATION OF JOIN QUERIES USING A TECHNIQUE OF EXHAUSTIVE NATURE 1
暂无分享,去创建一个
[1] Arun N. Swami,et al. Optimization of large join queries: combining heuristics and combinatorial techniques , 1989, SIGMOD '89.
[2] David J. DeWitt,et al. Parallel database systems: the future of database processing or a passing fad? , 1990, SGMD.
[3] Yannis E. Ioannidis,et al. Randomized algorithms for optimizing large join queries , 1990, SIGMOD '90.
[4] Eugene Wong,et al. Query optimization by simulated annealing , 1987, SIGMOD '87.
[5] Leonard D. Shapiro,et al. Join processing in database systems with large main memories , 1986, TODS.
[6] Won Kim,et al. On optimizing an SQL-like nested query , 1982, TODS.
[7] Myra Spiliopoulou,et al. Translation of SQL queries into a graph structure: query transformations and pre-optimization issues in a pipeline multiprocessor environment , 1992, Inf. Syst..
[8] Patricia G. Selinger,et al. Access path selection in a relational database management system , 1979, SIGMOD '79.
[9] Yannis E. Ioannidis,et al. Left-deep vs. bushy trees: an analysis of strategy spaces and its implications for query optimization , 1991, SIGMOD '91.
[10] Arun N. Swami,et al. Optimization of large join queries , 1988, SIGMOD '88.
[11] Stanley Y. W. Su,et al. An Evaluation of Relational Join Algorithms in a Pipelined Query Processing Environment , 1988, IEEE Trans. Software Eng..