Graph Basics Lesson 3: Path & K-Hop Queries

After watching this 10-min animated video, you will be able to grasp the gist of any form of pathfinding or k-hop queries. This is the 3rd training video of the Graph Basics series.

Why you should care about path or hop queries? Because that's how we, human beings, naturally think and calculate things, step by step, hop-by-hop, and eventually reaching our conclusions (brilliant or not) via a network of entities and relationships into paths with nodes and edges.

Graph database is designed to empower connected data analysis, it has 3 unprecedented benefits:
1. Flexible & Natural Data Modeling: High-dimensional data modeling, with or without schema.
2. Extremely Fast & Superior Computing Power: Graph DBMS goes faster and deeper, exponentially faster than relational data.
3. White-box & Explainability: when you are decision making, you DON'T want to rely on a black-box AI system.

Still wondering what to do next? Review the 1st and 2nd videos, and looking forward to our next training video (on graph algorithms).

May the best graph be with you, from Ultipa.

Chapters:
0:00 Intro
0:14 Hop
1:42 Path
3:35 How to describe a path
5:53 Shortest path
7:14 K-Hop (BFS)
9:45 Summary