fast-pack / MaskedVByteLinks
Fast decoder for VByte-compressed integers
☆124Updated last year
Alternatives and similar repositories for MaskedVByte
Users that are interested in MaskedVByte are comparing it to the libraries listed below
Sorting:
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Compute xxHash hash codes for 8 keys in parallel☆45Updated 6 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 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
- TurboRLE-Fastest Run Length Encoding☆287Updated 2 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast integer compression in C using the StreamVByte codec☆407Updated 6 months ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 6 months ago
- Lock-free multithreaded memory allocation☆107Updated 8 years ago
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- bit & sketches data structures☆60Updated 6 years ago
- Iterator library.☆79Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- A simple C library for compressing lists of integers using binary packing☆505Updated 2 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Rolling Hash C++ Library☆187Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- a quotient filter written in C☆86Updated 7 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- C Minimal Perfect Hashing Library☆86Updated 8 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆77Updated 4 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago