Kuzu V0 136

Recursive graph traversals (e.g., “find all friends within 5 hops”) have historically been expensive. In , the query planner introduces adaptive depth-first search (DFS) swapping . For highly dense graphs, the system now dynamically switches between BFS and DFS strategies at runtime, reducing memory spikes by up to 40% compared to v0.135.

The most dramatic improvement comes when using the new LIST type. Previously, simulating nested data required extracting JSON fields, which incurred heavy CPU costs. Now, the columnar storage scans the LIST directly. kuzu v0 136

The query now completes in under 200ms for graphs with 10 million transactions. Recursive graph traversals (e

From a technical standpoint, Kuzu v0.136 appears to be built using a combination of modern programming languages, including C++, Rust, and Python. The project leverages several open-source libraries and frameworks, such as the Boost C++ Libraries and the pybind11 Python binding generator. The most dramatic improvement comes when using the

The most practical improvement in v0.1.36 is the overhaul of the COPY FROM statement.

: Kùzu supports native vector indices for AI and Graph RAG applications.