Scalable Hashing on Persistent Memory
-
Updated
Apr 16, 2024 - C++
Scalable Hashing on Persistent Memory
Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
Benchmarking framework for index structures on persistent memory
High Performance Learned Index on Persistent Memory
Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)
PH-Tree C++ implementation
DEX: Scalable Range Indexing on Disaggregated Memory
Blink-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases
A monolithic index that supports worst-case optimal joins (WCOJ) by providing all collation orders in a single redundancy eliminating datastructure.
Benchmark for Sampling Applied Learned Indexes (SIGMOD '24)
Standalone tool and library allowing to work with barcoded linked-reads
B+ tree implementation in C++ for NTU's CZ4031 course of Database Systems Principles. Supports duplicate keys.
Contains the source code of the paper "Scalable Distributed Inverted List Indexes in Disaggregated Memory" published at SIGMOD'24.
C++17 Implementation of Dynamic Filter Trie
RLZAP: Relative Lempel-Ziv with Adaptive Pointers
C++ template class for indexed map.
Add a description, image, and links to the index topic page so that developers can more easily learn about it.
To associate your repository with the index topic, visit your repo's landing page and select "manage topics."