Working with graphs in relational and non-relational databases

Blaž Malej (2016) Working with graphs in relational and non-relational databases. EngD thesis.

Preview

Abstract

The thema of this diploma thesis are graph databases and the comparison between graph databases and relational databases. Graph databases are used to store and process all kinds of graph data. Graphs, as a data structure in computer science, are a set of vertices which are connected with things called edges. Using this principle, we can effectively model various real life examples, e.g. social network of Facebook, for which we could store in graph entities of friends as nodes, and friendships as edges.\\ We decided to compare two currently most popular open source databases, Neo4j - representing graph databases and relational database named MySQL. We compared the execution time of typical query where one would want to get all the friends of a friend in arbitrary social network (also called friend of a friend problem). In our research we another graph database named OrientDB, which is often used in various comparisons together with Neo4j.

Item Type:

Thesis (EngD thesis)

Keywords:

Graph database, Neo4j, MySQL, OrientDB

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
izr. prof. dr. Matjaž Kukar	267	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536909763 )

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3296

Date Deposited:

22 Mar 2016 11:32

Last Modified:

10 May 2016 10:05

URI:

http://eprints.fri.uni-lj.si/id/eprint/3296

Actions (login required)

View Item