Alternatives and similar repositories for CoCo-trie

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

• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 3 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆50Updated 4 months ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 7 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated 2 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated last year
• google / cuckoo-index
  Cuckoo Index: A Lightweight Secondary Index Structure
  ☆129Updated 3 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• wuwuz / Vacuum-Filter
  ☆53Updated 11 months ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆30Updated 5 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• rafaelkallis / adaptive-radix-tree
  An adaptive radix tree for efficient indexing in main memory.
  ☆166Updated last year
• amplab / succinct-cpp
  Succinct C++
  ☆24Updated 5 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• FastFilter / fastfilter_cpp
  Fast Approximate Membership Filters (C++)
  ☆286Updated 2 months ago
• andybbruno / TSXor
  TSXor: A Simple Time Series Compression Algorithm
  ☆53Updated 8 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 7 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago