Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
☆33May 31, 2021Updated 4 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
Sorting:
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆13Nov 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
- k-means++: a C++ version implement☆18Dec 26, 2017Updated 8 years ago
- ☆15Feb 19, 2017Updated 9 years ago
- A read-optimized learned index for unsorted data☆32Aug 10, 2023Updated 2 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
- An encoder/decoder collection for a sequence of integers☆32Mar 10, 2013Updated 13 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
- Post-Quantum zkVM☆62Mar 5, 2026Updated 2 weeks ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Dec 16, 2019Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- bit & sketches data structures☆60Nov 2, 2018Updated 7 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆13Mar 31, 2022Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Apr 5, 2023Updated 2 years ago
- CLI utilty to work out proper constants for vpternlogic instruction☆13Jan 22, 2023Updated 3 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆15Jun 28, 2022Updated 3 years ago
- Fast in-place radix sort with STL-like API☆49Dec 10, 2016Updated 9 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆85Apr 29, 2022Updated 3 years ago
- ☆48Jun 10, 2023Updated 2 years ago
- Persistent Memory Tool Box☆12Mar 4, 2024Updated 2 years ago
- Order-preserving key encoder☆127Apr 28, 2020Updated 5 years ago
- Persistent Adaptive Radix Tree (PART) for JavaScript☆13Jan 19, 2018Updated 8 years ago
- A collection of code investigating the use of information theory for abstractions in RL☆16Nov 14, 2018Updated 7 years ago
- ☆10Feb 20, 2021Updated 5 years ago
- ☆10Feb 23, 2024Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Jan 3, 2024Updated 2 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Sep 4, 2024Updated last year
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆23Feb 20, 2016Updated 10 years ago
- VecHT: A High-Performance Hash Table Optimized for Batch Lookups☆16Jul 1, 2024Updated last year
- 机器学习项目集☆15Feb 16, 2020Updated 6 years ago
- A benchmark for sorting algorithms☆63Apr 17, 2021Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- My PhD thesis, provided for your online reading. Learn how to code high-performance string data structures and data management algorithms…☆67Nov 17, 2016Updated 9 years ago
- [SIGMOD’24] Source code for the paper: Making In-Memory Learned Indexes Efficient on Disk☆13Jun 28, 2024Updated last year
- Quickstep Project☆27Mar 26, 2019Updated 6 years ago
- ☆16Jan 24, 2025Updated last year
- ☆126Apr 8, 2022Updated 3 years ago