wheatman / BP-TreeLinks
☆15Updated 9 months ago
Alternatives and similar repositories for BP-Tree
Users that are interested in BP-Tree are comparing it to the libraries listed below
Sorting:
- ☆30Updated 3 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆45Updated 4 months ago
- ☆55Updated last year
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 3 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- This is the implementation repository of our FAST'23 paper: FUSEE: A Fully Memory-Disaggregated Key-Value Store.☆60Updated 2 years ago
- A User-Transparent Block Cache Enabling High-Performance Out-of-Core Processing with In-Memory Programs☆74Updated 2 years ago
- A decentralized scalar timestamp scheme☆16Updated 4 years ago
- High Performance Learned Index on Persistent Memory☆48Updated 2 years ago
- DINOMO: An Elastic, Scalable, High-Performance Key-Value Store for Disaggregated Persistent Memory (PVLDB 2022, VLDB 2023)☆37Updated 2 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆89Updated 6 years ago
- Source code for Spitfire: A Three-Tier Buffer Manager for Volatile and Non-Volatile Memory☆39Updated 2 years ago
- This repository contains the source code for our ACM SIGMOD '21 paper (Maximizing Persistent Memory Bandwidth Utilization for OLAP Worklo…☆21Updated 3 years ago
- ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory☆49Updated last year
- This is the implementation repository of our OSDI'23 paper: SMART: A High-Performance Adaptive Radix Tree for Disaggregated Memory.☆64Updated last year
- A high-performance distributed graph database based on RDMA.☆17Updated 3 years ago
- Benchmarking new Optane PMem-based persistent memory range indexes (VLDB 2022)☆21Updated 2 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- EuroSys '24: "Trinity: A Fast Compressed Multi-attribute Data Store"☆19Updated 8 months ago
- Passive Disaggregated Persistent Memory at USENIX ATC 2020.☆51Updated 5 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- MemEC: An Erasure-Coding-Based Distributed In-Memory Key-Value Store☆11Updated 8 years ago
- Code of the paper "Building an Efficient Key-Value Store in a Flexible Address Space", EuroSys '22☆21Updated 7 months ago