This article explains the Join Reorder optimization algorithm used by DuckDB.
This article explains how DuckDB’s LocalStorage efficiently handles INSERT operations within transactions using a shadow-table design and optimistic merging for bulk data.
This article focuses on the start, commit, and rollback of a transaction from the perspective of its lifecycle.
This article will focus on explaining the purpose of all optimization rules implemented in DuckDB.
This article introduce the main concepts involved in each module of the execution layer, giving readers a general understanding of what each module does.
