Cache and indexing of unstructured data


In this thesis algorithms for construction of data structures for a long texts, are introduced. In the beginning, the overview of the DNA structure is given, as an example of a long text. Several examples of data structures are described. In the same part of thesis, the memory hierarchy, which influences algorithm execution speed, is described. In the main part each algorithm is presented in its own chapter, where the construction process is divided into number of stages. Each stage is described and illustrated with concrete example. The last part gives the comparison of algorithms with respect to time and space complexity, both for the construction of data structures as queries. It also presents the results of time measurements and measurements of I/O accesses

Similar works

Full text

thumbnail-image time updated on 7/27/2014View original full text link

This paper was published in ePrints.FRI.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.