Join algorithm costs revisited

VLDB Journal

Volumn 5, Issue 1, 1996, Pages 64-84

  Harris, Evan P ^a   Ramamohanarao, Kotagiri ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Join algorithms; Minimisation; Optimal buffer allocation

Indexed keywords

EID: 0002124265     PISSN: 10668888     EISSN: None     Source Type: Journal    
DOI: 10.1007/s007780050016     Document Type: Article

References (29)

1. Aarts E, Korst J (1989) Simulated annealing and Boltzmann machines. Wiley, New York
2. Bitton D, DeWitt DJ, Turbyfill C (1983) Benchmarking database systems a systematic approach. In: Schkolnick M, Thanos C (eds) Proceedings of the Ninth International Conference on Very Large Databases, Florence, pp. 8-19
3. Blasgen MW, Eswaran KP (1977) Storage and access in relational data bases. IBM Syst J 16(4):363-373
4. Cheng J, Haderle D, Hedges R, Iyer BR, Messinger T, Mohan C, Wang, Y (1991) An efficient hybrid join algorithm: a DB2 prototype. In: Proceedings of the Seventh International Conference on Data Engineering, IEEE Computer Society Press,Kobe, Japan, pp. 171-180
5. DeWitt DJ, Gerber R (1985) Multiprocessor hash-based join algorithms. In: Apers PMG, Wiederhold G (eds) Proceedings of the Eleventh International Conference on Very Large Databases, Stockholm, Sweden, pp. 151-164
6. DeWitt DJ, Katz RH, Olken F, Shapiro LD, Stonebraker MR, Wood D (1984) Implementation techniques for main memory database systems. In: Yormark B (ed) Proceedings of the 1984 ACM SIGMOD International Conference on the Management of Data, Boston, Mass., pp. 1-8
7. Graefe G (1993) Query evaluation techniques for large databases. ACM Computing Surv 25:73-170
8. Haas PJ, Swami AN (1992) Sequential sampling procedures for query size estimation. In: Stonebraker, M. (ed) Proceedings of the 1992 ACM SIGMOD International Conference on the Management of Data, San Diego, Calif, pp. 341-350
9. Hagmann RB (1986) An observation on database buffering performance metrics. In: Kambayashi Y (ed) Proceedings of the Twelfth International Conference on Very Large Data Bases, Kyoto, Japan, pp. 289-293
10. Harris EP, Ramamohanarao K (1994) Using optimized multi-attribute hash indexes for hash joins. In: Sacks-Davis R (ed) Proceedings of the Fifth Australasian Database Conference, Global Publications Services, Christchurch, New Zealand, pp. 92-111
11. Hua KA, Lee C (1991) Handling data skew in multiprocessor database computers using partition tuning. In: Lohman GM, Sernadas A, Camps R (eds) Proceedings of the Seventeenth International Conference on Very Large Data Bases, Barcelona, Spain, pp. 525-535
12. Kitsuregawa M, Tanaka H, Moto-oka T (1983) Application of hash to data base machine and its architecture. New Generation Comput 1:66-74
13. Kitsuregawa M, Nakayama M, Takagi M (1989) The effect of bucket size tuning in the dynamic hybrid GRACE hash join method. In: Apers, PMG, Wiederhold G (eds) Proceedings of the Fifteenth International Conference on Very Large Data Bases, Amsterdam, pp. 257-266
14. Knuth DE (1973) Sorting and searching. (The art of computer programming, vol. 3) Addison-Wesley, Reading, Mass.
15. Lipton RJ, Naughton JF, Schneider DA (1990) Practical selectivity estimation through adaptive sampling. In: Garcia-Molina H, Jagadish HV (eds), Proceedings of the 1990 ACM SIGMOD International Conference on the Management of Data, Atlantic City, NJ, pp. 1-11
16. McVoy LW, Kleiman SR (1991) Extent-like performance from a UNIX file system. In: Proceedings of the USENIX 1991 Winter Conference, Dallas, Texas, pp. 33-43
17. Merrett TH (1981) Why sort-merge gives the best implementation of the natural join. SIGMOD Rec 13:39-51
18. Mishra P, Eich MH (1992) Join processing in relational databases. ACM Computing Surv 24:63-113
19. Nakayama M, Kitsuregawa M, Takagi M (1988) Hash-partitioned join method using dynamic destaging strategy. In: Bancilhon F, DeWitt DJ (eds) Proceedings of the Fifteenth International Conference on Very Large Data Bases, Los Angeles, Calif, pp. 468-478
20. Omiecinski E (1991) Performance analysis of a load balancing hash-join algorithm for a shared memory multiprocessor. In: Lohman GM, Sernadas A, Camps R. (eds) Proceedings of the Seventeenth International Conference on Very Large Databases, Barcelona, pp. 375-385
21. Omiecinski E, Lin ET (1992) The adaptive-hash join algorithm for a hypercube multicomputer. IEEE Trans Parallel Distrib Syst 3:334-349
22. Pang H, Carey MJ, Livny M (1993) Partially preemptible hash joins. In: Proceedings of the 1993 ACM SIGMOD International Conference on the Management of Data, Washington, DC, pp. 59-68
23. Richardson JP, Lu H, Mikkilineni K (1987) Design and evaluation of parallel pipelined join algorithms. In: Dayal U, Traiger I (eds) Proceedings of the 1987 ACM SIGMOD International Conference on the Management of Data, San Francisco, Calif, pp. 399-409
24. Schneider DA, DeWitt DJ (1989) A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In: Clifford J, Lindsay B, Maier D. (eds) Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, Portland, Ore, pp. 110-121
25. Shapiro LD (1986) Join processing in database systems with large main memories. ACM Trans Database Syst 11:239-264
26. Shatdal A, Naughton JF (1993) Using shared virtual memory for parallel join processing. In: Proceedings of the 1993 ACM SIGMOD International Conference on the Management of Data, Washington, DC, pp. 119-128
27. Sun W, Ling Y, Rishe N, Deng Y (1993) An instant and accurate size estimation method for joins and selection in a retrieval-intensive environment. In: Proceedings of the 1993 ACM SIGMOD International Conference on the Management of Data, Washington, DC, pp. 79-88
28. Vaghani J, Ramamohanarao K, Kemp DB, Somogyi Z, Stuckey PJ, Leask TS, Harland J (1994) The Aditi deductive database system. VLDB J, 3:245-288
29. Walton CB, Dale AG, Jenevein RM (1991) A taxonomy and performance model of data skew effects in parallel joins. In: Lohman GM, Sernadas A, Camps R. (eds) Proceedings of the Seventeenth International Conference on Very Large Databases, Barcelona, pp. 537-548