|
|
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.
|
|
|
Comparison of Approaches for Querying of Chemical Compounds
Šípek, Vojtěch ; Holubová, Irena (advisor) ; Pokorný, Jaroslav (referee)
The purpose of this thesis is to perform an analysis of approaches to querying chemical databases and to validate or invalidate its results. Currently, there exists no work which would compare the performance and memory usage of the best performing approaches on the same data set. In this thesis, we address this lack of information and we create an un-biased benchmark of the most popular index building methods for subgraph querying of chemical databases. Also, we compare the results of such benchmark with the performance results of an SQL and a graph database. 1
|
|
|
Application of data mining methods in a graph database
FEKETE, Alexandra
This bachelor thesis deals with the area of NoSQL databases with a focus on graph databases and the application of data mining methods. The main aim is to install a specific NoSQL graph database Neo4j together with the characterization of its key features and activities and to use data mining methods above the graph database. Methods of data mining are performed and analyzed the most typical examples of data obtained from the Internet. The used query language is Cypher. The last part of this thesis is an analysis of selected data from Neo4j Sandbox with a focus on the Panama Papers in the Neo4j database. To present this example, tools as Neo4j Community Server and Cypher language are used. The results of this analysis are then evaluated for their possible further use.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
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.
|
|
|
Possibilities of using database Neo4j
Konoshenko, Evgeny ; Palovská, Helena (advisor) ; Tomášková, Barbora (referee)
The theme of bachelor work is NoSQL graph database Neo4J. The main objective of this work is to describe the key features Neo4J and show a practical example of how to work with this system. To achieve this objective were studied books, internet resources which relate to this topic and official documentation for the database system. The contribution of this work consists in dismantling work with Neo4J through different tools and defining use cases that database. After reading the practical part of the work reader would be able to understand the basics of working with database system Neo4J. The theoretical part focuses on the detailed analysis of the database system Neo4J, specifies terms NoSQL and graph database, defines the place of Neo4J in NoSQL databases, provides the possibility of using Neo4J in practice. In the practical part are presented examples of work with the system Neo4J, is shown the usage of query language Cypher, REST API and web interface Webadmin.
|
|
|
Advantages and disadvantages of relational and non-relational (NoSQL) databases for analytical tasks
Klapač, Milan ; Slánský, David (advisor) ; Pour, Jan (referee)
This work focuses on NoSQL databases, their use for analytical tasks and on comparison of NoSQL databases with relational and OLAP databases. The aim is to analyse the benefits of NoSQL databases and their use for analytical purposes. The first part presents the basic principles of Business Intelligence, Data Warehousing, and Big Data. The second part deals with the key features of relational and NoSQL databases. The last part of the thesis describes the properties of four basic types of NoSQL databases, analyses their advantages, disadvantages and areas of application. The end of this part in-cludes specific examples of the use of NoSQL databases, together with the reasons for the selection of those solutions.
|
|
|
Application of graph database for analytical tasks
Günzl, Richard ; Novotný, Ota (advisor) ; Daněk, Lukáš (referee)
This diploma thesis is about graph databases, which belong to the category of database systems known as NoSQL databases, but graph databases are beyond NoSQL databases. Graph databases are useful in many cases thanks to native storing of interconnections between data, which brings advantageous properties in comparison with traditional relational database system, especially in querying. The main goal of the thesis is: to describe principles, properties and advantages of graph database; to design own convenient graph database use case and to realize the template verifying designed use case. The theoretical part focuses on the description of properties and principles of the graph database which are then compared with relational database approach. Next part dedicates analysis and explanation of the most typical use cases of the graph database including the unsuitable use cases. The last part of thesis contains analysis of own graph database use case in which several principles are defined. The principles can be applied separately. There are crucial analytical operations in the use case. The analytical operations search the causes with their rate of influence on amount or change in the value of the indicator. This part also includes the realization of the template verifying the use case in the graph database. The template consists of the database structure design, the concrete database data and analytical operations. In the end the returned results from graph database are verified by the alternative calculations without using the graph database.
|
guest ::
