DominikHorn / hashing-benchmarkLinks
benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
☆16Updated 2 years ago
Alternatives and similar repositories for hashing-benchmark
Users that are interested in hashing-benchmark are comparing it to the libraries listed below
Sorting:
- Updatable Learned Index with Precise Positions☆62Updated 3 years ago
- ☆42Updated 4 years ago
- A Recursive Spatial Model Index☆39Updated last year
- Implementation of BTree part for paper 'The Case for Learned Index Structures'☆149Updated 6 years ago
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆53Updated 3 years ago
- ☆47Updated 2 years ago
- Cardinality Estimation Benchmark☆83Updated 2 years ago
- A Benchmark for Learned Indexes☆293Updated 3 years ago
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆21Updated 2 years ago
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆34Updated 3 years ago
- A Multicore, NUMA Optimised Data Stream Processing System☆39Updated 2 years ago
- a fully learned index for larger-than-memory databases☆15Updated 3 years ago
- Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"☆12Updated 3 years ago
- Code and workloads from the Learned Cardinalities paper (https://arxiv.org/abs/1809.00677)☆126Updated 6 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- A Learned Index for Log-Structured Merge Trees☆47Updated 2 years ago
- A new cardinality estimation scheme for join query estimation☆43Updated 11 months ago
- ☆23Updated 3 years ago
- The recursive model index, a learned index structure☆228Updated last month
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆20Updated last year
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A C++11 implementation of the B-Tree part of "The Case for Learned Index Structures"☆81Updated 7 years ago
- Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory☆110Updated last year
- A prototype implementation of Bao for PostgreSQL☆216Updated last year
- Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases☆22Updated 2 years ago
- Query-based Workload Forecasting for Self-Driving DBMS☆103Updated 3 years ago
- Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"☆21Updated 4 years ago
- FITing Tree is an indexing data structure that efficiently uses the memory without sacrificing the performance. For the paper: https://dl…☆12Updated 4 years ago
- Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory☆39Updated 2 years ago