Alternatives and similar repositories for ARF

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

• efficient / fast-succinct-trie
  ☆27Updated 8 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆17Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆34Updated 8 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆26Updated 7 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 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
• LMDB / dbbench
  Embedded DB Benchmark Framework
  ☆62Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆55Updated 7 years ago
• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 8 years ago
• dgryski / libchash
  simple consistent hashing implementation
  ☆56Updated 7 years ago
• google / berrydb
  ☆66Updated 5 years ago
• kellydunn / go-art
  an adaptive radix tree implementation in go
  ☆69Updated 4 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
• efficient / go-cuckoo
  A high-performance, memory-efficient concurrent hash table
  ☆36Updated 12 years ago
• efficient / qlease
  ☆24Updated 11 years ago
• fastly / uslab
  Lock-free slab allocator / freelist.
  ☆69Updated 10 years ago
• LPD-EPFL / ssmem
  ssmem is a simple object-based memory allocator with epoch-based garbage collection
  ☆34Updated 9 years ago
• ongardie / ark
  ☆10Updated 8 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆25Updated 10 years ago
• wpaxos / paxi
  Paxos protocol variants framework
  ☆26Updated 7 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
• OrangeTide / btree
  lock free modified prefix B+tree append-only database
  ☆116Updated 10 years ago
• klsmpq / klsm
  The k-LSM: A relaxed, lock-free, linearizable priority queue
  ☆23Updated 8 years ago
• viyadb / viyadb
  ViyaDB in-memory columnar analytical data store
  ☆115Updated 6 years ago
• balena / radixdb
  Static Radix Tree (Patricia trie) implementation in C
  ☆48Updated 8 years ago
• facebookarchive / iterlib
  Iterator library.
  ☆80Updated 5 years ago
• vkrasnov / avx_qsort
  Quick sort code using AVX2 instructions
  ☆69Updated 8 years ago