Dynamická cache pro komprimované R*-stromy

Abstract

Constrains of RAM memory and that's why many of accesses to hard disk forcing software developers cache-conscious work with main memory, e.g cache memory. This is described on CSB+-trees, where we can see, how a cache-conscious trees, with good size of nodes and continuously adressed memory goes to improvement all variables of trees. In this thesis I~implement dynamic cache into algoriths of compresses R*-tree developed by FEI and compare my solution with original solution.