Alternatives and similar repositories for leapfrog-join

Users that are interested in leapfrog-join are comparing it to the libraries listed below

• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 5 years ago
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆21Updated 9 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 5 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆19Updated 11 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆116Updated 3 months ago
• AutomataLab / Pison
  Scalable Structural Index Constructor for JSON Analytics
  ☆24Updated 8 months ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆44Updated 6 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 7 years ago
• wheatman / Packed-Memory-Array
  ☆18Updated 6 months ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• xiangyuzhi / GraphStorageExp
  ☆11Updated last year
• wuxb45 / wormhole
  Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)
  ☆80Updated 3 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• wuwuz / Vacuum-Filter
  ☆51Updated 7 months ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 4 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 4 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• stanford-ppl / Green-Marl
  A DSL for efficient Graph Analysis
  ☆102Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆16Updated 3 years ago