Kuzu V0 120 Better -
You can now run vector search with arbitrary Cypher queries . This means you can combine traditional graph traversals (e.g., "find all neighbors of node X") with vector similarity searches (e.g., "within a specific type and that have an embedding similar to query Y") directly in the same query.
Running entirely inside your application’s memory space means query execution happens directly where your data code lives. Data transfers execute in microseconds rather than passing through local network ports. Zero-Copy Data Ecosystem
: Kuzu v0.120 boasts substantial performance improvements over its predecessors, thanks to optimizations in data ingestion, query execution, and data storage. This results in faster data loading, querying, and overall system responsiveness. kuzu v0 120 better
But what makes kuzu v0.12.0 better? The latest iteration brings significant performance improvements to recursive queries, enhanced JSON scanning, and improved storage management, making it an even stronger alternative to traditional, server-based graph databases like Neo4j.
Traditional binary joins combine two tables or relations at a time, which is highly inefficient for cyclic graph queries (such as finding triangles or cliques in a network). Kùzu incorporates advanced , evaluating multi-way joins globally across multiple relations simultaneously. This prevents the generation of massive, unneeded intermediate result sets and guarantees predictable performance even on highly dense graphs. 3. Deep Feature Parity with Modern AI Ecosystems You can now run vector search with arbitrary Cypher queries
It maintains its blazing speed (often ~18x faster than Neo4j in benchmarks) while becoming more operationally efficient for long-running projects. Check out the Kùzu GitHub releases for the full changelog. High Performance And Low Overhead Graphs With KuzuDB
Kùzu v0.12.0 made major strides in its "Zero-Dependency" philosophy: Data transfers execute in microseconds rather than passing
Graph analytics lives and dies by multi-hop performance (traversing relationships across multiple connections). Thanks to its advanced CSR index layouts , Kùzu v0.12.0 achieves massively faster path-finding execution compared to traditional graph engines. It computes joins as compressed matrix calculations rather than traditional record lookups. The Perfect Fit for Graph RAG and GenAI
