Alternatives and similar repositories for TSXor:

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

• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆78Updated this week
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 4 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 7 years ago
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆152Updated 9 months ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆39Updated this week
• panagiotisl / chimp
  Chimp: Efficient Lossless Floating Point Compression for Time Series Databases
  ☆35Updated 6 months ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 7 years ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆130Updated 3 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆52Updated 8 months ago
• harald-lang / tree-encoded-bitmaps
  ☆37Updated 4 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 7 years ago
• dblalock / sprintz
  Sprintz time series compression algorithm
  ☆68Updated 8 months ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆102Updated 4 months ago
• L-v-M / async
  ☆20Updated 2 years ago
• wagjamin / inkfuse
  InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.
  ☆44Updated 8 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 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)
  ☆74Updated 2 years ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆273Updated 2 weeks ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• cwida / FastLanes
  Towards a New File Format
  ☆182Updated 4 months ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆57Updated 6 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆27Updated 2 months ago