efficient / rankselect

Related projects ⓘ

Alternatives and complementary repositories for rankselect

• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 6 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 5 months ago
• WojciechMula / simd-search
  Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)
  ☆51Updated 7 years ago
• lemire / FastDifferentialCoding
  Fast differential coding functions (using SIMD instructions)
  ☆49Updated 6 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• efficient / fast-succinct-trie
  ☆25Updated 7 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆52Updated 13 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆115Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 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 6 months ago
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆17Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• lemire / multiplatform_simd_recipes
  SIMD recipes, for various platforms (collection of code snippets)
  ☆48Updated 3 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 …
  ☆21Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 8 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 7 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆41Updated 4 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 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.
  ☆40Updated 7 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆37Updated 9 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆33Updated last year
• lemire / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆117Updated 5 months ago
• maropu / integer_encoding_library
  An encoder/decoder collection for a sequence of integers
  ☆32Updated 11 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year