RyanMarcus / HortonHashingLinks
An implementation of Horton hash tables
☆10Updated 9 years ago
Alternatives and similar repositories for HortonHashing
Users that are interested in HortonHashing are comparing it to the libraries listed below
Sorting:
- Implementation of the BwTree as specified by Microsoft Research☆101Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 3 years ago
- A fast in-memory key-value store☆52Updated 8 years ago
- Persistent Memory Storage Engine☆24Updated last year
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆24Updated 2 years ago
- The Cicada engine☆59Updated 8 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆39Updated 5 years ago
- NVM Evaluation Testbed☆29Updated 7 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- An adaptive radix tree for efficient indexing in main memory.☆170Updated 2 months ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆100Updated 7 years ago
- Source code for our OSDI 2016 paper☆110Updated 7 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- ☆150Updated 2 years ago
- Quickstep project☆44Updated last year
- pmwcas☆139Updated 2 years ago
- ☆30Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆195Updated last year
- A transactional main-memory database system on multicores☆106Updated 7 years ago
- ☆125Updated 3 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Read- and latency-optimized log structured merge tree☆175Updated 13 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 4 years ago
- Sundial: A distributed OLTP database testbed.☆39Updated 5 years ago
- Distributed Shared Persistent Memory. SoCC 2017☆69Updated 5 years ago
- ☆20Updated 3 years ago