schroederdewitt / leapfrog-triejoinLinks
High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
☆23Updated 9 years ago
Alternatives and similar repositories for leapfrog-triejoin
Users that are interested in leapfrog-triejoin are comparing it to the libraries listed below
Sorting:
- Docker Images, installation scripts, and testing & benchmarking suite for Graph Databases☆36Updated 3 years ago
- Implementation of the unary leapfrog join for efficient intersection of sorted sets.☆10Updated 6 years ago
- A C++ library for the analysis of structural dynamic graphs☆27Updated 3 years ago
- Graphs analytics on collections of views!☆37Updated 2 years ago
- Labelled Subgraph Query Benchmark – A lightweight benchmark suite focusing on subgraph matching queries. Note: This is a microbenchmark f…☆36Updated 7 months ago
- ☆27Updated 3 years ago
- ☆39Updated 5 years ago
- C++ driver to evaluate updates and analytics on dynamic structural graphs☆27Updated 3 years ago
- Reference implementations for LDBC Social Network Benchmark's Interactive workload.☆108Updated 11 months ago
- An active graph database.☆17Updated 8 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 7 months ago
- Source code of our implementation of the concurrent RMA☆12Updated 6 years ago
- C++ driver to evaluate updates in dynamic structural graphs☆18Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆90Updated 6 years ago
- Generic driver for LDBC Graphalytics implementation☆86Updated last year
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- ☆20Updated 3 years ago
- A Database System for Research and Fast Prototyping☆112Updated last month
- A graph-based distributed in-memory store that leverages efficient graph exploration to provide highly concurrent and low-latency queries…☆191Updated 3 years ago
- HOT - Height Optimized Trie☆157Updated 7 years ago
- Your worst case is our best case.☆143Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Quickstep project☆44Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆31Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆121Updated 9 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 7 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- The recursive model index, a learned index structure☆228Updated 2 months ago
- Edge-centric Graph Processing System using Streaming Partitions☆82Updated 7 years ago