Experimental B+-tree for GPU
Warsaw University of Technology, pl. Politechniki 1, 00-661 Warsaw, Poland
Proceedings II of the 15th East-European Conference on Advances in Databases and Information Systems (ADBIS 2011), 2011
@article{kaczmarski2011experimental,
title={Experimental B+-tree for GPU},
author={Kaczmarski, K.},
year={2011}
}
The main intention of this work is to create a dictionary structure which could benefit from massive parallelism of threads when performing computation on all or a selected set of elements, while having an ability to search for and insert keys very quickly, yet preserving the order of elements. So far, no such structure dedicated for GPU exists. This paper presents results of the first to our knowledge B+-tree implementation in CUDA C language.
October 20, 2011 by hgpu
