Explore >> Select a destination
|
You are here 
|
nakabonne.dev | ||
| | | | |
www.bazhenov.me
|
|
| | | | | Introduction Link to heading Varint is a widely recognized technique used for compressing integer streams. Essentially, it suggests that it can be more efficient to encode a number using a variable-length representation instead of a fixed-size binary representation. By removing leading zeros from the binary number, the overall representation size can be reduced. This technique works particularly well for encoding smaller numbers. In this article, I provide a brief introduction and rationale for varint encoding. Additionally, I describe the Stream VByte format, which enables fully vectorized decoding through SSSE3 instructions. I also share my findings from implementing this algorithm in Rust, which includes both encoding and decoding primitives and the abili... | |
| | | | |
richardstartin.github.io
|
|
| | | | | Suppose you have an unsorted array of numeric values and need to find the set of indexes of all the values which are within a range. The range predicate will be evaluated many times, so any time spent preprocessing will be amortised, and non-zero spatial overhead is expected. If the data were sorted, this would be very easy, but the indexes of the values have meaning so the data cannot be sorted. To complicate the problem slightly, the set of indexes must be produced in sorted order. | |
| | | | |
questdb.io
|
|
| | | | | Benchmarks and an overview of InfluxDB versus QuestDB to compare features, functionality, performance, and ease of use. | |
| | | | |
www.debugbear.com
|
|
| | | Learn how to use the Chrome DevTools Performance tab to measure and improve the speed of your website. | ||
