This report includes a development presentation of an information system for managing the staff data within a small company or organization. The system as such as it has been developed is called Employee Management System. It consists of functionally related GUI (application program) and database. The choice of the programming tools is individual and particular.

Thesis discusses distributed database systems and its advantages and disadvantages. Further, text informs about document database CouchDB, storage of documents, synchronization and CAP theorem. The aim of the thesis is to implement distributed document management system and workflow management system based on CouchDB. The system contains a cluster with three CouchDB nodes with HAProxy in front, which does load balancing. The system allows creation of any document based on the template, manages its life cycle and workflow. It is also possible to create a custom workflow using BRMS rules. The implemented solution simplifies document management and workflow and allows a high degree of customization for the organizations needs.

The aim of this diploma thesis is to create Geographic Information System (GIS) presentation of Jedovnice location. Created GIS presentation serve as a teaching tool for 2nd and 3rd year of Geodesy and Cartography field, Faculty of civil engineering, University of technology in Brno. Data processing was performed using Marushka Design program of Geovap group. Database entities management was processed in the SQLite Personal program. GIS presentation includes geodetic point field in specified location and tasks assignment for students. Designed system allows editing and managing of data already existed.

The thesis is focused on three basic parts – description of the theoretical and practical parts of measurements of LED modules front automotive headlamps, then design and realization of system for collecting and storing measurement data source and finally creation of server applications allowing via a web interface selection and display the required data.

he goal of this thesis is to analyze current situation in the area of internet commerce and design and implement own application to solve administration of customers and productcs of the firm, which deals with selling musical pieces in electronic form. The main component will be an internet shop based on subscribed custom accounts and enabled prompt offtake of the musical pieces. Designed system will be implemented as a WWW application in PHP language with using database MySQL.

The goal of the master ́s thesis is to study index methods, spatial data type objects in PostgreSQL database systems and to create SP-GiST index by quadtree in the PostGIS. The PostGIS is spatial database, which extends of PostgreSQL. PostGIS adds support for geographic and spatial objects. It is a big benefit. PostGIS has its own data types, methods and GiST index too, but there is SP-GiST index missing, therefore master's thesis was created.

Modern database systems have to process huge amounts of data and should provide results with low latency at the same time. To achieve this, data is nowadays typically hold completely in main memory, to benefit of its high bandwidth and low access latency that could never be reached with disks. Current in-memory databases are usually columnstores that exchange columns or vectors between operators and suffer from a high tuple reconstruction overhead. In this paper, we present the indexed table-at-a-time processing model that makes indexes the first-class citizen of the database system. The processing model comprises the concepts of intermediate indexed tables and cooperative operators, which make indexes the common data exchange format between plan operators. To keep the intermediate index materialization costs low, we employ optimized prefix trees that offer a balanced read/write performance. The indexed tableat-a-time processing model allows the efficient construction of composed operators like the multi-way-select-join-group. Such operators speed up the processing of complex OLAP queries so that our approach outperforms state-of-the-art in-memory databases.

The aim of this work was to design and implement the application that is easily, quickly and effectively able to determine the position in the www search engines based on the given World Wide Web pages and theirs key words. The application is accessible by the web interface and it enables comparison of the position statements from the archives, comparison of the graph outputs, as well as sending of PDF format files containing regular results statements. Together with the position it is stored the number of references of particular word in the search engine. Furthermore, it is possible to display also the position changes compared with the former statements. As stated above, it is possible to store the outputs in the PDF format documents and therefore it is easy to shore the entire development in your personal computer, in case online system is insufficient.

Sensor data sets are usually collected in a centralized sensor database system or replicated cached in a distributed system to speed up query evaluation. However, a high data refresh rate disallows the usage of traditional replicated approaches with its strong consistency property. Instead we propose a combination of grid computing technology with sensor database systems. Each node holds cached data of other grid members. Since cached information may become stale fast, the access to outdated data may sometimes be acceptable if the user has knowledge about the degree of inconsistency if unsynchronized data are combined. The contribution of this paper is the presentation and discussion of a model for describing inconsistencies in grid organized sensor database systems.

Graph-structured data is ubiquitous and with the advent of social networking platforms has recently seen a significant increase in popularity amongst researchers. However, also many business applications deal with this kind of data and can therefore benefit greatly from graph processing functionality offered directly by the underlying database. This paper summarizes the current state of graph data processing capabilities in the SAP HANA database and describes our efforts to enable large graph analytics in the context of our research project SynopSys. With powerful graph pattern matching support at the core, we envision OLAP-like evaluation functionality exposed to the user in the form of easy-to-apply graph summarization templates. By combining them, the user is able to produce concise summaries of large graph-structured datasets. We also point out open questions and challenges that we plan to tackle in the future developments on our way towards large graph analytics.