Alternatives and similar repositories for ARF

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

• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 12 years ago
• dgryski / libchash
  simple consistent hashing implementation
  ☆55Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• dgryski / go-groupvarint
  SSE-optimized group varint integer encoding
  ☆37Updated 2 years ago
• wpaxos / paxi
  Paxos protocol variants framework
  ☆26Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• LPD-EPFL / lockin
  LOCKIN is a locking library with various lock algorithms implemented in header files for ease of use
  ☆10Updated 8 years ago
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 11 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• dgryski / go-marvin32
  Assembly-optimized Marvin32 hash function
  ☆12Updated last year
• ongardie / ark
  ☆10Updated 7 years ago
• aclements / objbrowse
  Interactive object file browser with symbol, source, assembly, and analysis
  ☆22Updated last year
• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• klsmpq / klsm
  The k-LSM: A relaxed, lock-free, linearizable priority queue
  ☆23Updated 8 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• efficient / qlease
  ☆24Updated 10 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• kellydunn / go-art
  an adaptive radix tree implementation in go
  ☆69Updated 3 years ago
• Shardcached / libshardcache
  C implementation of a caching and cache-filling library inspired to groupcache
  ☆43Updated 9 years ago
• asubiotto / vecdeepdive
  ☆13Updated 5 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆49Updated 4 years ago
• tum-db / cachecoherence
  ☆12Updated 4 years ago
• RedisLabs / triemap
  C implementation of a compressed trie lookup map
  ☆21Updated 6 years ago