LiU Electronic Press
Download:
File size:
1253 kb
Format:
application/pdf
Author:
Larsson, Patrik (Linköping University, Department of Computer and Information Science)
Title:
Analyzing and adapting graph algorithms for large persistent graphs
Department:
Linköping University, Department of Computer and Information Science
Publication type:
Student thesis
Language:
English
Level:
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE credits
Undergraduate subject:
Computer science (20-credit final thesis, D level)
Uppsok:
Technology
Pages:
70
Year of publ.:
2008
URI:
urn:nbn:se:liu:diva-15422
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-15422
ISRN:
LIU-IDA/LITH-EX-A--08/048--SE
Subject category:
Computer Science
SVEP category:
Computer science
Keywords(en) :
graph, database, algorithm
Abstract(en) :

In this work, the graph database Neo4j developed by Neo Technology is presented together with some of it's functionality when it comes to accessing data as a graph. This type of data access brings the possibility to implement common graph algorithms on top of Neo4j. Examples of such algorithms are presented together with their theoretical backgrounds. These are mainly algorithms for finding shortest paths and algorithms for different graph measures such as centrality measures. The implementations that have been made are presented, as well as complexity analysis and the performance measures performed on them. The conclusions include that Neo4j is well suited for these types of implementations.

Presentation:
2008-10-30, Alan Turing, IDA, 13:15 (Swedish)
Examiner:
Jonsson, Peter, Professor (Linköping University, Department of Computer and Information Science)
Available from:
2008-11-07
Created:
2008-11-06
Last updated:
2012-04-24
Statistics:
0 hits
FILE INFORMATION
File size:
1253 kb
Mimetype:
application/pdf
Type:
fulltext
Statistics:
0 hits