Information Technology Journal1812-56381812-5646Asian Network for Scientific Information10.3923/itj.2006.159.165LiuBaoliang .LiJianzhong .1200651The Non-blocking Disk-tape join (NDT) presented in this study was the first disk-tape join algorithm designed with the goal
of producing join results as early as possible. It has three phases: the hashing phase, the merging phase and the probing
phase. Join results can be produced in each phase. Tuples of disk resident relation and tape resident relation was read
simultaneously into memory and be joined in the hashing phase. The merging phase joins those tuples that flushed onto disk
during the hashing phase. After the first two phases, disk resident relation has been partitioned and then joined with
remaining tape resident relation in the probing phase. Experimental results showed that NDT can produce join results much
earlier than the-state-of-art CDT-GH and the performance of NDT was about the same with that of CDT-GH.]]>Frew, J. and J. Dozier,1997262731Myllymaki, J. and M. Livny,199623279290Myllymaki, J. and M. Livny,19971997pp: 159168Kraiss, A., P. Muth and M. Gillmann,19991999pp: 552559Myllymaki, J. and M. Livny,199627-28453472Shapiro, L.,198611239264Wilschut, A. and P. Apers,19991999pp: 6877Urhan, T. and M.J. Franklin,2000232733Mokbel, M.F. and M. Lu and W.G. Aref,20042004pp: 251263Dittrich, J.P., B. Seeger, D.S. Taylor and P. Widmayer,20022002pp: 299310Hass, L.M., M.J. Carey and M. Livny,19931993Hagmann, R.B.,19861986pp: 289293