Efficient Prefix-Sum data structures in C++.
☆28Oct 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. 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
- 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
- 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 4 years ago
- A fast, compact trigram library for Icelandic.☆12Jun 11, 2026Updated last month
- Managed Kubernetes at scale on DigitalOcean • AdDigitalOcean Kubernetes includes the control plane, bandwidth allowance, container registry, automatic updates, and more for free.
- Efficient and effective query auto-completion in C++.☆56Sep 24, 2023Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Jul 14, 2025Updated last year
- A C++ library implementing fast language models estimation using the 1-Sort algorithm.☆16May 18, 2023Updated 3 years ago
- Page of the course "Information Retrieval" at Department of Computer Science, University of Pisa☆21Dec 18, 2025Updated 7 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 8 years ago
- ⚙️🛠️ Essential C++ utilities.☆14Mar 9, 2026Updated 5 months ago
- Universe-sliced indexes in C++.☆18Jan 8, 2023Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Apr 9, 2026Updated 4 months 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.
- A Rust implementation of the Quad Wavelet Tree☆55Jul 8, 2026Updated last month
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆39Dec 20, 2022Updated 3 years ago
- A cheatsheet for most common Stringology tasks☆14Apr 14, 2021Updated 5 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆51Jun 16, 2025Updated last year
- Accompanying code for https://orlp.net/blog/bitwise-binary-search/.☆16May 16, 2023Updated 3 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆108Updated this week
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆357Apr 1, 2024Updated 2 years ago
- Command line parser for C++17.☆29Dec 10, 2024Updated last year
- A C++ library to benchmark inverted indexes.☆22Aug 4, 2020Updated 6 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Fast Approximate Membership Filters (C++)☆24Apr 27, 2021Updated 5 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Jan 22, 2023Updated 3 years ago
- Clustered Elias-Fano inverted indexes.☆15Jun 4, 2018Updated 8 years ago
- TSXor: A Simple Time Series Compression Algorithm☆54Feb 19, 2025Updated last year
- ☆10Feb 23, 2024Updated 2 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- A self-contained, header-only, implementation of memory-mapped files in C++ for fast integration into larger projects.☆40Aug 22, 2024Updated last year
- VTEnc C library☆37Dec 1, 2022Updated 3 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆46Jun 1, 2024Updated 2 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.
- Is a linear data structure with O(log n) searches and O(cbrt n) insertions and index lookups.☆29Feb 22, 2021Updated 5 years ago
- ☆15May 22, 2026Updated 2 months ago
- Persistent Bloom Filter☆12Jul 21, 2018Updated 8 years ago
- O(n log n) In-place Stable Quicksort☆25Aug 7, 2025Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Aug 9, 2023Updated 3 years ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Aug 20, 2019Updated 6 years ago
- A collection of succinct data structures☆216Jan 3, 2024Updated 2 years ago