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☆13Nov 26, 2023Updated 2 years ago
- Official code of "PLEX: Towards Practical Learned Indexing", aka TrieSpline (AIDB @VLDB'21)☆16Jun 30, 2022Updated 4 years ago
- ☆16Feb 19, 2017Updated 9 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.
- k-means++: a C++ version implement☆19Dec 26, 2017Updated 8 years ago
- [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…