tetzank / SIMDSetOperationsLinks
testbed for different SIMD implementations for set intersection and set union
☆41Updated 5 years ago
Alternatives and similar repositories for SIMDSetOperations
Users that are interested in SIMDSetOperations are comparing it to the libraries listed below
Sorting:
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆38Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- High-performance dictionary coding☆108Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Fast decoder for VByte-compressed integers☆125Updated last year
- LSM-trie☆114Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- ☆54Updated last year
- W-TinyLFU cache C++11 header only implementation☆63Updated 6 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- Library for lock-free locks☆83Updated 2 years ago
- ☆53Updated 10 months ago
- Parallel Balanced Binary Tree Structures☆120Updated 7 months ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- C library to compute the Hamming weight of arrays☆49Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- a quotient filter written in C☆86Updated 8 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- Template Vector Library☆18Updated 4 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆113Updated 9 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year