Bookmarks with tag "performance", page 1 of 4
Making GROUP BY faster by doing more (CPU!) work
"Distroless" images contain only your application and its runtime dependencies. They do not contain package managers, shells or any other programs you would expect to find in a standard Linux distribution.
YJIT
A Bloom filter is a space-efficient data structure that is used to test whether an element is a member of a set. In the case of an index access method, it allows fast exclusion of non-matching tuples via signatures whose size is determined at index creation
an easy-to-use self-hosted monitoring tool
RFC 8949 Concise Binary Object Representation
KSUID is for K-Sortable Unique IDentifier. It is a kind of globally unique identifier similar to a RFC 4122 UUID, built from the ground-up to be "naturally" sorted by generation timestamp without any special type-aware logic.
In short, running a set of KSUIDs through the UNIX sort command will result in a list ordered by generation time.Headless UI for Virtualizing Large Element Lists
A cache stampede is a type of cascading failure that can occur when massively parallel computing systems with caching mechanisms come under a very high load.
Scan for React performance issues and eliminate slow renders in your app
Sometimes, a seemingly simple and obvious solution can lead to a series of problems later on. This is especially true when adding retries.
Get JSON values quickly - JSON parser for Go
A ✨ blazingly ✨ fast JSON serializing & deserializing library, accelerated by JIT (just-in-time compiling) and SIMD (single-instruction-multiple-data).