cwida / rmaLinks
Sequential implementation of the Rewired Memory Array.
☆19Updated 6 years ago
Alternatives and similar repositories for rma
Users that are interested in rma are comparing it to the libraries listed below
Sorting:
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- ☆149Updated 2 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆124Updated 3 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- ☆30Updated 6 years ago
- Benchmarking framework for index structures on persistent memory☆89Updated 2 years ago
- A transactional main-memory database system on multicores☆104Updated 7 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- An open-source BzTree implementation☆92Updated 4 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- ☆15Updated 8 years ago
- A Benchmark for Learned Indexes☆293Updated 3 years ago
- The Art of Latency Hiding in Modern Database Engines (VLDB 2024)☆61Updated 6 months ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Graphs analytics on collections of views!☆36Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆55Updated last year
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- ☆38Updated 5 years ago
- ☆74Updated 2 months ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Collection of experiments to carve out the differences between two types of relational query processing engines: Vectorizing (interpretat…☆264Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- RECIPE : high-performance, concurrent indexes for persistent memory (SOSP 2019)☆194Updated last year
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆23Updated 6 months ago
- Scalable Hashing on Persistent Memory☆193Updated last year
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆117Updated 2 years ago