liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Analyzing and adapting graph algorithms for large persistent graphs
Linköping University, Department of Computer and Information Science.
2008 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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.

Place, publisher, year, edition, pages
2008. , 70 p.
Keyword [en]
graph, database, algorithm
National Category
Computer Science
URN: urn:nbn:se:liu:diva-15422ISRN: LIU-IDA/LITH-EX-A--08/048--SEOAI: diva2:114159
Subject / course
Computer science (20-credit final thesis, D level)
2008-10-30, Alan Turing, IDA, 13:15 (Swedish)
Available from: 2008-11-07 Created: 2008-11-06 Last updated: 2012-04-24Bibliographically approved

Open Access in DiVA

fulltext(1253 kB)1361 downloads
File information
File name FULLTEXT01.pdfFile size 1253 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Larsson, Patrik
By organisation
Department of Computer and Information Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1361 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 4161 hits
ReferencesLink to record
Permanent link

Direct link