Procesor relační algebry

Abstract

Main goal of this thesis is design and implementation of relational algebra processor capable of executing queries over actual data and creating execution plan, which will be stored in tree structure. Another thing associated with processor is design of language and implementation of its operators. Another very important topic is relation algebra itself, which will be described at the first part of the thesis. Last part of thesis is to compare my processor with already existing programs.