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
  ☆26Updated 2 years ago
• reddragon / packed-memory-array
  A simple implementation of the packed memory array
  ☆19Updated 11 years ago
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 4 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆53Updated 10 months ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• schroederdewitt / leapfrog-triejoin
  High-performance (C++) implementation of the leapfrog-triejoin algorithm by Todd Veldhuizen (http://arxiv.org/abs/1210.0481)
  ☆20Updated 9 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆29Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 10 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 5 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 9 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 6 months ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• realstolz / polymer
  A NUMA-aware Graph-structured Analytics Framework
  ☆42Updated 6 years ago
• stanford-mast / Grazelle-PPoPP18
  Artifact for PPoPP 2018 paper "Making Pull-Based Graph Processing Performant"
  ☆23Updated 4 years ago
• dmargo / sheep
  A scalable distributed graph partitioner. Ongoing research.
  ☆15Updated 7 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 4 years ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆18Updated 5 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• jarulraj / n-store
  NVM Evaluation Testbed
  ☆29Updated 6 years ago
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆109Updated 2 months ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆13Updated 5 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
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆114Updated last week