Porovnání vlastností různých implementací uzlů datových struktur

Abstract

This thesis deals with problems of paged data structures and transaction processing. There are described data structures B-tree, B+tree and sequential aray. Transaction processing is conceived in relation to the transaction and system recovery. This is related to definition of transaction and introduction to the basic techniques of recovery.

In next part of this work is described RadegastDB database framework which is developing of database group at the Department of Computer Science in VŠB.

In the practical part is described imlementation of RadegastDB framework extended to support of transaction processing and the possibility of deleting and updating the B+tree.

The final section is devoted to measurement of the impact of transaction processing on performance of operations at the B+tree and sequential array.