Alternatives and similar repositories for bitshuffle

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

• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆440Updated 5 months ago
• apache / parquet-cpp
  Apache Parquet
  ☆445Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• fast-pack / FastPFOR
  The FastPFOR C++ library: Fast integer compression
  ☆946Updated last month
• apache / datasketches-cpp
  Core C++ Sketch Library
  ☆247Updated last month
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆207Updated 5 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated 11 months ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆411Updated 10 months ago
• bingmann / stx-btree
  OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -
  ☆215Updated 2 years ago
• wuxb45 / lsm-trie
  LSM-trie
  ☆114Updated 4 years ago
• memkind / memkind
  Memkind is an easy-to-use, general-purpose allocator which helps to fully utilize various kinds of memory available in the system, includ…
  ☆392Updated last year
• geofflangdale / simdcsv
  A fast SIMD parser for CSV files
  ☆159Updated 3 years ago
• fast-pack / simdcomp
  A simple C library for compressing lists of integers using binary packing
  ☆511Updated 2 years ago
• derrickburns / tdigest
  C++ version of Ted Dunning's merging t-digest
  ☆30Updated last month
• apache / incubator-retired-quickstep
  Apache Quickstep Incubator - This project is retired
  ☆94Updated 7 years ago
• runshenzhu / palmtree
  An implementation of Intel's concurrent B+Tree (Palm Tree)
  ☆176Updated 9 years ago
• powturbo / TurboPFor-Integer-Compression
  Fastest Integer Compression
  ☆819Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• kohler / masstree-beta
  Beta release of Masstree.
  ☆449Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 8 years ago
• fredrikwidlund / hash-function-benchmark
  Benchmark of common hash functions
  ☆36Updated 6 years ago
• KioxiaAmerica / trocksdb
  RocksDB modified to separate keys and values, resulting in a major decrease in write amplification without sacrificing performance
  ☆56Updated 5 years ago
• hyrise / hyrise-v1
  HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)
  ☆89Updated 7 years ago
• cwida / fsst
  Fast Static Symbol Table (FSST): efficient random-access string compression
  ☆484Updated 3 weeks ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• Blosc / c-blosc2
  A fast, compressed, persistent binary data store library for C.
  ☆541Updated 3 weeks ago
• MonetDB / MonetDB-old
  This is the official mirror of the MonetDB Mercurial repository. Please note that we do not accept pull requests on github. The regressio…
  ☆309Updated 5 years ago
• google / hashtable-benchmarks
  ☆111Updated last year