Algoritmy rozdělení uzlu v R-stromech

Abstract

R-tree is multi-dimensional data structure, which is still very popular and used structure for indexing spatial data nowadays. This bachelor thesis deals with description, implementation and deployment of node splitting algorithms in R-tree and its impact on performance of operations on the structure. The thesis contains description of the data structure in detail and description of basic operations with this structure. I will also mention description of the two variants of the R-tree, $R^+$-tree and R*-tree. It also contains description of database framework RadegastDB, which contains implementation of the tree and where is research of algorithms impact on its performance and properties. There is a sample of implementation of some algorithms in C++, in which I will test the difference in throughput of operations and properties with usage of choosen algorithms.