fredrikwidlund / hash-function-benchmarkLinks
Benchmark of common hash functions
☆36Updated 5 years ago
Alternatives and similar repositories for hash-function-benchmark
Users that are interested in hash-function-benchmark are comparing it to the libraries listed below
Sorting:
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Quickstep project☆42Updated 6 months ago
- LSM-trie☆114Updated 4 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- ☆119Updated 3 years ago
- The Cicada engine☆57Updated 7 years ago
- ☆144Updated 2 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- ☆43Updated 3 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 6 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆46Updated 3 years ago
- ☆28Updated 2 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Benchmarking tools for pmemkv☆23Updated 2 years ago
- Persistent Memory Storage Engine☆24Updated 6 months ago
- ☆25Updated 8 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 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
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 7 months ago
- pmwcas☆138Updated 2 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆214Updated 2 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆159Updated 3 years ago