MorphStore / TVLLibLinks
Template Vector Library
☆18Updated 4 years ago
Alternatives and similar repositories for TVLLib
Users that are interested in TVLLib are comparing it to the libraries listed below
Sorting:
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Quickstep project☆42Updated 7 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 5 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- ☆14Updated last year
- EDSL for C++ to make just-in-time code generation easier☆86Updated 2 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- ☆20Updated 2 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- ☆38Updated 5 years ago
- ☆54Updated last year
- Benchmark of common hash functions☆36Updated 5 years ago
- ☆12Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆25Updated last year
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Persistent memory allocator for data-centric analytics☆54Updated last week
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- std::map/std::set implementation using the adaptive radix tree☆15Updated 3 years ago
- Library for lock-free locks☆82Updated last year