An enhanced main memory index structure employing the level prefetching technique

Authors:
Hyun Taek Hong;Jun Il Pee;Seok Il Song;Jae Soo Yoo
Affiliations:
Department of Computer & Communication Eng., Chungbuk National University, Cheongju, Chungbuk, Korea;Department of Computer & Communication Eng., Chungbuk National University, Cheongju, Chungbuk, Korea;Department of Computer & Communication Eng., Chungbuk National University, Cheongju, Chungbuk, Korea;Department of Computer & Communication Eng., Chungbuk National University, Cheongju, Chungbuk, Korea
Venue:
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Year:
2003

Citing 6
Cited 0

Making B+- trees cache conscious in main memory

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Main-memory index structures with fixed-size partial keys

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Improving index performance through prefetching

SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Cache Conscious Indexing for Decision-Support in Main Memory

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Database Architecture Optimized for the New Bottleneck: Memory Access

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Optimizing database architecture for the new bottleneck: memory access

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

In main-memory resident index structures, secondary cache misses have a considerable effect on the performance of index structures. Recently, several main-memory resident index structures that consider cache have been proposed to reduce the impact of secondary cache misses. However, they still suffer from full secondary cache misses whenever visiting each level of index trees. In this paper, we propose a new index structure that minimizes the total amount of cache miss latency. The proposed index structure prefetches the grandchildren of a current node. The basic structure of the proposed index structure is from CSB+-Tree that uses the concept of the node group to increase fan-out. However the insert algorithm of the proposed index structure reduces the cost of a split significantly. Also, we show the superiority of our algorithm through performance evaluation.