In-Memory B-trees

Author: Vakhtangi Laluashvili
Keywords: b-tree, In Memory
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 possibility to process huge number of data more quickly. Bellow, in this work, we discuss B-tree implementations, which use in-memory features. Efficiency difference is analyzed experimentally by relying on the corresponding tests.

Lecture files:

In-Memory B-ხეები [ka]