RedisBloom / t-digest-c

Related projects: ⓘ

• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆26Updated 3 years ago
• paulross / skiplist
  A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!
  ☆47Updated last month
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆50Updated 11 months ago
• rmind / masstree
  Masstree -- lockless cache-aware trie of B+ trees [experimental]
  ☆96Updated 6 years ago
• pfent / L5RDMA
  A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA
  ☆67Updated 3 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆69Updated 2 years ago
• lsidir / imprints
  simd enabled column imprints
  ☆11Updated 6 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)
  ☆76Updated 2 years ago
• caetanosauer / fineline-zero
  ☆12Updated 5 years ago
• peterboncz / bloomfilter-repro
  ☆19Updated 5 years ago
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆223Updated last month
• umd-dslam / SLOG
  SLOG: Serializable, Low-latency, Geo-replicated Transactions
  ☆40Updated last year
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆36Updated last week
• lemire / dictionary
  High-performance dictionary coding
  ☆102Updated 7 years ago
• bytedance / terark-zip
  A data structure and algorithm library built for TerarkDB
  ☆61Updated 2 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆128Updated 2 years ago
• eBay / Jungle
  An embedded key-value store library specialized for building state machine and log store
  ☆221Updated last week
• derrickburns / tdigest
  C++ version of Ted Dunning's merging t-digest
  ☆27Updated 3 years ago
• dialtr / libcount
  C/C++ Implementation of the HyperLogLog++ cardinality estimation algorithm.
  ☆26Updated last year
• audreyccheng / taobench
  A distributed database benchmark based on TAO's workload
  ☆37Updated 8 months ago
• UWHustle / hustle
  In-memory, columnar, arrow-based database.
  ☆41Updated 2 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 4 years ago
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆59Updated 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
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 5 years ago
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆57Updated 3 years ago
• topling / topling-zip
  A data structure and algorithm library built for ToplingDB
  ☆54Updated 2 weeks ago
• umd-dslam / Detock
  (Det)erministic deadl(ock) resolution for high-throughput, low-latency, and strongly consistent data stores.
  ☆19Updated 5 months 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
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated last year
• utah-scs / splinter
  A low-latency, extensible, multi-tenant key-value store.
  ☆54Updated 3 years ago