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:
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆36Jan 8, 2023Updated 3 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- Feed-forward Bloom filters☆53Jun 7, 2011Updated 14 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- Request interceptor which improves the service time of cloud services by controlling GC interventions.☆15Aug 10, 2018Updated 7 years ago
- Lthread C++11 binding☆12Nov 8, 2014Updated 11 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Apr 25, 2022Updated 3 years ago
- Tools for safe management of persistent main memory.☆28Nov 3, 2013Updated 12 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆11Feb 20, 2016Updated 10 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 10 months ago
- ☆27Mar 23, 2017Updated 8 years ago
- A Go package for myriad array operations using wavelet trees☆19Feb 28, 2016Updated 9 years ago
- ☆24Oct 11, 2014Updated 11 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 11 years ago
- fixed-length integer trim☆35Mar 20, 2023Updated 2 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
- MemC3☆156Apr 28, 2017Updated 8 years ago
- A fork of D Grant Starkweather's multiple vantage point tree library☆41Feb 20, 2018Updated 8 years ago
- an adaptive radix tree implementation in go☆69Oct 11, 2021Updated 4 years ago
- A Go implementation of the Elias-Fano encoding☆41Jun 16, 2024Updated last year
- Generate Go structs from JSON!☆42May 1, 2013Updated 12 years ago
- A scalable implementation of the multifrontal method for symmetric and Hermitian systems (with intrafrontal pivoting)☆19Jun 27, 2016Updated 9 years ago
- A simple library for querying the AST of a Go program☆11Feb 10, 2015Updated 11 years ago
- Simple standalone Docker Plugin implementation to demonstrate Clear Containers with VPP.☆13Jan 6, 2023Updated 3 years ago
- goembed is a tool for embedding data in a Go program.☆12Jul 24, 2018Updated 7 years ago
- ☆11Oct 18, 2017Updated 8 years ago
- ☆11Apr 19, 2018Updated 7 years ago
- Simple task scheduler☆11May 16, 2023Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Apr 25, 2022Updated 3 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆213Jan 18, 2016Updated 10 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Jan 19, 2018Updated 8 years ago
- A modern subset of the range query language☆40Oct 15, 2020Updated 5 years ago
- Vantage-point tree implementation in the Go programming language☆20Jul 6, 2024Updated last year
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Efficient Prefix-Sum data structures in C++.☆26Oct 1, 2023Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆58Jan 27, 2023Updated 3 years ago