AntonioL / leapfrog-joinLinks
Implementation of the unary leapfrog join for efficient intersection of sorted sets.
☆10Updated 6 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☆122Updated 10 months ago
- ☆39Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 6 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆117Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆33Updated 4 years ago
- ☆53Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 4 years ago
- A simple implementation of the packed memory array☆20Updated 12 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Graphs analytics on collections of views!☆37Updated 2 years ago
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆23Updated 9 years ago
- High-performance multicore-scalable data structures and benchmarks☆144Updated 6 years ago
- ☆57Updated last year
- LLAMA Graph Analytics Engine☆42Updated 8 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Library for lock-free locks☆83Updated 2 years ago
- ☆30Updated 6 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆288Updated 5 months ago
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 7 years ago
- ☆81Updated 8 years ago
- A DSL for efficient Graph Analysis☆103Updated 7 years ago
- LSM-trie☆114Updated 4 years ago