AntonioL / leapfrog-joinLinks
Implementation of the unary leapfrog join for efficient intersection of sorted sets.
☆10Updated 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
Sorting:
- Parallel Balanced Binary Tree Structures☆118Updated 5 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 6 years ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- ☆38Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 8 months ago
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆22Updated 9 years ago
- A NUMA-aware Graph-structured Analytics Framework☆44Updated 7 years ago
- A DSL for efficient Graph Analysis☆102Updated 7 years ago
- Graphs analytics on collections of views!☆35Updated last year
- ☆21Updated 4 years ago
- ☆52Updated 9 months ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Template Vector Library☆17Updated 4 years ago
- ☆82Updated 7 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆81Updated 3 years ago
- Packed Memory Array☆17Updated 11 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆28Updated 5 years ago
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- ☆28Updated 4 months ago
- ☆25Updated 4 years ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago