B-Tree exercise tool
A B-tree is a structure for storing data and indexes in relational da- tabases. The nodes of a B-tree can hold more than one element. The elements are stored in a sorted order and various algorithms ensure that the tree stays balanced.
The aim of this thesis is the implementation of a web-based exercise tool to illustrate and deepen the concepts and algorithms of B-trees. For this purpose, the tool represents the tree and the operation graphically and animated. At the same time a tutorial is displayed to the respective algorithm.
For the implementation of the tools, the Google Web Toolkit and its expansion GXT is used.