Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
☆40Jan 31, 2015Updated 11 years ago
Alternatives and similar repositories for partitioned_elias_fano
Users that are interested in partitioned_elias_fano 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 library of inverted index data structures☆151Dec 15, 2022Updated 3 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Sample implementation of suffix array construction algorithm, SA-IS.☆10Aug 18, 2011Updated 15 years ago
- A collection of succinct data structures☆219Jan 3, 2024Updated 2 years ago
- Clustered Elias-Fano inverted indexes.☆14Jun 4, 2018Updated 8 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.
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆66May 29, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Aug 7, 2018Updated 8 years ago
- Dictionary-based compression for inverted indexes.☆23Mar 22, 2019Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆59Jan 27, 2023Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- General purpose C++ library for iZENECloud☆43Apr 21, 2015Updated 11 years ago
- A C++ library to benchmark inverted indexes.☆25Aug 4, 2020Updated 6 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 11 years ago
- playground for creating new statement and constructs in python using import hooks☆15Apr 1, 2024Updated 2 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.
- Fast decoder for VByte-compressed integers☆130Jun 7, 2026Updated 5 months ago
- Compact Tree Representation☆16Mar 16, 2017Updated 9 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 5 years ago
- linear time suffix array construction algorithm☆11Oct 28, 2016Updated 10 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Compact Data Structures Library☆128Sep 4, 2014Updated 12 years ago
- Fastest Integer Compression☆851Oct 8, 2026Updated last month
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 4 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆112Jan 22, 2015Updated 11 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.
- A C implementation of a Boldi-Vigna graph decompressor☆17Jul 5, 2016Updated 10 years ago
- Lthread C++11 binding☆12Nov 8, 2014Updated 12 years ago
- Fork of INRIA's YAEL library☆21Oct 6, 2016Updated 10 years ago
- Python Implementation of Graham Cormode and S. Muthukrishnan's Effective Computation of Biased Quantiles over Data Streams in ICDE’05☆15Jun 7, 2023Updated 3 years ago
- Succinct Data Structure Library☆112Sep 26, 2013Updated 13 years ago
- Compact Data Structures Library☆102Jun 20, 2022Updated 4 years ago
- A decompilation framework based on LLVM☆14Apr 4, 2014Updated 12 years ago
- The FastPFOR C++ library: Fast integer compression☆978Oct 4, 2026Updated last month
- Simple and fast MinHash implementation in C with Python wrapper☆13Jul 24, 2025Updated last year
- GPUs on demand by Runpod - Special Offer Available • AdRun AI, ML, and HPC workloads on powerful cloud GPUs—without limits or wasted spend. Deploy GPUs in under a minute and pay by the second.
- ☆40Jun 20, 2020Updated 6 years ago
- Universe-sliced indexes in C++.☆19Jan 8, 2023Updated 3 years ago
- A key/value database based on SkimpyStash.☆13Jun 11, 2015Updated 11 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆47Sep 4, 2024Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆37Apr 7, 2025Updated last year
- Succinct data structures in C/C++☆98May 5, 2026Updated 6 months ago
- Succinct Data Structure Library Collection.Includes bit-vector/wavelet-matrix/trie.☆13Jul 16, 2015Updated 11 years ago
Are these results useful?