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. We may earn a commission when you buy through links labeled 'Ad' on this page.
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 9 years ago
- A collection of succinct data structures☆215Jan 3, 2024Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 4 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆35Apr 7, 2025Updated last year
- 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.☆39Dec 20, 2022Updated 3 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 15 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
- GPU-Accelerated Faster Decoding of Integer Lists☆13Aug 20, 2019Updated 6 years ago
- A fast, compact trigram library for Icelandic.☆12Jun 11, 2026Updated last month
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 4 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆36Jun 8, 2016Updated 10 years ago
- Efficient Prefix-Sum data structures in C++.☆28Oct 1, 2023Updated 2 years ago
- A library of inverted index data structures☆150Dec 15, 2022Updated 3 years ago
- RDF Graph Database (http://grid.hust.edu.cn/triplebit/)☆11Sep 19, 2014Updated 11 years ago
- A Go package for myriad array operations using wavelet trees☆19Feb 28, 2016Updated 10 years ago
- A Go implementation of the Elias-Fano encoding☆42Jun 16, 2024Updated 2 years ago
- Request interceptor which improves the service time of cloud services by controlling GC interventions.☆15Aug 10, 2018Updated 7 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
- An encoder/decoder collection for a sequence of integers☆32Mar 10, 2013Updated 13 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- ☆27Mar 23, 2017Updated 9 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Feb 20, 2016Updated 10 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
- Dynamic succinct/compressed data structures☆118Dec 17, 2025Updated 7 months ago
- Succinct Data Structure Library 3.0☆107Jul 1, 2026Updated 2 weeks 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
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Jan 11, 2019Updated 7 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 3 months ago
- A C++ library for integer array compression☆31Mar 18, 2022Updated 4 years ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- an adaptive radix tree implementation in go☆69Oct 11, 2021Updated 4 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago
- C++11 library for fast fuzzy searching☆15Jun 9, 2015Updated 11 years ago