AntonioL / leapfrog-join
Implementation of the unary leapfrog join for efficient intersection of sorted sets.
☆9Updated 5 years ago
Alternatives and similar repositories for leapfrog-join:
Users that are interested in leapfrog-join are comparing it to the libraries listed below
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A C++ library for the analysis of structural dynamic graphs☆26Updated 2 years ago
- A simple implementation of the packed memory array☆18Updated 11 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- Parallel Balanced Binary Tree Structures☆113Updated this week
- Template Vector Library☆18Updated 3 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 4 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆25Updated 3 years ago
- ☆21Updated 3 years ago
- A NUMA-aware Graph-structured Analytics Framework☆42Updated 6 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆108Updated last month
- ☆37Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- ☆80Updated 7 years ago
- Packed Memory Array☆17Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Quickstep project☆42Updated 3 months ago
- Master's thesis project involving label-constrained reachability (LCR)Updated 3 years ago
- Graphs analytics on collections of views!☆34Updated last year
- ☆16Updated 2 months ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- The Cicada engine☆55Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- A DSL for efficient Graph Analysis☆100Updated 6 years ago