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.

In-Memory-Datenbanken halten den gesamten Datenbestand permanent im Hauptspeicher vor. Somit können lesende Zugriffe weitaus schneller erfolgen als bei traditionellen Datenbanksystemen, da keine I/O-Zugriffe auf die Festplatte erfolgen müssen. Für schreibende Zugriffe wurden Mechanismen entwickelt, die Persistenz und somit Transaktionssicherheit gewährleisten. In-Memory-Datenbanken werden seit geraumer Zeit entwickelt und haben sich in speziellen Anwendungen bewährt. Mit zunehmender Speicherdichte von DRAM-Bausteinen sind Hardwaresysteme wirtschaftlich erschwinglich, deren Hauptspeicher einen kompletten betrieblichen Datenbestand aufnehmen können. Somit stellt sich die Frage, ob In-Memory-Datenbanken auch in betrieblichen Anwendungssystemen eingesetzt werden können. Hasso Plattner, der mit HANA eine In-Memory-Datenbank entwickelt hat, ist ein Protagonist dieses Ansatzes. Er sieht erhebliche Potenziale für neue Konzepte in der Entwicklung betrieblicher Informationssysteme. So könne beispielsweise eine transaktionale und eine analytische Anwendung auf dem gleichen Datenbestand laufen, d. h. eine Trennung in operative Datenbanken einerseits und Data-Warehouse-Systeme andererseits ist in der betrieblichen Informationsverarbeitung nicht mehr notwendig (Plattner und Zeier 2011). Doch nicht alle Datenbank-Vertreter stimmen darin überein. Larry Ellison hat die Idee des betrieblichen In-Memory-Einsatzes, eher medienwirksam als seriös argumentativ, als „wacko“ bezeichnet (Bube 2010). Stonebraker (2011) sieht zwar eine Zukunft für In-Memory-Datenbanken in betrieblichen Anwendungen, hält aber weiterhin eine Trennung von OLTP- und OLAP-Anwendungen für sinnvoll. [Aus: Einleitung]

In-memory databases are developed to keep the entire data in main memory. Compared to traditional database systems, read access is now much faster since no I/O access to a hard drive is required. In terms of write access, mechanisms are available which provide data persistence and thus secure transactions. In-memory databases have been available for a while and have proven to be suitable for particular use cases. With increasing storage density of DRAM modules, hardware systems capable of storing very large amounts of data have become affordable. In this context the question arises whether in-memory databases are suitable for business information system applications. Hasso Plattner, who developed the HANA in-memory database, is a trailblazer for this approach. He sees a lot of potential for novel concepts concerning the development of business information systems. One example is to conduct transactions and analytics in parallel and on the same database, i.e. a division into operational database systems and data warehouse systems is no longer necessary (Plattner and Zeier 2011). However, there are also voices against this approach. Larry Ellison described the idea of business information systems based on in-memory database as “wacko,” without actually making a case for his statement (cf. Bube 2010). Stonebraker (2011) sees a future for in-memory databases for business information systems but considers the division of OLTP and OLAP applications as reasonable. [From: Introduction]