Alternatives and similar repositories for ByteSlice:

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

• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• urcs-sync / Interval-Based-Reclamation
  Artifact for PPoPP'18
  ☆18Updated 2 years ago
• tuhhosg / exmap
  ☆40Updated 10 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆91Updated 3 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆88Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆52Updated 4 months ago
• LPD-EPFL / flodb
  A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.
  ☆26Updated 7 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 9 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆41Updated 3 months ago
• caetanosauer / fineline-zero
  ☆12Updated 6 years ago
• TU-Berlin-DIMA / Hawk-VLDBJ
  ☆14Updated 5 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆100Updated 8 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 4 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)
  ☆74Updated 2 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆142Updated 6 years ago
• GTkernel / nibble-lsm
  Concurrent Log-Structured Memory for Many-Core Key-Value Stores
  ☆35Updated 4 years ago
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 4 years ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆45Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• TU-Berlin-DIMA / grizzly-prototype
  Grizzly: Efficient Stream Processing Through Adaptive Query Compilation
  ☆15Updated 4 years ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 3 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆43Updated 9 months ago
• flode / ARTSynchronized
  ☆116Updated 2 years ago
• efficient / cicada
  Dependably fast multi-core in-memory transactions
  ☆19Updated 7 years ago
• Legacy25 / ValkyrieDB
  A SQL-to-native-code compiler based on LLVM
  ☆46Updated 9 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago