Author:
Kumar V. Santhosh,Thazhuthaveetil M. J.,Govindarajan R.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Anderson, T., Culler, D., Patterson, D.: A Case for NOW (Networks of Workstations). IEEE Micro 16(1), 54–64 (1995)
2. Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
3. Chen, M.-S., Lo, M.-L., Yu, P.S., Young, H.C.: Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins. In: Proc. of 18th Very Large Data Bases, pp. 15–26 (August 1992)
4. DeWitt, D., Gray, J.: Parallel Database Systems: The future of High Performance Database Systems. Communications of the ACM 35(6), 85–98 (1992)
5. Jenkins, B. (1996),
http://burtleburtle.net/bob/c/lookup2.c