An Index Structure for Main-memory Storage Systems using The Level Pre-fetching
INTERNATIONAL JOURNAL OF CONTENTS / INTERNATIONAL JOURNAL OF CONTENTS, (P)1738-6764; (E)2093-7504
2007, v.3 no.1, pp.19-23
https://doi.org/10.5392/ijoc.2007.3.1.019
Lee, Seok-Jae
(Department of Computer and Communication Engineering, Chungbuk National University)
Yoon, Jong-Hyun
(Department of Computer and Communication Engineering, Chungbuk National University)
Song, Seok-Il
(Department of Computer Engineering, Chungju National University)
Yoo, Jae-Soo
(Department of Computer and Communication Engineering, Chungbuk National University)
Lee, Seok-Jae,
Yoon, Jong-Hyun,
Song, Seok-Il,
&
Yoo, Jae-Soo.
(2007). An Index Structure for Main-memory Storage Systems using The Level Pre-fetching. INTERNATIONAL JOURNAL OF CONTENTS, 3(1), 19-23, https://doi.org/10.5392/ijoc.2007.3.1.019
Abstract
Recently, several main-memory index structures have been proposed to reduce the impact of secondary cache misses. In mainmemory storage systems, secondary cache misses have a substantial effect on the performance of index structures. However, recent studies still stiffer from secondary cache misses when visiting each level of index tree. In this paper, we propose a new index structure that minimizes the total amount of cache miss latency. The proposed index structure prefetched grandchildren of a current node. The basic structure of the proposed index structure is based on that of the CSB+-Tree, which uses the concept of a node group to increase fan-out. However, the insert algorithm of the proposed index structure significantly reduces the cost of a split. The superiority of our algorithm is shown through performance evaluation.
- keywords
-
Main-memory storage system,
Main-memory index structure,
Cache conscious,
Pre-fetch