Kùzu v0.12.0 just dropped — better space management & faster recursion
The team at Kuzu is relentlessly focused on performance. Each release brings meaningful improvements that, when combined, make the latest version a significantly better choice.
Performance for recursive queries has been significantly improved, making multi-hop traversals even faster than before. kuzu v0 120 better
Kuzu’s ability to scan external data sources (CSV, Parquet, JSON) without ingesting them first is one of its unique strengths. In v0.12.0, we have polished the LOAD FROM syntax to be more robust and flexible.
results = conn.execute("MATCH (n) RETURN n.id, n.name") for row in results: print(row) Kùzu v0
For those who may be new to Kuzu, it's an open-source graph database library designed to make it easy to build scalable and performant graph-based applications. Kuzu allows developers to store, query, and manipulate large amounts of graph data with ease, making it a popular choice for applications in areas such as social networks, recommendation systems, and knowledge graphs.
The heart of the speed boost is a that processes 64‑bit chunks of data in parallel, much like modern column‑store databases. Kuzu’s ability to scan external data sources (CSV,
Adjacency lists are stored using a highly compressed, Columnar Sparse Row (CSR) matrix design. This structure allows Kuzu v0.12.0 to perform extremely fast index-free adjacency lookups. Traversing an edge requires zero traditional B-tree index lookups—it simply computes an array offset in memory, resulting in multi-fold performance gains for dense networks. 3. Native Vector and Full-Text Search Indices