Alternatives and similar repositories for ByteSlice

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

• efficient / cicada-engine
  The Cicada engine
  ☆59Updated 8 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆92Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆158Updated 7 years ago
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 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)
  ☆83Updated 3 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆21Updated 8 years ago
• tuhhosg / exmap
  ☆49Updated last year
• JLockerman / FuzzyLog
  Experiments in partially ordered SMR.
  ☆48Updated 4 years ago
• UWQuickstep / quickstep
  Quickstep project
  ☆44Updated last year
• flode / ARTSynchronized
  ☆125Updated 3 years ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 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 10 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 9 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆36Updated 5 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆126Updated 5 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• caetanosauer / fineline-zero
  ☆12Updated 7 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆27Updated last year
• stephentu / scalex
  Code snippets for the workshop on concurrent data structure implementation.
  ☆32Updated 12 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆160Updated 6 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 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