Dynamické lineární hašovaní zachovávající uspořádání

Abstract

Hash table is widely used data structure, valued for its fast writing and reading of data. But the data are stored in random like order internally and it is not possible to perform range queries over the hash table without checking all the stored records. The bachelor thesis goal is to implement three hashing algorithms, all altered to provide preserving the order, thus the items inserted into hash tables will be stored in a sorted order according to the values of their keys. Such hash tables could be competitive to trees in the deployment in database systems. Implemented will be namely the linear and the extendible hashing, and the hash table with fixed size. These algorithms are well known for many years and commonly used. The project will be developed in Microsoft Visual Studio 2013 and the C++ programming language will be used. Classes of hash tables will be integrated into the RadegastDB framework (formerly QuickDB), which is being developed at Computer Science Department of VŠB-TU Ostrava.