An efficient cache conscious multi-dimensional index structure

  • Authors:

  • Jeong Min Shim;Seok Il Song;Jae Soo Yoo;Young Soo Min

  • Affiliations:

  • Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Republic of Korea;Department of Computer Engineering, Chungju National University, Irymeon Gumdanli, Chungju, Chungbuk, Republic of Korea;Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Republic of Korea;Department of Computer and Communication Engineering, Chungbuk National University, 48 Gaesin-dong, Cheongju Chungbuk, Republic of Korea

  • Venue:
  • Information Processing Letters
  • Year:
  • 2004

Quantified Score

Hi-index 0.89

Visualization

Abstract

Recently, to relieve the performance degradation caused by the bottleneck between CPU and main memory, cache conscious multi-dimensional index structures have been proposed. The ultimate goal of them is to reduce the space for entries so as to widen index trees and minimize the number of cache misses. The existing index structures can be classified into two approaches according to their entry reduction methods. One approach is to compress MBR keys by quantizing coordinate values to the fixed number of bits. The other approach is to store only the sides of minimum bounding regions (MBRs) that are different from their parents partially. The second approach works well when the size of a node is small and the number of entries is small. In this paper, we investigate the existing multi-dimensional index structures for main memory database systems through experiments under the various work loads. Then, we propose a new index structure that exploits the properties of the both techniques. We implement existing multi-dimensional index structures and the proposed index structure. We perform various experiments to show that our approach outperforms others.