Appears on
Articles2
Optimizing B+Tree Performance with Contiguous Memory Layouts
This technical article discusses optimizing B+Tree performance in database systems by using contiguous memory blocks for nodes instead of std::vector in C++. The approach improves CPU cache locality but increases implementation complexity. The article explores the trade-offs between performance gains and code maintainability when building high-performance da
Insight
jacobsherin.com7mo ago
Embedding User-Defined Indexes in Apache Parquet Files Explained
Apache Parquet files can embed user-defined index structures without changing the file format, utilizing footer metadata and offset-based addressing.
Insight
datafusion.apache.org10mo ago