By Topic

Distributed Processes on Tree Hash

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yasuda, K. ; Dept.of Elect. & Elect. Eng., Hosei Univ., Tokyo ; Miura, T. ; Shioya, I.

Dynamic hash allows us to adjust the size of hash space dynamically according to the amount of data so that we obtain the nice time/space efficiency of the hash space. One of the proposed techniques is linear hash (LH). However, practically the technique doesn't always provide us with suitable results, especially in the case of collective (consecutive) inserts. In this investigation, we propose a new novel approach, called tree hash (TH), for the purpose of sophisticated dynamic hash processing. Here we assume distributed environment, i.e., many CPUs and huge amount of data storage connected through high speed network with each other. We show empirically the several excellent properties compared to LH*, a distributed LH

Published in:

Computer Software and Applications Conference, 2006. COMPSAC '06. 30th Annual International  (Volume:2 )

Date of Conference:

17-21 Sept. 2006