Alternatives and similar repositories for leapfrog-triejoin

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

• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• ldbc / lsqb
  Labelled Subgraph Query Benchmark – A lightweight benchmark suite focusing on subgraph matching queries. Note: This is a microbenchmark f…
  ☆33Updated last month
• graphflow / graphflow-columnar-techniques
  ☆26Updated 3 years ago
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆35Updated last year
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆10Updated 5 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• cwida / gfe_driver
  C++ driver to evaluate updates in dynamic structural graphs
  ☆16Updated 3 years ago
• kuzeko / graph-databases-testsuite
  Docker Images, installation scripts, and testing & benchmarking suite for Graph Databases
  ☆37Updated 3 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆137Updated 8 years ago
• ldbc / ldbc_snb_bi
  Reference implementations for the LDBC Social Network Benchmark's Business Intelligence (BI) workload
  ☆43Updated 2 months ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆32Updated 2 months ago
• cwida / rma_concurrent
  Source code of our implementation of the concurrent RMA
  ☆12Updated 6 years ago
• mutable-org / mutable
  A Database System for Research and Fast Prototyping
  ☆104Updated last month
• 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
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• evanj / tpccbench
  In memory TPC-C implementation. Used for a number of database research projects.
  ☆38Updated 4 years ago
• colinsongf / graphflow
  An active graph database.
  ☆17Updated 8 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆88Updated 6 years ago
• jungmair / START
  Self-Tuning Adaptive Radix Tree
  ☆27Updated 5 years ago
• gvinciguerra / Learned-indexes-effectiveness
  Code for the TCS paper "On the performance of learned data structures" and the ICML paper "Why are learned indexes so effective?"
  ☆19Updated 4 years ago
• viktorleis / vmcache
  ☆70Updated 3 months ago
• mitdbg / deneva
  Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.
  ☆115Updated 2 years ago
• 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
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• aplf / sdk2tree
  Code used in the paper "On dynamic succinct graph representations".
  ☆11Updated 3 years ago
• dsg-uwaterloo / s-graffito
  ☆11Updated 8 months ago
• amplab / zipg
  A Memory-efficient Graph Store for Interactive Queries
  ☆13Updated 3 years ago