Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
☆33May 31, 2021Updated 5 years ago
Alternatives and similar repositories for Efficiently-Searching-In-Memory-Sorted-Arrays
Users that are interested in Efficiently-Searching-In-Memory-Sorted-Arrays are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆14Nov 21, 2021Updated 4 years ago
- GPU-Accelerated Faster Decoding of Integer Lists☆13Aug 20, 2019Updated 7 years ago
- WIPE implementation☆12Nov 26, 2023Updated 2 years ago
- Official code of "PLEX: Towards Practical Learned Indexing", aka TrieSpline (AIDB @VLDB'21)☆17Jun 30, 2022Updated 4 years ago
- k-means++: a C++ version implement☆19Dec 26, 2017Updated 8 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.
- Interleaving bits from two sources using SIMD instructions.☆14Feb 2, 2018Updated 8 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆11Sep 13, 2018Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Jun 3, 2021Updated 5 years ago
- Indexing TREC corpora and Wikipedia using Lucene☆12Dec 10, 2014Updated 11 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Dec 16, 2019Updated 6 years ago
- bit & sketches data structures☆60Nov 2, 2018Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- A Scalable Peer-to-peer Lookup Protocol for Internet Applications☆10Dec 17, 2022Updated 3 years ago
- 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.
- SQL to Redis command translation utility☆13Oct 21, 2026Updated last week
- EXAREME☆24May 2, 2023Updated 3 years ago
- Learned Sort: a model-enhanced sorting algorithm☆81Aug 20, 2021Updated 5 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- ☆13Aug 2, 2018Updated 8 years ago
- A simple sparse bitmap implementation in java☆21Jan 28, 2016Updated 10 years ago
- EliasFanoCompression: quasi-succinct compression of sorted integers in C#☆46Oct 29, 2021Updated 5 years ago
- NUR - https://github.com/nix-community/NUR☆13Mar 23, 2026Updated 7 months ago
- Fast algorithms for computing XX^T for binary matrices☆14Sep 24, 2019Updated 7 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- DSL for SIMD Sorting on AVX2 & AVX512☆31Jan 11, 2019Updated 7 years ago
- Library to compile Flint queries and updates into Apache Jena objects☆10Oct 16, 2026Updated 2 weeks ago
- VTEnc C library☆37Dec 1, 2022Updated 3 years ago
- Persistent Adaptive Radix Tree (PART) for JavaScript☆13Jan 19, 2018Updated 8 years ago
- A Single-Pass Learned Index☆142Apr 28, 2023Updated 3 years ago
- A non-distributed reference implementation of Facebook's read-optimized graph data store, TAO☆12May 25, 2020Updated 6 years ago
- 8-bit Xor Filter in C99☆63Dec 22, 2019Updated 6 years ago
- ☆10Sep 28, 2026Updated last month
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆38Apr 14, 2022Updated 4 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.
- A benchmark for sorting algorithms☆61Apr 17, 2021Updated 5 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- Unix look utility analog which is blazingly fast and works with big files☆18May 27, 2022Updated 4 years ago
- ☆48Jun 10, 2023Updated 3 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆14Mar 31, 2022Updated 4 years ago
- ☆129May 25, 2026Updated 5 months ago
- 📜 A. Giannopoulos, D. Mouris M.Sc. thesis for University of Athens☆10Jan 31, 2020Updated 6 years ago