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


A shared memory parallel k-NN algorithm for M-tree index structure is introduced in this paper, which is called SMP k-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… (More)

3 Figures and Tables


  • Presentations referencing similar topics