Technical Report CSI-0014

Dominating Set Algorithm Implementation in Graph Databases

Phininder Balaghan and Ken A. Hawick and David Chalupa and Craig Maddra

Archived: 2017

Abstract

Graph databases have recently become feasible and useful alternatives to traditional SQL relational databases. As the name suggests, graph databases use graph-based data structures to hold their data instead of the table based approach of relational databases. Graph databases have the potential to support a range of graph and network oriented algorithms that are not easily implemented using a table based approach. We analyse the particular case of dominating set algorithms and measure the ease of expression and performance implications for implementing dominating set calculations in graph databases. We discuss comparisons between various approaches and the limitations of present graph databases and their interfaces for state-full algorithms.

Keywords: graph database, dominating set, graph algorithms, neo4j, sparsity

Full Document Text: Not yet available.

Citation Information: BiBTeX database for CSI Notes.

BiBTeX reference:

@TechReport{CSI-0014,
        Title = {Dominating Set Algorithm Implementation in Graph Databases},
        Author = {Phininder Balaghan and Ken A. Hawick and David Chalupa and Craig Maddra},
        Institution = {Computer Science, University of Hull},
        Year = {2017},
        Address = {Cottingham Road, Hull, HU6 7RX},
        Month = {August},
        Number = {CSI-0014},
        Keywords = {graph database, dominating set, graph algorithms, neo4j, sparsity},
        Owner = {kahawick},
        Timestamp = {2017.07.16}
}