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:
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- C++ bindings & containers for libpmemobj☆110Updated 2 years ago
- The Cicada engine☆58Updated 8 years ago
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- Quickstep project☆42Updated 9 months ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆249Updated 3 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- pmwcas☆139Updated 2 years ago
- A in-memory storage manager, that can do versioning and fast scans☆50Updated 9 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- MapReduce for multi-core☆49Updated 11 years ago
- Persistent Memory Storage Engine☆24Updated 9 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 3 years ago
- A working project for High-concurrency B-tree source code in C☆251Updated 4 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆197Updated 10 months ago
- A simple, reference implementation of a B^e-tree☆156Updated 6 years ago
- Key/Value Datastore for Persistent Memory☆403Updated 2 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
- ☆149Updated 2 years ago
- ☆30Updated 6 years ago