AntonioL / leapfrog-join
Implementation of the unary leapfrog join for efficient intersection of sorted sets.
☆9Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for leapfrog-join
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆23Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- ☆37Updated 4 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- The Cicada engine☆56Updated 7 years ago
- k2tree implementation☆10Updated 8 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆85Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆111Updated 2 weeks ago
- NVM Evaluation Testbed☆28Updated 6 years ago
- Quickstep project☆40Updated 2 weeks ago
- Persistent Memory Graph Database☆43Updated last year
- ☆79Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- ☆52Updated 6 months ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 8 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36Updated 3 years ago
- ☆50Updated 5 years ago
- ☆21Updated last year
- ☆20Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- A simple implementation of the packed memory array☆17Updated 11 years ago