|
|
Family Trees Making from Parish Records
Tušimová, Lucia ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This work discusses the field of genealogy, different types of records and data in them. The thesis describes the topic of comparison of data and record linkage. It further it also discusses the design and implementation of the resulting system. The developed system connects people from parish records to larger pedigrees. These are then stored in the form of a graph database. The success of the interconnection of records was tested on the provided data sets.
|
|
|
RDF Data Visualization in Web Browsers
Škrobánek, Kristián ; Polčák, Libor (referee) ; Burget, Radek (advisor)
This diploma thesis focuses on graph database data visualization, where data is stored in RDF format. Standard visualisation of RDF data in tables does not offer sufficiently usable user view. One of the goals of this work is to show RDF data in interactive graph, which is ideal form of viewing data considering lucidity and information value. The graph gives good view of not only the data itself but also relationships between the data. Another goal is to test ability of browsers to visualize large amounts of data.
|
|
|
RDF Data Visualization in Web Browsers
Škrobánek, Kristián ; Polčák, Libor (referee) ; Burget, Radek (advisor)
This diploma thesis focuses on graph database data visualization, where data is stored in RDF format. Standard visualisation of RDF data in tables does not offer sufficiently usable user view. One of the goals of this work is to show RDF data in interactive graph, which is ideal form of viewing data considering lucidity and information value. The graph gives good view of not only the data itself but also relationships between the data. Another goal is to test ability of browsers to visualize large amounts of data.
|
|
|
Family Trees Making from Parish Records
Tušimová, Lucia ; Zbořil, František (referee) ; Rozman, Jaroslav (advisor)
This work discusses the field of genealogy, different types of records and data in them. The thesis describes the topic of comparison of data and record linkage. It further it also discusses the design and implementation of the resulting system. The developed system connects people from parish records to larger pedigrees. These are then stored in the form of a graph database. The success of the interconnection of records was tested on the provided data sets.
|
|
|
An Editor of Family Trees
Turčanová, Andrea ; Holubová, Irena (advisor) ; Hryzlík, Pavel (referee)
In contemporary world, there is a lot of different social applications. This work aims to create user friendly genealogic application similar to MyHeritage.com. This application allows users to create and edit their own family tree, search for matches based on similarity with the possibility to merge family trees. Among other functionalities, the application provides users with possibilities to create photogallery, share information or display profiles of other persons. As a base for processing and storing graph data like family trees graph database Neo4j was used whose performance was later tested and compared with selected relational database.
|
|
|
Analysis and Experimental Comparison of Graph Databases
Kolomičenko, Vojtěch ; Holubová, Irena (advisor) ; Pokorný, Jaroslav (referee)
In the recent years a new type of NoSQL databases, called Graph databases (GDBs), has gained significant popularity due to the increasing need of processing and storing data in the form of a graph. The objective of this thesis is a research on possibilities and limitations of GDBs and conducting an experimental comparison of selected GDB implementations. For this purpose the requirements of a universal GDB benchmark have been formulated and an extensible benchmarking tool, named BlueBench, has been developed.
|
|
|
Introduction and use of graph databases
Hřivna, Jan ; Palovská, Helena (advisor) ; Tomášková, Barbora (referee)
The aim of this Bachelor thesis is to introduce the conception and uses of graph databases. The thesis is split into a theoretical and a practical part. The theoretical part describes main principles of graph databases with focus on providing exact and detailed explanations. The practical part presents practical operations and particular solutions for the queries run in the Neo4j graph database system by Cypher query lanugage. Information was collected from reliable and published primary and secondary sources. Furthermore in the practical part, the actual Neo4j database was installed on local server. This database can be accesed and commands can be executed through graphic user interface.
|
|
|
The proposal of application development process for Linked Open Data
Budka, Michal ; Chlapek, Dušan (advisor) ; Bruckner, Tomáš (referee)
This thesis deals with the issue of Linked Open Data. The goal of this thesis is to introduce the reader to this issue as a whole and to the possibility of using Linked Open Data for developing useful applications by proposing a new development process focusing on such applications. The theoretical part offers an insight into the issue of Open Data, Linked Open Data and the NoSQL database systems and their usability in this field. It focuses mainly on graph database systems and compares them with relational database systems using predefined criteria. Additionally, the goal of this thesis is to develop an application using the proposed development process, which provides a tool for data presentation and statistical visualisation for open data sets published by the Supreme Audit Office and the Czech Trade Inspection. The application is mainly developed for the purpose of verifying the proposed development process and to demonstrate the connectivity of open data published by two different organizations.The thesis includes the process of selecting a development methodology, which is then used for optimising work on the implementation of the resulting application and the process of selecting a graph database system, that is used to store and modify open data for the purposes of the application.
|
guest ::
