jsnell / parallel-xxhashLinks
Compute xxHash hash codes for 8 keys in parallel
☆45Updated 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:
- Fast decoder for VByte-compressed integers☆124Updated last year
- High-performance dictionary coding☆104Updated 8 years ago
- Lock-free multithreaded memory allocation☆108Updated 8 years ago
- Iterator library.☆79Updated 5 years ago
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 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
- A compact implementation of Dr. Askitis HatTrie☆80Updated 11 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- C library to pack and unpack short arrays of integers as fast as possible☆91Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- C library to compute the Hamming weight of arrays☆48Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 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
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years 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 6 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆87Updated 4 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago
- a quotient filter written in C☆86Updated 7 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year