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
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆56Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 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
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 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
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆34Updated 2 years ago
• hillbig / partialsum
  A Go library for succinct partial sums data structure
  ☆10Updated 10 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆37Updated 4 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 11 months ago
• efficient / fast-succinct-trie
  ☆26Updated 8 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆52Updated 7 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 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
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 9 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆117Updated 8 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 8 years ago
• ot / succinct
  A collection of succinct data structures
  ☆201Updated last year
• fast-pack / dictionary
  High-performance dictionary coding
  ☆104Updated 8 years ago