Alternatives and similar repositories for TSXor

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

• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆288Updated 3 months ago
• cwida / ALP
  ALP: Adaptive Lossless Floating-Point Compression
  ☆150Updated 2 months ago
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆48Updated last week
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆167Updated 3 weeks ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆31Updated 4 years ago
• dotnwat / awesome-seastar
  A curated list of resources related to Seastar, an industrial-grade C++ framework for building high-performance servers.
  ☆107Updated 3 months ago
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated last year
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆83Updated 2 years ago
• L-v-M / async
  ☆20Updated 2 years ago
• dblalock / sprintz
  Sprintz time series compression algorithm
  ☆73Updated last year
• 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
• harald-lang / tree-encoded-bitmaps
  ☆39Updated 5 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆157Updated 7 years ago
• eourcs / LockFreeCuckooHash
  A fully concurrent lock-free cuckoo hash table implementation
  ☆56Updated 8 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 10 months ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 8 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆440Updated 5 months ago
• rmind / thmap
  Concurrent trie-hash map library
  ☆93Updated 2 years ago
• AMDComputeLibraries / morton_filter
  A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
  ☆89Updated 5 years ago
• lsds / LightSaber
  Multi-core Window-Based Stream Processing Engine
  ☆73Updated 4 years ago
• vimpunk / w-tinylfu
  W-TinyLFU cache C++11 header only implementation
  ☆63Updated 7 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• ParaGroup / WindFlow
  A C++ Data Stream Processing Parallel Library for Multicores and GPUs
  ☆84Updated 2 weeks ago
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆83Updated 3 years ago
• wuxb45 / remixdb
  RemixDB: A read- and write-optimized concurrent KV store. Fast point and range queries. Extremely low write-amplification.
  ☆102Updated 2 years ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆249Updated last month