sfu-dis / corobase

Related projects ⓘ

Alternatives and complementary repositories for corobase

• flode / ARTSynchronized
  ☆115Updated 2 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆150Updated 8 months ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆172Updated 8 years ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆140Updated 6 years ago
• Cavalia / Cavalia
  A transactional main-memory database system on multicores
  ☆102Updated 6 years ago
• efficient / HOPE
  Order-preserving key encoder
  ☆122Updated 4 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆98Updated 8 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆196Updated last month
• readablesystems / sto
  Software Transactional Objects
  ☆55Updated 7 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆263Updated 10 months ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• sfu-dis / ermia
  ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)
  ☆87Updated last year
• microsoft / pmwcas
  pmwcas
  ☆135Updated last year
• 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
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆112Updated last year
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated last month
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆149Updated 3 years ago
• TimoKersten / db-engine-paradigms
  Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…
  ☆253Updated 6 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆42Updated 6 months ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆111Updated 2 weeks ago
• abhisharma7 / WiscKey
  Key Value Store based on LevelDB
  ☆110Updated 3 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆87Updated last year
• pmem / libpmemobj-cpp
  C++ bindings & containers for libpmemobj
  ☆108Updated last year
• efficient / cicada-engine
  The Cicada engine
  ☆56Updated 7 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆225Updated 2 weeks ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆214Updated last year
• DataManagementLab / ScaleStore
  This is the source code for our (Tobias Ziegler, Carsten Binnig and Viktor Leis) published paper at SIGMOD’22: ScaleStore: A Fast and Cos…
  ☆119Updated last month
• pramalhe / OneFile
  The world's first wait-free Software Transactional Memory
  ☆169Updated 4 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 2 years ago