lemire / FastDifferentialCoding
Fast differential coding functions (using SIMD instructions)
☆52Updated 7 years ago
Alternatives and similar repositories for FastDifferentialCoding:
Users that are interested in FastDifferentialCoding are comparing it to the libraries listed below
- A fast implementation for varbyte 32bit/64bit integer compression☆117Updated 8 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Fast decoder for VByte-compressed integers☆122Updated 11 months ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆53Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆88Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- qp tries and crit-bit tries☆119Updated 2 years ago
- For details, see the blog post:☆32Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆26Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- fixed-length integer trim☆34Updated 2 years ago
- ☆66Updated 4 years ago
- Algorithms to compress sorted arrays of integers☆18Updated 11 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago