By Topic

Multithreaded Linear Hashing with Disk Buffer

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)
Hai-Hao Tang ; Sch. of Comput. Sci. & Eng., South China Univ. of Technol., Guangzhou, China ; Hu Chen ; Jiang-Feng Peng

Multi-core computers have become increasingly popular, in order to improve the performance of index in database systems on multi-core computers, and this paper presents an alternative algorithm of linear hashing and multithreaded disk buffer on multi-core computers. In this algorithm, records can be inserted into hash table concurrently by different threads. The key of the parallel insertion is to make traditional insertion into batch insertion. Multithreaded disk buffer is developed for multithreaded linear hashing, making multithreads allocate and release memory simultaneously as much as possible. It is applied to maximize memory utilization and to minimize the number of disk accesses. Our experimental result shows that, compared to traditional serial linear hashing, multithread linear hashing achieves a higher performance on multi-core computers.

Published in:

Database Technology and Applications, 2009 First International Workshop on

Date of Conference:

25-26 April 2009