Alternatives and similar repositories for succinct

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

• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• ot / ds2i
  A library of inverted index data structures
  ☆149Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆118Updated 8 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆84Updated last year
• cksystemsgroup / scal
  High-performance multicore-scalable data structures and benchmarks
  ☆141Updated 5 years ago
• vedantk / quotient-filter
  a quotient filter written in C
  ☆84Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆123Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆264Updated 2 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆89Updated 8 months ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 2 months ago
• ot / semi_index
  Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"
  ☆57Updated 12 years ago
• malbrain / HatTrie
  A compact implementation of Dr. Askitis HatTrie
  ☆80Updated 11 years ago
• google / supersonic
  Supersonic is an ultra-fast, column oriented query engine library written in C++
  ☆206Updated 4 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• fast-pack / SIMDCompressionAndIntersection
  A C++ library to compress and intersect sorted lists of integers using SIMD instructions
  ☆434Updated last year
• luispedro / diskhash
  Diskbased (persistent) hashtable
  ☆161Updated 8 months ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆187Updated last year
• agl / critbit
  Critbit trees in C
  ☆335Updated 3 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 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
• mavam / libbf
  Bloom filters for C++11
  ☆359Updated 3 years ago