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".
  ☆55Updated last year
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 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
• geofflangdale / sheng
  A small DFA for under 16 states
  ☆51Updated 6 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 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(…
  ☆49Updated 8 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• bryankate / pequod
  A distributed key-value cache with builtin materialized views.
  ☆26Updated 10 years ago
• demerphq / BeagleHash
  Fast 64 bit evolved hash.
  ☆32Updated 7 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• hillbig / rsdic
  A Go library for space-efficient rank/select operations for both sparse and dense bit arrays.
  ☆36Updated 4 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• tokenrove / fixie-trie
  Compact tries for fixed-width keys
  ☆25Updated 6 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 7 months ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• xxsds / multi_index
  A C++ template library for compact Hamming distance indexes
  ☆10Updated 7 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 8 years ago
• fsaintjacques / libtwiddle
  bit & sketches data structures
  ☆60Updated 6 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆33Updated last year
• stasis / stasis
  Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…
  ☆53Updated 11 years ago
• wolfgarbe / EliasFanoCompression
  EliasFanoCompression: quasi-succinct compression of sorted integers in C#
  ☆43Updated 3 years ago
• ot / succinct
  A collection of succinct data structures
  ☆197Updated last year