|
|
Database for Genealogical Models
Vanka, Michal ; Zbořil, František (referee) ; Kočí, Radek (advisor)
This work, which extends the DEMoS project, deals with solving efficient storage of genealogical models in the database. For this purpose, different types and specific solutions of database systems are compared to find the most suitable one. After selecting the right solution, a structure for storing genealogical records is created, emphasizing the reduction of data redundancy compared to the original system for storing people in the DEMoS project. The work provides this system with a web user interface for the practical possibility of integration into the DEMoS project and convenient work with the database system.
|
|
|
Java AST Query Language
Bílek, Jiří ; Matula, Peter (referee) ; Křivka, Zbyněk (advisor)
The purpose of this thesis is to design a Java AST query language and implement tool that uses the query language. This work overviews graph databases and their libraries with focus on Neo4J and Titan. This thesis overviews tools Java bytecode analysis as well. Libraries Procyon and BCEL are described in detail. The work includes a proposal the query language and detailed description of the tool implementation, together with the detailed description of the way how Java entities are stored into the graph databases. In the end, the work deals with experiments and the evaluation of the time complexity of the library.
|
|
|
Interfaces for Faceted Search in Indexed Wikipedia
Cilip, Peter ; Otrusina, Lubomír (referee) ; Smrž, Pavel (advisor)
Main aim of this thesis is to study existing systems of faceted search and to design own system based on faceted search in the index of Wikipedia. In this thesis we can meet with existing solutions of faceted search. From mistakes and failures of existing solutions was designed our own system, that is output of this thesis. Designed system is described in way of design and implementation. Product of thesis is application and graphical interface. Application interface can be integrated into existing informational system, where it can be used as multidimensional filter. Graphical interface provides option how can application interface be used in real system. System was created focusing on usefullness and simplicity, for using in existing information systems.
|
|
| |
|
|
Database for Genealogical Models
Hoffmann, Michael ; Zbořil, František (referee) ; Kočí, Radek (advisor)
The bachelor thesis is part of the DEMoS project, aiming to create a system for managing digitized records of old registries. This thesis aims to design and develop an application with a database to allow users to manage created or generated genealogical models. At the same time, it will be possible to link people listed in the models with records in the database of digitized registries. Following technologies were used for the solution and implementation - PHP, Javascript, HTML, CSS, and Neo4j.
|
|
|
Distributed Big Data Processing on the Java Platform
Tutko, Jakub ; Rychlý, Marek (referee) ; Burget, Radek (advisor)
This thesis is focused on the distributed Big Data processing on the Java platform, together with graph databases. It analyses several graph database distributions and the possibilities to connect them to the Apache Hadoop system for distributed data processing. For the purpose of testing database solutions effectiveness, the thesis outcome is an application, which is downloading data from social networks Twitter and Facebook. It is able to write and analyse data with two different database frameworks which are Halyard and HGraphDB.
|
|
|
Family Trees Making from Parish Records
Marhefka, Adam ; Šátek, Václav (referee) ; Rozman, Jaroslav (advisor)
This work will discuss the field of genealogy, processing, comparing, and classifying genealogical data and subsequent connection of this processed data into bigger structures in graph database. This work directly continues the work of Ing Tušimová and further expands it. The expansions described in the work will be dedicated to addition of support for more forms of input genealogical data, optimization and expansions of the core algorithm realizing the processing of genealogical records. The goal of this work is therefore to make the core algorithm more efficient and precise as well as the addition of support for parish records of marriages and deaths.
|
|
|
Database for Genealogical Data
Kafoněk, Marek ; Kočí, Radek (referee) ; Rozman, Jaroslav (advisor)
This work deals with the possible transfer of genealogical data between graph and relational databasis, which builds on existing data stored in the graph database Neo4j. Possible transfers will be used to work with the data as needed using SQL in a relational database, or using Cypher in a chart database.
|
|
|
Testing of Various Databases for Genealogy
Dvořák, Jan ; Kočí, Radek (referee) ; Rozman, Jaroslav (advisor)
The aim of this work is to design and create database structures appropriate to keep genealogical data. Data are generated by a self-created script using information from publically available resources. Individual databases are being compared with each other and wheather they are suitable to save genealogical data or not. Databases MySQL and Neo4j were used for the solution.
|
|
|
Large Graph Data Visualisation on the Web
Jarůšek, Tomáš ; Bartík, Vladimír (referee) ; Burget, Radek (advisor)
Graph databases provide a form of data storage that is fundamentally different from a relational model. The goal of this thesis is to visualize the data and determine the maximum volume that current web browsers are able to process at once. For this purpose, an interactive web application was implemented. Data are stored using the RDF (Resource Description Framework) model, which represents them as triples with a form of subject - predicate - object. Communication between this database, which runs on server and client is realized via REST API. The client itself is then implemented in JavaScript. Visualization is performed by using the HTML element canvas and can be done in different ways by applying three specially designed methods: greedy, greedy-swap and force-directed. The resulting boundaries were determined primarily by measuring time complexities of different parts and were heavily influenced by user's goals. If it is necessary to visualize as much data as possible, then 150000 triples were set to be the limiting volume. On the other hand, if the goal is maximum quality and application smoothness, then the limit doesn't exceed a few thousand.
|
guest ::
