SAP HANA Graph Algorithms (Neighbors, Shortest Path)
Tutorials that teach this
- TutorialHelp Thomas Get Started with SAP HANA Cloud
- TutorialPattern Matching Using OpenCypher in SQL
- TutorialCalculate Isochrones and Closeness Centrality
- TutorialAnalyze Graph Workspace in SAP HANA Cloud, SAP HANA Database
- TutorialUse a Cost Function to Calculate Shortest Path
- TutorialConnect SAP HANA Database in SAP HANA Cloud to Python
- TutorialComplex Algorithms Using GraphScript
- TutorialCalculate Shortest Path Using a GRAPH Procedure
- TutorialConnect Nodes, Centroids and Voronoi Cells to POI
- TutorialIdentify Relevant Networks in Spatial Data
- TutorialTry Out Multi-Model Functionality with the SAP HANA Database Explorer and Database Objects App
Prerequisites
- ConceptSAP HANA Cloud with HDI Containers
- ConceptSAP HANA In-Memory Relational Database
- ConceptSAP HANA Spatial Column Types (ST_GEOMETRY, ST_POINT)
- ConceptSAP HANA Voronoi Cells (ST_VoronoiCell)
- ConceptSAP HANA Graph Workspace Usage
- ConceptSAP HANA SQL API Usage
- ConceptSAP HANA Cloud Spatial Engine
- ConceptJupyter Notebook ML Workflows
- ConceptQuerying Points of Interest with SAP HANA Spatial
- ConceptPython Machine Learning Client for SAP HANA (hana-ml)
- ConceptSQL DDL and DML Statements (CREATE, INSERT, DROP)
- ConceptSAP HANA Spatial Predicates and Geometry Methods
- ConceptSAP HANA Stored Procedure Creation and Execution