Implementace základních algoritmů nad B+ stromem

Abstract

This master thesis deals with implementation of the new version of B+tree in ATOM framework in C++ programming language. ATOM framework consists of interfaces and supportive classes for persistent data structures creation. Framework contains the first implementation of B+tree. This thesis deals with basic operations on B+tree such as delete, update and insert. This thesis describes the structure of a B-tree and a B+tree and differences between them. Further on, the ATOM framework and the first implementation of B+tree are described. There is an analysis for the new implementation and also an evaluation of its benefits and pitfalls. In the last part of this thesis there are tests of the new implementation and a comparison with the first implementation.