|
|
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.
|
|
|
Family Trees Making from Archive Records
Pojezdál, Denis ; Kočí, Radek (referee) ; Rozman, Jaroslav (advisor)
This work studies the field of genealogy, various types of historical records, their processing, comparing and subsequent linking and storing in the form of a graph. The work expands the works of Bc. Marhefka and Ing. Tušimová, adds support for new types of input records and optimizes various aspects of the original program. New types of records and modifications are afterwards tested and compared on the original and extended datasets.
|
|
|
Data Synchronization between Two Databases
Nemček, Leopold ; Beran, Jan (referee) ; Rozman, Jaroslav (advisor)
This thesis focuses on the design and implementation of an extension for an application used for creating and editing family trees, called ProGenealogy. The extension enables importing data from the DEMoS system database, which contains transcriptions of civil registry records. Additionally, the extension provides the option to export the data to a Neo4j graph database. Finally, the extension was tested.
|
|
|
Indoor navigační systém
BARTOŠ, Michal
The topic of this bachelor thesis is to create a mobile application that allows optimal route search inside the buildings of the University of South Bohemia with respect to route parameters. The theoretical part deals with the analysis of requirements, methodology and on the basis of obtained information it selects ideal technologies for the application being developed. The practical part of the thesis describes implementation of selected technologies and subsequent testing of this application. The application implements user scenarios described in the theoretical part of the thesis.
|
|
|
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.
|
|
|
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 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.
|
|
|
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.
|
|
|
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 ::
