Alternatives and similar repositories for sprintz

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

• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆53Updated 4 months ago
• panagiotisl / chimp
  Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
  ☆37Updated 11 months ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• hpides / vectorized-hash-tables
  Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.
  ☆25Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• ghilesmeddour / gorilla-time-series-compression
  Python implementation of Gorilla time series compression
  ☆46Updated 2 months ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated last year
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 5 years ago
• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆105Updated 2 months ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆92Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• sengelha / streaming-percentiles
  Cross-platform, multi-language implementation of multiple streaming percentile algorithms
  ☆63Updated 2 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 12 years ago
• schani / michael-alloc
  Lock-free allocator as described by Maged M. Michael, 2004
  ☆46Updated 11 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)
  ☆80Updated 3 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 4 months ago
• kiyo-masui / bitshuffle
  Filter for improving compression of typed binary data.
  ☆227Updated 5 months ago
• efficient / mica2
  A fast in-memory key-value store
  ☆49Updated 7 years ago
• pramalhe / RedoDB
  The world's first wait-free KV store with generic durable linearizable transactions
  ☆41Updated 3 years ago
• fast-pack / LittleIntPacker
  C library to pack and unpack short arrays of integers as fast as possible
  ☆89Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆47Updated 6 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆54Updated last year