Link - Kuzu

Kuzu implements a bounded breadth-first search (BFS) with cost-based pruning. The Kuzu Link query planner estimates the selectivity of each relationship type before deciding whether to traverse from the left node or the right node. For example, if you query MATCH (a:Person)-[:KNOWS]->(b:Person), Kuzu Link will start from whichever side has fewer nodes (e.g., "Person with age > 50" vs. "all Persons").

import kuzu
If you want to learn how to use Kuzu, the official docs are exceptionally well-written and interactive. kuzu link



When populating the graph, users can load node and relationship data directly from these linked sources using standard SQL-like projection. Kuzu implements a bounded breadth-first search (BFS) with
Example Syntax:
LOAD FROM my_external_db.users
RETURN id, name, age;

This allows for "Just-In-Time" graph construction. You do not need to export CSVs from your production SQL database to build your graph; you link the source and define the mapping directly in Cypher. When populating the graph, users can load node
Kuzu Link supports projected adjacency lists—materialized views that store only a subset of relationship properties. For a dashboard that only needs link.count (e.g., number of transactions), create a projected link without the full transaction history. This reduces I/O dramatically.
Place frequently traversed properties on the link itself rather than on the nodes. For example, if you often filter "friendships created after 2023," include that timestamp as a property on the [:KNOWS] relationship. Kuzu Link scans relationship columns sequentially, so selective filters on edges execute faster than post-filtering nodes.