Alternatives and similar repositories for FastJoin

Users that are interested in FastJoin are comparing it to the libraries listed below

• CGCL-codes / Simois
  Simois is a scalable distributed stream join system, which supports efficient join operations in two streams with highly skewed data dist…
  ☆13Updated 3 years ago
• Xtra-Computing / briskstream
  A Multicore, NUMA Optimised Data Stream Processing System
  ☆40Updated 3 years ago
• the-data-lab / GraphOne
  "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19
  ☆60Updated 4 years ago
• intellistream / AllianceDB
  ☆16Updated 9 months ago
• cwida / teseo
  A C++ library for the analysis of structural dynamic graphs
  ☆27Updated 3 years ago
• efficient / rocksdb
  A library that provides an embeddable, persistent key-value store for fast storage.
  ☆38Updated 7 years ago
• CGCL-codes / BCF
  Better Choice Cuckoo Filter (BCF) is an efficient approximate set representation data structure. Different from the standard Cuckoo Filte…
  ☆12Updated 6 years ago
• Erins-Ransom / Proteus
  This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.
  ☆14Updated 2 years ago
• InitialDLab / XDB
  An approXimate DB that supports online aggregation queries
  ☆60Updated last year
• fzhedu / db-imv
  Reducing the cache misses of SIMD vectorization using IMV
  ☆29Updated 3 years ago
• BigDataAnalyticsGroup / analysis-rmi
  Code for our VLDB paper: A Critical Analysis of Recursive Model Indexes
  ☆20Updated last year
• cwida / rma
  Sequential implementation of the Rewired Memory Array.
  ☆19Updated 6 years ago
• sfu-dis / pibench
  Benchmarking framework for index structures on persistent memory
  ☆89Updated 2 years ago
• CGCL-codes / DCF
  Dynamic Cuckoo Filter (DCF) is succinct data structure of approximate set representing and membership testing for large-scale dynamic dat…
  ☆39Updated 8 years ago
• dsg-uwaterloo / s-graffito
  ☆13Updated last year
• epfl-dias / proteus
  Proteus is a database engine (research prototype) designed for today's heterogeneous environments. Proteus adapts to variable data, hardw…
  ☆26Updated 2 years ago
• peterboncz / bloomfilter-repro
  ☆30Updated 6 years ago
• cwida / public_bi_benchmark
  BI benchmark with user generated data and queries
  ☆72Updated last year
• dsg-uwaterloo / graphsurge
  Graphs analytics on collections of views!
  ☆37Updated 2 years ago
• yingjunwu / IndexZoo
  Benchmarking In-Memory Index Structures
  ☆26Updated 6 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
  ☆33Updated 7 months ago
• UWHustle / HATtrick
  ☆35Updated 3 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆27Updated 3 years ago
• hpides / autovec-db
  Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"
  ☆15Updated 2 years ago
• carolinux / adaptive_range_filters
  ☆19Updated 9 years ago
• yangjufo / Learned-Indexes
  Implementation of BTree part for paper 'The Case for Learned Index Structures'
  ☆149Updated 7 years ago
• daseECNU / Ginkgo
  ☆27Updated 4 years ago
• learnedsystems / SOSD
  A Benchmark for Learned Indexes
  ☆296Updated 3 years ago
• psiul / ICDE2019-GPU-Join
  Implementation of the algorithm described in "Hardware-conscious Hash-Joins on GPUs" paper presented in ICDE 2019
  ☆34Updated 5 years ago
• mikeheddes / fast-multi-join-sketch
  Fast Cardinality Estimation of Multi-Join Queries Using Sketches
  ☆16Updated last year