alabid / countminsketch

Related projects: ⓘ

• papergitkeeper / heavy-keeper-project
  ☆30Updated 5 years ago
• mortzdk / heavy-hitters
  This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …
  ☆14Updated 8 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆37Updated 3 years ago
• barrust / count-min-sketch
  Count-Min Sketch Implementation in C
  ☆44Updated 7 months ago
• zhouyangpkuer / ColdFilter
  This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).
  ☆28Updated 6 years ago
• carolinux / adaptive_range_filters
  ☆17Updated 8 years ago
• flode / ARTSynchronized
  ☆114Updated 2 years ago
• wangziqi2016 / index-microbench
  ☆142Updated last year
• speedskater / hot
  HOT - Height Optimized Trie
  ☆138Updated 6 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆168Updated 8 years ago
• flode / BwTree
  Implementation of the BwTree as specified by Microsoft Research
  ☆97Updated 8 years ago
• utsaslab / RECIPE
  RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)
  ☆197Updated 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
• efficient / fasst
  Source code for our OSDI 2016 paper
  ☆106Updated 5 years ago
• chenzhangyu / Clevel-Hashing
  Lock-free Concurrent Level Hashing for Persistent Memory (USENIX ATC 2020)
  ☆49Updated 3 years ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 6 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆87Updated last year
• oscarlab / Be-Tree
  A simple, reference implementation of a B^e-tree
  ☆143Updated 5 years ago
• sfu-dis / bztree
  An open-source BzTree implementation
  ☆90Updated 3 years ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆110Updated last year
• futurewei-cloud / chogori-platform
  ☆46Updated last year
• UWSysLab / NOPaxos
  NOPaxos consensus protocol
  ☆133Updated 3 years ago
• huanchenz / index-microbench
  ☆14Updated 7 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆28Updated 6 years ago
• sfu-dis / mosaicdb
  The Art of Latency Hiding in Modern Database Engines (VLDB 2024)
  ☆47Updated 7 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• yxymit / Sundial
  Sundial: A distributed OLTP database testbed.
  ☆37Updated 3 years ago
• LPD-EPFL / CLHT
  CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.
  ☆146Updated 2 years ago
• bcaine / learned_indices
  A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"
  ☆80Updated 6 years ago