jsnell / parallel-xxhashLinks
Compute xxHash hash codes for 8 keys in parallel
☆46Updated 6 years ago
Alternatives and similar repositories for parallel-xxhash
Users that are interested in parallel-xxhash are comparing it to the libraries listed below
Sorting:
- C library to compute the Hamming weight of arrays☆46Updated 6 years ago
- Fast decoder for VByte-compressed integers☆123Updated last year
- High-performance dictionary coding☆104Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- Feed-forward Bloom filters☆52Updated 14 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
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 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 fast implementation for varbyte 32bit/64bit integer compression☆118Updated 8 years ago
- bit & sketches data structures☆60Updated 6 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
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated last year
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago