Clustered Elias-Fano inverted indexes.
☆15Jun 4, 2018Updated 8 years ago
Alternatives and similar repositories for clustered_elias_fano_indexes
Users that are interested in clustered_elias_fano_indexes 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☆150Dec 15, 2022Updated 3 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Jan 31, 2015Updated 11 years ago
- Experimental search engine in C/C++17 - still in early development.☆27Jul 8, 2026Updated last month
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Dec 4, 2019Updated 6 years ago
- TSXor: A Simple Time Series Compression Algorithm☆54Feb 19, 2025Updated last year
- 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.
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Nov 10, 2021Updated 4 years ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Aug 6, 2025Updated last year
- ☆13Nov 15, 2017Updated 8 years ago
- ☆12Dec 18, 2018Updated 7 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Jun 26, 2020Updated 6 years ago
- SUccinct Retrieval Framework☆21Jan 24, 2016Updated 10 years ago
- Stream processing engine☆13Apr 7, 2021Updated 5 years ago
- Bicriteria Data Compressor☆15Dec 9, 2017Updated 8 years ago
- ☆40Jun 20, 2020Updated 6 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- A space-efficient compressor based on the Re-Pair grammar☆12Apr 6, 2017Updated 9 years ago
- A collection of succinct data structures☆216Jan 3, 2024Updated 2 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆11Sep 13, 2018Updated 7 years ago
- A C++ library to benchmark inverted indexes.☆23Aug 4, 2020Updated 6 years ago
- compressed, queryable variation graphs☆11Jun 25, 2015Updated 11 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Dependably fast multi-core in-memory transactions☆20Aug 10, 2017Updated 9 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21May 9, 2021Updated 5 years ago
- A simple implementation of the write-optimized Bε Tree 🌳 - for MIT 6.854 (Advanced Algorithms).☆25Dec 27, 2019Updated 6 years ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14May 11, 2018Updated 8 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆16Jul 5, 2023Updated 3 years ago
- Prototype implementation and extended paper of SDPaxos☆16Nov 30, 2018Updated 7 years ago
- Official source code repository for QueryBlazer: Efficient Query Autocompletion Framework☆20Jun 16, 2025Updated last year
- EliasFanoCompression: quasi-succinct compression of sorted integers in C#☆46Oct 29, 2021Updated 4 years ago
- ☆12May 17, 2022Updated 4 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Feb 15, 2022Updated 4 years ago
- Code for the ECIR'22 paper "Evaluating the Robustness of Retrieval Pipelines with Query Variation Generators"☆17Feb 2, 2022Updated 4 years ago
- LIBBLE by Parameter Server☆17Sep 17, 2018Updated 7 years ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- ☆15Oct 4, 2022Updated 3 years ago
- ☆54Apr 11, 2024Updated 2 years ago
- A Data Visualization tool for choosing reviewers☆21Jan 13, 2021Updated 5 years ago
- Page of the course "Information Retrieval" at Department of Computer Science, University of Pisa☆21Dec 18, 2025Updated 8 months ago
- Prototype of FPaxos, built upon LibPaxos3☆48Mar 14, 2020Updated 6 years ago
- a close enough approximation of the shadertoy framework☆12Jul 2, 2020Updated 6 years ago
- Artifact for PPoPP'18☆19Apr 11, 2022Updated 4 years ago