Graf Veritabanları Nedir?

Friend suggestions, fraud detection, recommendations — they all lean on graph databases. Let's see what makes them so good at connected data.

Relational databases store data in tables, so connecting it means JOINs. As relationships deepen, those JOINs get slow and awkward to model.

A graph is just two things: nodes (your entities) and relationships (how they connect). Think cities as nodes, roads as relationships.

A node is an entity — like a flexible table row. It carries labels to categorize it (:Person, :Product) and properties to describe it.

Relationships are the glue. Each one has a type and a direction (Alice FRIENDS_WITH Bob), and can carry properties of its own.

Properties are key-value details on nodes and relationships — name and age on a Person, quantity and price on a purchase. They make your graph expressive.

The key difference: relational connections need JOINs that cost more as they pile up. Graphs store relationships directly, so traversal stays fast — that's index-free adjacency.

Why pick a graph database? Blazing queries on connected data, a flexible model, intuitive domain mapping, and easy discovery of hidden patterns.

Graphs shine wherever relationships are the point: social networks, recommendations, fraud detection, and IT dependency mapping.

You've got the basics! Graphs use nodes and relationships, both carry properties, and they outshine relational DBs on connected data. Next up: Neo4j.