cwida / rma_concurrentLinks
Source code of our implementation of the concurrent RMA
☆12Updated 6 years ago
Alternatives and similar repositories for rma_concurrent
Users that are interested in rma_concurrent are comparing it to the libraries listed below
Sorting:
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Graphs analytics on collections of views!☆35Updated last year
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- ☆38Updated 5 years ago
- ☆15Updated 5 years ago
- Quickstep project☆42Updated 7 months ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆48Updated last year
- ☆29Updated 2 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 3 years ago
- Implementation and artifacts for "User-Defined Operators: Efficiently Integrating Custom Algorithms into Modern Databases"☆24Updated last year
- ☆13Updated 4 months ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 3 years ago
- ☆54Updated last year
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated last year
- ☆47Updated last year
- ☆29Updated 5 years ago
- ☆8Updated 4 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- ☆70Updated 3 months ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- ☆12Updated 3 years ago
- Low-Latency Transaction Scheduling via Userspace Interrupts: Why Wait or Yield When You Can Preempt? (SIGMOD 2025 Best Paper Award)☆56Updated last month
- A Memory-efficient Graph Store for Interactive Queries☆13Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 5 years ago