Alternatives and similar repositories for rankselect

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

• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• 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
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• ot / succinct
  A collection of succinct data structures
  ☆204Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆126Updated 10 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 14 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 7 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆119Updated 8 years ago
• wpaxos / paxi
  Paxos protocol variants framework
  ☆26Updated 7 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆100Updated 3 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆42Updated 8 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆54Updated 7 years ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆33Updated 8 years ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years 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
• jsnell / parallel-xxhash
  Compute xxHash hash codes for 8 keys in parallel
  ☆46Updated 6 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆37Updated 4 years ago
• michaelmior / mvptree
  A fork of D Grant Starkweather's multiple vantage point tree library
  ☆41Updated 7 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• efficient / qlease
  ☆24Updated 10 years ago
• efficient / ARF
  ☆11Updated 7 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• ucbrise / LatticeFlow
  ☆28Updated 8 years ago