By Topic

A Shared Memory Parallel k-NN Query Algorithm for M-tree

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

5 Author(s)
Chu Qiu ; High Performance Comput. Center, Commun. Univ. of China, Beijing, China ; Yongquan Lu ; Pengdong Gao ; Jintao Wang
more authors

A shared memory parallel k-NN algorithm for M-tree index structure is introduced in this paper, which is called SMP A-NN. The processing of the pending request (PR) queue is a core operation in the traditional k-NN query algorithm, which is also time-consuming. Therefore, we separate the long queue into multi-parts and assign them to different threads. This improvement takes full advantage of SMP architecture and can keep good load balancing between threads. We implement this algorithm on a common shared memory parallel PC server. A lot of experiments have illustrated the proposed SMP k-NN can speed up the query and improve the performance of M-tree for large dataset.

Published in:

Management and Service Science, 2009. MASS '09. International Conference on

Date of Conference:

20-22 Sept. 2009