Alternatives and similar repositories for CoCo-trie:

Users that are interested in CoCo-trie are comparing it to the libraries listed below

• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated 3 weeks ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months 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
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆43Updated 3 weeks ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 11 months ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 3 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.
  ☆29Updated 2 weeks ago
• wuwuz / Vacuum-Filter
  ☆50Updated 5 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 4 years ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆52Updated 7 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 5 years ago
• and-gue / NeaTS
  ☆10Updated 3 weeks ago
• t1mm3 / vldb_voila
  Query engine synthesizer based on, our domain-specific language, VOILA
  ☆13Updated 4 years ago
• peterboncz / bloomfilter-bsd
  based on the work of Harald Lang when at CWI
  ☆23Updated 5 years ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 4 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 6 months ago