|
| |
|
| |
|
|
Data Structure Proposal and Website Design for Mystery Shopping Agency
Blahušiaková, Barbora ; Lát, Radek (referee) ; Klusák, Aleš (advisor)
The main object of this thesis is a data structure proposal as a base for a website and information system for a mystery shopping company. The data structure and website will minimize employee’s mistakes, simplify their work and shorten time intervals in communication between employees and company’s clients. The theoretical part of bachelor thesis describes resources and methods used for the creation of the data structure and company’s website. The analytical part will be defining and describing the company’s requirements as a basis for proposal of data structure and realization of the company’s website. Furthermore, the thesis contains concrete real design of data structure and website.
|
|
| |
|
|
Suggestion of data architecture of Intranet and „data mining“ using SQL server
Herman, Jan ; Procházka, Jiří (referee) ; Kříž, Jiří (advisor)
The bachelor thesis proposes data structure of the intranet and the usage of the SQL language in data research. The output of the work is an intranet proposed for a particular organization. Data and functional modeling were used for the suggestion of the data structure and the SQL language served as a basis for creating queries. These queries allow the network user, server administrator and the director of an organization to control the data in a transparent manner. The work is based on the analysis of the current situation and of the information available, though it has been also influenced by modern trends.
|
|
|
Database System Analysis and Implementation
Třetina, Jan ; Ráb, Jaroslav (referee) ; Zendulka, Jaroslav (advisor)
With the increase of demands for the speed and availability of the information technologies, the process of optimization gains more and more importance. Concerning search engine optimization, optimization of operating systems or application optimization (source code), the goal is to gain faster, smaller and more maintainable solution. In my thesis I deal with optimization of database systems, which includes low level of database tuning - physical organization of data and indices, database management system tuning and query optimization. I focused on optimization of Microsoft SQL Servers 2005 in enterprise environment.
|
|
| |
|
|
Practical Efficiency of Containers
Halámka, Jan ; Letko, Zdeněk (referee) ; Holík, Lukáš (advisor)
This thesis is about theorethical and practical comparrison of following data containers: vector, deque, list, hash table, avl-tree, rb-tree, splay-tree, sg-tree, treap, B-tree, binomial heap, fibonacci heap, rope and skiplist while implementing sets. Asymptotic, amortized and average-case complexity for each of those structures are noted, as well as details about their implementation and description of how are they stored in computer memory. There was also created a set of tests for comparrison purposes, its results are also part of this paper.
|
|
|
Data Structures with Paralell Access
Opletal, Tomáš ; Lengál, Ondřej (referee) ; Holík, Lukáš (advisor)
Parallel programming brings out, apart from the opportunity to spread out a program execution to many simultaneously running processes sharing data, some new problems. It is necessary to synchronize these processes running in parallel and make sure that during the process communication and data sharing there will not arise any troubles. These synchronization algorithms also cannot use too much resources that are otherwise used for the actual program. This thesis describes ways of process synchronization and also provides an implementation of several algorithms for parallel queue. Implemented algorithms were also tested for their performance.
|
|
|
Hybrid databases
Hušek, Radek ; Mareš, Martin (advisor) ; Lokoč, Jakub (referee)
This thesis presents design and implementation of a data structure, which tries to combine advantages of both databases and regular data structures. Main advantages of databases we try to retain are data persistence through storing data on a hard disk and working with data using transactions which allows us parallel access without danger of inconsistency. From data structures we borrow the implementation as a library of functions and the aim on simplicity and storing data in memory. Our implementation is built around the concept of (software) transactional memory; all data are stored on hard drive as log of operations. 1
|
guest ::
