Parallel high-dimensional index structure using cell-based filtering for multimedia data

  • Authors:
  • Jae-Woo Chang;Yong-Ki Kim;Young-Jin Kim

  • Affiliations:
  • Dept. of Computer Eng., Chonbuk National Univ., Chonju, Chonbuk, South Korea;Dept. of Computer Eng., Chonbuk National Univ., Chonju, Chonbuk, South Korea;Dept. of Computer Eng., Chonbuk National Univ., Chonju, Chonbuk, South Korea

  • Venue:
  • ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A large number of high-dimensional index structures suffer from the so called 'dimensional curse' problem, i.e., the retrieval performance becomes increasingly degraded as the dimensionality is increased. To solve this problem, the cell-based filtering scheme has been proposed, but it shows a linear decrease in performance as the dimensionality is increased. In this paper, we propose a parallel high-dimensional index structure using the cell-based filtering for multimedia data so as to cope with the linear decrease in retrieval performance. In addition, we devise data insertion, range query and k-NN query processing algorithms which are suitable for the cluster-based parallel architecture. Finally, we show that our parallel index structure achieves good retrieval performance in proportion to the number of servers in the cluster-based architecture and it outperforms a parallel version of the VA-File when the dimensionality is over 10.