In-memory B-tree Implementation with AVX Instructions and Different Specifications

Author: Goderdzi Lominashvili
Keywords: B-tree, AVX Instructions, Optimization
Annotation:

B-tree is a well-known data structure, which is widely used in modern systems where the operations are executed on big blocks of data. Hence, improvement of B-tree structure is an important task, which will give us a possibility to use memory and process a huge number of data more quickly. Bellow, in this work, we discuss several B-tree implementations, which use in-memory features. Efficiency difference is analyzed experimentally by relying on the corresponding tests.

Lecture files:

In Memory B-Tree Implementation [ka]