Paměťová implementace datové struktury UB-strom

Abstract

This diploma will describe my implementation of memory oriented UB-tree. This work includes description of B-tree, special cases and customisations of B-tree. These include B+ tree and range B+ tree, from which UB-tree is derived. Z-curves and z-addresses, which are key concept for grasping UB-tree, are analysed along with description of principles and operations of UB-tree. Implementation part of diploma features descriptions and comparisons of range B+ tree and UB-tree implementations. It also features detailed description of elementary algorithms for manipulation with z-curve and z-addresses.