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 6 years ago
- WIPE implementation☆12Nov 26, 2023Updated 2 years ago
- ☆16Feb 19, 2017Updated 9 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.
- [VLDB'22] Source code for the paper: A Cache-Aware Learned Index with a Cost-based Construction Algorithm.☆10Jan 3, 2022Updated 4 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆22May 23, 2026Updated 2 months 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
- NUR - https://github.com/nix-community/NUR☆13Mar 23, 2026Updated 4 months ago
- ☆21Apr 12, 2018Updated 8 years ago
- A Scalable Peer-to-peer Lookup Protocol for Internet Applications☆10Dec 17, 2022Updated 3 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.
- Learned Sort: a model-enhanced sorting algorithm☆81Aug 20, 2021Updated 4 years ago
- Building Zero Knowledge Proof from Scratch in Rust☆54Nov 10, 2025Updated 9 months ago
- A simple sparse bitmap implementation in java☆21Jan 28, 2016Updated 10 years ago
- Python implementation of Hotelling's T2 for process monitoring + MYT decomposition☆11Sep 9, 2025Updated 11 months ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Jan 22, 2023Updated 3 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Jan 11, 2019Updated 7 years ago
- VTEnc C library☆37Dec 1, 2022Updated 3 years ago
- A non-distributed reference implementation of Facebook's read-optimized graph data store, TAO☆12May 25, 2020Updated 6 years ago
- Simple baselines for "Learned Indexes"☆161Jan 13, 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.
- Persistent Adaptive Radix Tree (PART) for JavaScript☆13Jan 19, 2018Updated 8 years ago
- Fast in-place radix sort with STL-like API☆48Dec 10, 2016Updated 9 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- Order-preserving key encoder☆127Apr 28, 2020Updated 6 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- ☆10Feb 20, 2021Updated 5 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆86Apr 29, 2022Updated 4 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆17Jun 13, 2020Updated 6 years ago
- A benchmark for sorting algorithms☆61Apr 17, 2021Updated 5 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Jan 8, 2023Updated 3 years ago
- C++ library to parse WARC files☆11Jan 27, 2019Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated last year
- ☆129May 25, 2026Updated 2 months ago
- ZBTree A Hotness-Aware B+-Tree for Persistent Memory☆17May 4, 2024Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- My PhD thesis, provided for your online reading. Learn how to code high-performance string data structures and data management algorithms…☆66Nov 17, 2016Updated 9 years ago