fast-pack / MaskedVByteLinks
Fast decoder for VByte-compressed integers
☆125Updated last year
Alternatives and similar repositories for MaskedVByte
Users that are interested in MaskedVByte are comparing it to the libraries listed below
Sorting:
- High-performance dictionary coding☆108Updated 8 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Compute xxHash hash codes for 8 keys in parallel☆46Updated 6 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- A simple C library for compressing lists of integers using binary packing☆508Updated 2 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☆55Updated last year
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- Fast integer compression in C using the StreamVByte codec☆408Updated 8 months ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆138Updated 8 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- A C++ library to compress and intersect sorted lists of integers using SIMD instructions☆438Updated 3 months ago
- An efficient trie implementation.☆255Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Rolling Hash C++ Library☆188Updated last year
- bit & sketches data structures☆60Updated 6 years ago
- A collection of succinct data structures☆210Updated last year
- Feed-forward Bloom filters☆53Updated 14 years ago
- Iterator library.☆79Updated 5 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
- qp tries and crit-bit tries☆122Updated 3 years ago
- Fastest Histogram Construction☆72Updated 3 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆62Updated 5 years ago
- TurboRLE-Fastest Run Length Encoding☆288Updated 2 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago