This article discusses a new optimization in ClickHouse 25.11 that enhances the performance of aggregations with small GROUP BY keys by parallelizing the merge phase. The author shares insights from the implementation process, including challenges faced and lessons learned about memory management and concurrency.

The article explores the performance differences between accessing array elements in sequential versus random order, particularly in relation to cache efficiency and memory usage. It discusses various experiments conducted to measure the impact of access patterns on computation time for floating-point numbers, including setups for both in-RAM and memory-mapped scenarios. The findings provide insights into optimizing program performance by leveraging data locality.

PostgreSQL's performance can significantly benefit from having an adequate amount of RAM, particularly through the management of its shared buffers. Understanding the clock sweep algorithm and how buffer eviction works is crucial for optimizing memory settings, especially in systems with large RAM capacities. Proper sizing of the shared buffer, typically recommended at 25% of total RAM, is essential for achieving optimal database performance.

The article provides an in-depth exploration of Java's garbage collection (GC) mechanisms, detailing how they manage memory in Java applications. It covers various GC algorithms, their characteristics, and how developers can optimize performance while minimizing memory leaks and inefficiencies. Understanding these concepts helps developers make informed decisions about memory management in their Java applications.