Alternatives and similar repositories for art_map

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

• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆33Updated 7 months ago
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆281Updated last week
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆19Updated last year
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• rchikhi / benchmphf
  Benchmark of four minimal perfect hash libraries (phf, emphf, CMPH, Sux4J)
  ☆13Updated 8 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• cmuparlay / parlayhash
  Concurrent Hash Table
  ☆31Updated 2 weeks ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• laurynas-biveinis / unodb
  Adaptive Radix Tree in C++
  ☆45Updated last month
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• ekg / mmmulti
  memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort
  ☆27Updated 4 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• cmuparlay / flock
  Library for lock-free locks
  ☆82Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 4 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 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…
  ☆112Updated 8 months ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆128Updated 2 years 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.
  ☆31Updated 4 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 5 months ago
• jermp / pthash
  ✈️ PTHash is a fast and compact minimal perfect hash function.
  ☆237Updated 3 months ago