Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
☆55Jan 3, 2024Updated 2 years ago
Alternatives and similar repositories for rankselect
Users that are interested in rankselect are comparing it to the libraries listed below
Sorting:
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated 11 months ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- Lthread C++11 binding☆12Nov 8, 2014Updated 11 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆58Dec 7, 2012Updated 13 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- A high-performance, memory-efficient concurrent hash table☆36Oct 5, 2013Updated 12 years ago
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- Efficient Prefix-Sum data structures in C++.☆27Oct 1, 2023Updated 2 years ago
- A fast, compact trigram library for Icelandic.☆11Dec 12, 2025Updated 3 months ago
- RDF Graph Database (http://grid.hust.edu.cn/triplebit/)☆11Sep 19, 2014Updated 11 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- A Go package for myriad array operations using wavelet trees☆19Feb 28, 2016Updated 10 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- fixed-length integer trim☆35Mar 20, 2023Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Reduced on-disk Suffix Array☆22Oct 9, 2013Updated 12 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Feb 20, 2016Updated 10 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."☆13Oct 26, 2016Updated 9 years ago
- ☆27Mar 23, 2017Updated 8 years ago
- Dynamic succinct/compressed data structures☆117Dec 17, 2025Updated 3 months ago
- Succinct vectors☆20Dec 29, 2018Updated 7 years ago
- an adaptive radix tree implementation in go☆69Oct 11, 2021Updated 4 years ago
- Succinct Data Structure Library 3.0☆104Dec 15, 2025Updated 3 months ago
- Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…☆14Nov 7, 2019Updated 6 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Jan 11, 2019Updated 7 years ago
- KITTeL/KoAT☆21Dec 19, 2018Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- de Bruijn graph construction tool☆19Apr 26, 2015Updated 10 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago