DominikHorn / hashing-benchmark
benchmark driver for "Can Learned Models Replace Hash Functions?" VLDB submission
☆16Updated last year
Alternatives and similar repositories for hashing-benchmark:
Users that are interested in hashing-benchmark are comparing it to the libraries listed below
- A read-optimized learned index for unsorted data☆31Updated last year
- Updatable Learned Index with Precise Positions☆55Updated 3 years ago
- High Performance Learned Index on Persistent Memory☆47Updated last year
- GRE is a benchmark suite to compare learned indexes and traditional indexes.☆47Updated 2 years ago
- FINEdex: A Fine-grained Learned Index Scheme for Scalable and Concurrent Memory Systems☆32Updated 2 years ago
- ☆39Updated last year
- [VLDB 2022] NFL: Robust Learned Index via Distribution Transformation☆19Updated last year
- A Learned Index for Log-Structured Merge Trees☆45Updated last year
- Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases☆21Updated last year
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- ☆39Updated 3 years ago
- Cardinality Estimation Benchmark☆76Updated last year
- A Recursive Spatial Model Index☆38Updated last year
- LB+-Tree implementation☆47Updated 3 years ago
- a fully learned index for larger-than-memory databases☆13Updated 2 years ago
- ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems☆74Updated last year
- Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes☆17Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated last year
- ☆10Updated 9 months ago
- This is for SIGMOD submission "Learning-based Progressive Cardinality Estimation for End-to-end Query Execution"☆18Updated 2 years ago
- ☆59Updated last year
- A new cardinality estimation scheme for join query estimation☆34Updated 3 months ago
- ☆15Updated last year
- Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory☆105Updated 5 months ago
- ☆70Updated 2 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆33Updated last month
- ☆63Updated this week
- ☆19Updated 2 years ago
- Pacman: An Efficient Compaction Approach for Log-Structured Key-Value Store on Persistent Memory☆43Updated 2 years ago