flippingbits / cssl

Related projects: ⓘ

• harald-lang / tree-encoded-bitmaps
  ☆36Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆26Updated 4 years ago
• L-v-M / async
  ☆20Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆138Updated 6 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• flode / ARTSynchronized
  ☆114Updated 2 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆50Updated 4 months ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• 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
• tuhhosg / exmap
  ☆36Updated 5 months ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆76Updated 2 years ago
• IBM / uDepot
  Key-Value Store for Non-Volatile Memories uDepot
  ☆44Updated 2 years ago
• lemire / dictionary
  High-performance dictionary coding
  ☆102Updated 7 years ago
• spcl / vldb19-distributed-locking
  This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…
  ☆10Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆97Updated 8 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆41Updated 4 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆38Updated 4 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 8 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆17Updated 5 years ago
• mit-carbon / Flat-Combining
  Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …
  ☆30Updated 13 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆37Updated 2 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated 7 months ago
• UWQuickstep / quickstep
  Quickstep project
  ☆39Updated 11 months ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆115Updated 3 years ago
• belliottsmith / accord
  ☆26Updated 2 years ago
• tum-db / cachecoherence
  ☆10Updated 3 years ago