DocumentCode
167466
Title
Performance analysis of B+-Tree and CSB+-Tree in main memory database
Author
Fengdong Sun ; Lan Wang
Author_Institution
Dept. Of Comput. Sci. & Technol., DaLian Neusoft Univ. of Inf., Dalian, China
fYear
2014
fDate
8-9 May 2014
Firstpage
265
Lastpage
268
Abstract
The bottleneck is not the disk I/O but CUP clock speed faster than the memory speed in main memory database. In order to achieve high performance in main memory database, it is a good approach to design new index structures to improve the memory access speed. This paper establishes a cost model for B+-Tree and CSB+-Tree and analyze several parameters that influence the access performance such as key size, pointer size, node size, number of records, number of duplicate values, data orderliness and so on.
Keywords
database management systems; storage management; tree data structures; CSB+-tree; CUP clock speed; cost model; data orderliness; duplicate values number; index structures; main memory database; memory access speed; node size; performance analysis; pointer size; record number; Clocks; Manganese; Memory management; B+-Tree; CSB+-Tree; Cache Sensitive; Main Memory Databases;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Computer and Applications, 2014 IEEE Workshop on
Conference_Location
Ottawa, ON
Type
conf
DOI
10.1109/IWECA.2014.6845607
Filename
6845607
Link To Document