Algoritmy pro rychlé indexování textu

Abstract

When we are working with text data, the very common problem is to find fast effective method for finding strings. Under this term, we can imagine various methods for checking duplicates or finding specific values based on search keys. Many of those problems solving algorithms based on hash functions. Hash functions can be used in various application areas. Those can be information authenti-cation, cloud comparisons in could solutions, checking message integrity and many others. The focus of this diploma thesis is to find and compare suitable algorithms for fast text in-dexing, more specific on hexadecimal strings (MD5, SHA-1, SHA-512). When comparing, I will focus on important aspects and constrains of the algorithms, their structural complexity, search-ing for strings and consumed memory.