|
|
Praktické datové struktury
Pokorný, Michael ; Mareš, Martin (advisor) ; Babka, Martin (referee)
In this thesis, we implement several data structures for ordered and unordered dictionaries and we benchmark their performance in main memory on synthetic and practical workloads. Our survey includes both well-known data structures (B-trees, red-black trees, splay trees and hashing) and more exotic approaches (k-splay trees and k-forests). Powered by TCPDF (www.tcpdf.org)
|
|
|
Implementation of Sum Data Type in C++
Novák, Samuel Matyáš ; Roupec, Jan (referee) ; Matoušek, Radomil (advisor)
Práce se zaobírá problematikou implementace součtového datového typu v jazyce C++. Nejprve navrhuje vlastní abstrakce pro manipulaci s posloupnostmi hodnot a typů, které následně umožňují vyjadřovat komplexní operace deklarativně. V průběhu implementace jsou prezentovány návrhové vzory obvyklé pro oblast metaprogramování. Implementace přichází s rozhodnutími odlišnými od referenční implementace. Pro manipulaci se součtovým typem jsou představeny dvě šablony funkce, lišící se sémantikou. Užití součtového typu je ukázano na příkladu konečného stavového automatu.
|
|
|
.NET's LINQ Optimization
Šerý, Daniel ; Ryšavý, Ondřej (referee) ; Pluskal, Jan (advisor)
This thesis deals with LINQ (Language integrated query) and investigates possibilities of its implementation and optimization in C# language. Method of rewriting of query to procedural code is chosen and implemented. The goal is to provide a LINQ that can be used in code with the need for high speed. Regarding the program created for rewriting LINQ queries, the performance of most operators has been increased by 1.2x to 20x of System.Linq speed depending of rewritten algorithm, data source and provided information to rewriting program.
|
|
|
Interactive Data Structures
PRŠALA, Jan
The goal of this thesis is creating simple application for teaching dats structures - mostly focusing on data structures queue, stack, linked list, binary search tree and hash table. Each data structure is contained in its own modul and is shown on an example from the real world and in an abstract example, which can be modified by the user. This thesis itself contains the description of the data structures mentioned above. Instructions on how to add more modules are also there. The application itself with all the source code and the example of implementation of each data structure is located on the enclosed CD.
|
|
|
Modern TreeView Component for the Web
Berky, Levente ; Smrčka, Aleš (referee) ; Turoňová, Lenka (advisor)
Tato práce se zabývá tvorbou webové komponenty k zobrazení hierarchické struktury ve tvaru stromu. Práce zkoumá aktuální situace webu a webových komponent, vyšetřuje podobné "tree view" komponenty a popisuje základy v nich použitých technologií. Praktická část popisuje požadavky na navrhovanou komponentu a zabývá se procesem vývoje a samotné implementace. Dále je popsán proces testování a měření výkonu a jejich výsledky.
|
|
| |
|
| |
|
|
Praktické datové struktury
Pokorný, Michael ; Mareš, Martin (advisor) ; Babka, Martin (referee)
In this thesis, we implement several data structures for ordered and unordered dictionaries and we benchmark their performance in main memory on synthetic and practical workloads. Our survey includes both well-known data structures (B-trees, red-black trees, splay trees and hashing) and more exotic approaches (k-splay trees and k-forests). Powered by TCPDF (www.tcpdf.org)
|
|
|
Data structures for rendering non-polygonal geometry
Kuckir, Ivan ; Křivánek, Jaroslav (advisor) ; Vorba, Jiří (referee)
In modern 3D graphics, scenes made of triangles are usually used, combined with methods based on ray tracing. Hierarchical data structures, called accelerating trees, are often used to speed up the search for intersection between ray and the scene. When testing the best current methods with non-polygonal geometry (line segments), we have found out that those structures cannot build an effective tree in many cases. The aim of this work is to formulate the problem mathematically. Thanks to this, the whole subject becomes more transparent and we can see the shortcomings of current methods, which have not yet been pointed out. At the result, we develop an algorithm which generalizes all current methods, which is not dependent on geometry and directly shows the space for improvement.
|
|
|
Persistent data structures in C
Hájek, Jakub ; Kopecký, Michal (advisor) ; Falt, Zbyněk (referee)
Persistent data structures in C Abstract: This work describes the design and implementation of persistent data structures framework for C programming language. It discusses effective imple- mentation of persistent structures and providing transparent manipulation of data. This work defines services which should be provided by persistent layer and tries to define some general persistent layer interface for good extensibility. In the end it analyses performance issues of various data storages and tries to specify class of applications, which could use persistent data structures framework. Keywords: persistent tree structures, C, data structures
|
guest ::
