Efficient Prefix-Sum data structures in C++.
☆27Oct 1, 2023Updated 2 years ago
Alternatives and similar repositories for psds
Users that are interested in psds 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
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- A fast, compact trigram library for Icelandic.☆11Dec 12, 2025Updated 3 months ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated 8 months ago
- C++ Library implementing Compressed String Dictionaries☆47Apr 25, 2022Updated 3 years ago
- A C++ library providing fast language model queries in compressed space.☆132Feb 25, 2023Updated 3 years ago
- Page of the course "Information Retrieval" at Department of Computer Science, University of Pisa☆20Dec 18, 2025Updated 3 months ago
- C++ Implementation of Zip Trees☆14Nov 5, 2022Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 7 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated last week
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 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
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated this week
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Dec 20, 2022Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated 9 months ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆355Apr 1, 2024Updated last year
- A C++ library to benchmark inverted indexes.☆21Aug 4, 2020Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 4 years ago
- Static Huffman coding☆10Apr 3, 2017Updated 8 years ago
- String map implementation through Fast Succinct Trie☆23Jul 9, 2021Updated 4 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 7 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Jan 22, 2023Updated 3 years ago
- A small, auxiliary index to massively improve parallel fastq parsing☆31Mar 6, 2026Updated 2 weeks ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated last year
- ☆11Feb 21, 2023Updated 3 years ago
- VTEnc C library☆37Dec 1, 2022Updated 3 years ago
- Persistent Bloom Filter☆12Jul 21, 2018Updated 7 years ago
- Is a linear data structure with O(log n) searches and O(cbrt n) insertions and index lookups.☆29Feb 22, 2021Updated 5 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 2 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆44Jun 1, 2024Updated last year
- ☆15Mar 11, 2026Updated last week
- DSL for SIMD Sorting on AVX2 & AVX512☆31Jan 11, 2019Updated 7 years ago
- A collection of succinct data structures☆213Jan 3, 2024Updated 2 years ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Aug 20, 2019Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- A library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago