The Comparison Between T*_Tree And B+_Tree On Modern Hardware Revisited

DOI

10.2991/jimec-17.2017.17How to use a DOI?

Keywords

index structure, main memory databases, T*-Tree, B+Tree

Abstract

Database indexes have a significant impact to speed up access to particular item or items. While B+Tree is the most important index structure for disk-based database management systems (DBMS), T*-Tree is optimized for main memory access and widely used for in memory database system (IMDB). however, the prior researches made performance evaluation between T*-Tree and B+Tree on hardware with different memory hierarchy characteristics and single core CPU due to some of these studies published nearly two decades ago. In this paper, we implemented the state of the art of T*-Tree and B+Tree for main memory use. The two indexes structure were tested on modern hardware. Unlike the previous experimental results, our test performed shows that B+Tree is faster than T*-Tree in the most of the test cases.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Ahmad Abdullah
AU  - Qingfeng Zhuge
PY  - 2017/10
DA  - 2017/10
TI  - The Comparison Between T*_Tree And B+_Tree On Modern Hardware Revisited
BT  - Proceedings of the 2017 2nd Joint International Information Technology, Mechanical and Electronic Engineering Conference (JIMEC 2017)
PB  - Atlantis Press
SP  - 81
EP  - 84
SN  - 2352-538X
UR  - https://doi.org/10.2991/jimec-17.2017.17
DO  - 10.2991/jimec-17.2017.17
ID  - Abdullah2017/10
ER  -