Alternatives and similar repositories for ByteSlice

Users that are interested in ByteSlice are comparing it to the libraries listed below

• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆91Updated 2 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆58Updated 8 years ago
• tuhhosg / exmap
  ☆48Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆28Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆92Updated 4 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆48Updated 9 years ago
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆31Updated 12 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆16Updated 5 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆20Updated 8 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• flode / ARTSynchronized
  ☆121Updated 3 years ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 8 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆175Updated 9 years ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆156Updated 6 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆123Updated 5 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 3 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆15Updated 5 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆38Updated 4 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 5 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago