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:
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆138Updated last month
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆251Updated 4 years ago
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- A transactional main-memory database system on multicores☆106Updated 7 years ago
- Library for lock-free locks☆84Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆122Updated 10 months ago
- ☆39Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- ☆30Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Updated 8 years ago
- pmwcas☆139Updated 2 years ago
- Benchmark of common hash functions☆38Updated 6 years ago
- HOT - Height Optimized Trie☆158Updated 7 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- ☆57Updated last year
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆84Updated 3 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Quickstep project☆44Updated last year
- An open-source BzTree implementation☆92Updated 4 years ago