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:
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Parallel Balanced Binary Tree Structures☆117Updated 3 months ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- A simple implementation of the packed memory array☆19Updated 11 years ago
- Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"☆23Updated 5 years ago
- ☆38Updated 5 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A DSL for efficient Graph Analysis☆102Updated 6 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Graphs analytics on collections of views!☆35Updated last year
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 6 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆54Updated last year
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- A NUMA-aware Graph-structured Analytics Framework☆44Updated 6 years ago
- LLAMA Graph Analytics Engine☆41Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago
- High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)☆21Updated 9 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆58Updated 4 years ago
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 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 4 years ago
- ☆19Updated 7 months ago
- LiveGraph: a transactional graph storage system with purely sequential adjacency list scans☆55Updated 4 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 2 months ago
- C++ driver to evaluate updates in dynamic structural graphs☆16Updated 3 years ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- An open-source framework for concurrent data-structures and benchmarks. 🛠️ Latest Dev Branch: v3.4.0-dev 🚀 https://github.com/nkallima/…☆68Updated 3 months ago
- GBBS: Graph Based Benchmark Suite☆211Updated 7 months ago