Cloudflare won't re-compress an asset your origin already gzipped, so browsers got 50KB gzip instead of 40KB Brotli. The fix is one line of nginx. Read more ›
ISS Crew Simulations Underway The prime and backup crews for the forthcoming 75th expedition to the International Space Station (ISS) were seen during ‘integrated qualification simulations’ at the Yuri Gagarin Cosmonaut Training Centre in the Moscow region on Friday. The participants practised responses to both normal and emergency situations in space using simulators that recreate […] The post appeared first on . Read more ›
The opening post of a Low-Level Systems Design in Rust series, arguing that the biggest performance win is structural: replace a shared multi-producer cursor that serializes cores through cache-coherence traffic with one private single-writer SPSC ring per producer, converting quadratic writer contention into a cheap O(N) consumer sweep. Read more ›
Data structures sound scary. They are not. Let this simple project show you exactly what they are and why they matter. Read more ›
geeksforgeeks.org Problem Statement Given a row-wise sorted matrix of size N × M, find the median of the matrix. The matrix contains an odd number of elements. Brute Force Intuition In an interview, you can explain it like this: Since every row is sorted, one straightforward approach is to collect all elements into a single array, sort them, and return the middle element. This works but ignores the fact that rows are already sorted. Complexity Time Complexity: O(N × M × log(N × M)) Space Comp... Read more ›
The Altinity Kubernetes Operator for ClickHouse now supports FIPS deployments, has better integration for ClickHouse Keeper, and is in the OpenShift community operators repository. The post appeared first on . Read more ›
A visual and written explanation of Distributed Compaction (RFC-0025 in SlateDb) and discussion of future work Read more ›
We used to have a background job that would take minutes to finish. Not "minutes" as in "go grab a coffee" — minutes as in: the user would kick something off, walk away, and start wondering if it was broken before finally sending a message to engineering. The job processed large sets of data, and the bigger the input got, the longer it took to finish. We cut this job’s runtime by roughly 80% with a change that, in hindsight, was almost embarrassingly small, but would have been hard to find by... Read more ›
ClickHouse was released in open source on Jun 15 2016, ten years ago. Since then, it became the most popular open source analytical database with more than 2000 contributors. There are different levels of open-source. Level 0: The minimum level is making the code open to the public for reading, but ... Read more ›
In this paper we introduce "graph linear notation" -- a complete graph invariant -- which is positioned as an alternative definition for the finite graphs. This invariant is constructed using an algorithm similar to the algorithm of finding canonical forms of graphs. Storing graph linear notation instead of a regular graph allows us to greatly simplify two major problems: the construction of illustrations for graphs with regards to possible gr... Read more ›
A ten-stamp Polish series from 1963 that gathered the spacecraft of the first six years of the space race onto a single sheet — drawn in thin engineering lines. Read more ›
Linear probing is one of the simplest and most space-efficient approaches to hash table design, and is widely used in sequential settings due to its compact memory layout. However, designing a concurrent linear-probing hash table with strong liveness guarantees has proved difficult, and only a handful of such algorithms have been proposed, all of which either restrict concurrency or rely on large per-entry metadata, thereby compromising space ef... Read more ›
A Haskell library for on-disk tables based on LSM-Treeslsm-tree The and are available. The primary authors are Duncan Coutts, Joris Dral, Matthias Heinzel, Wolfgang Jeltsch, Wen Kokke, and Alex Washburn. Contributors Our thanks go to those who have contributed to this project with development, bug reports, feature requests, blog posts, etc., including: Read more ›
With thanks to Nathan Barry's Can gzip be a language model? Read more ›
leetcode.com Problem Statement Given a sorted array where: Every element appears exactly twice. Only one element appears once. Find the single element in O(log N) time and O(1) space. Brute Force Intuition In an interview, you can explain it like this: Since every element appears twice except one, we can iterate through the array and count frequencies. The element with frequency 1 is our answer. This works but doesn't utilize the sorted nature of the array. Complexity Time Complexity: O(N) Sp... Read more ›
The newest open-source project out of Intel is the Intel Performance Skills project that is providing AI agent skills to help with CPU performance analysis and performance optimizations on Linux... Read more ›
A new China rocket mission is generating interest beyond low Earth orbit. Here's why space agencies around the world are closely watching its next moves. Read more ›
ClickHouse has been open source for ten years. At Open House San Francisco, we explored this in greater detail in the day 2 keynote. We've all heard open source described as a cathedral and a bazaar, a big tent, etc. We tried a different analogy: staine Read more ›