fast-pack / MaskedVByte
Fast decoder for VByte-compressed integers
☆122Updated 11 months ago
Alternatives and similar repositories for MaskedVByte:
Users that are interested in MaskedVByte are comparing it to the libraries listed below
- C library to pack and unpack short arrays of integers as fast as possible☆88Updated 2 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆117Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 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
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 5 years ago
- A simple C library for compressing lists of integers using binary packing☆498Updated last year
- A compact implementation of Dr. Askitis HatTrie☆80Updated 10 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- C++ implementations of indexing mechanisms, including a Hilbert-curve geohash based spatial index and a linear hashing table, for disk or…☆76Updated 4 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- qp tries and crit-bit tries☆119Updated 2 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆61Updated 5 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast integer compression in C using the StreamVByte codec☆397Updated 2 months ago
- Fastest Histogram Construction☆70Updated 3 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- C library implementing the ridiculously fast CLHash hashing function☆277Updated last year
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆434Updated last year
- A very fast scalar implementation for Frame Of Reference integer compression.☆108Updated 9 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 11 months ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 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
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 3 months ago