SAP HANA Database as a Graph Store - Uncovering the network using Graph Algorithms

This Document is part of the series on HANA Database as a Graph Store in SAP HANA SPS 12 : SAP HANA Database as a Graph Store - Introduction

Let us figure out the other possibilities to uncover fraud rings in Insurance-Fraud scenario discussed in the previous documents using Graph Algorithms in SAP HANA.

Shortest Path Algorithm:

This action provides the information for the shortest path from the starting vertex to all reachable vertices.

SAP HANA Database as a Graph Store - Introduction

SAP HANA database is continuously evolving with best fit functionalities to suffice varied needs of end user. HANA as a database supports more than primitive data types along with the defined set of operations on them. In the world of connected data, defining relationship among the available data set is one of the important aspects. RDBMSs are one such choice for storage of information's like financial records, manufacturing and logistical information, personnel data, and other applications.SAP HANA is at its core a columnar store optimized for relational records, which suffices the above mentioned needs and  it is not just that. Now it is also possible to identify relationships between the records in a deployment as a graph store without having to use an external store for same purpose.

From SPS12 version, HANA can be used as  a Graph Database. What do we mean by 'Graph Database' here? let us have a quick glimpse of what it is and proceed ahead with the computational capabilities in HANA to achieve the same.