Alternatives and similar repositories for gbtl-python-bindings:

Users that are interested in gbtl-python-bindings are comparing it to the libraries listed below

• IBM / ibmgraphblas
  ibmgraphblas
  ☆27Updated 6 years ago
• uwescience / raco
  Compilation and rule-based optimization framework for relational algebra. Raco is the language, optimization, and query translation layer…
  ☆72Updated 6 years ago
• IntelLabs / pmgd
  Persistent Memory Graph Database
  ☆44Updated 2 years ago
• dhutchis / LaraDB
  A platform for unified linear and relational algebra analytics, built on the Accumulo NoSQL database
  ☆11Updated 2 years ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆35Updated 10 years ago
• epfl-labos / wren
  Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store
  ☆8Updated 6 years ago
• frankmcsherry / dataflow-join
  An implementation of Ngo et al's GenericJoin in timely dataflow.
  ☆87Updated 5 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 6 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• PerFuchs / gfe_driver
  C++ driver to evaluate updates and analytics on dynamic structural graphs
  ☆25Updated 2 years ago
• graindb / graindb
  ☆19Updated 3 years ago
• s-store / s-store
  S-Store Transactional Streaming Data Management System
  ☆22Updated 4 years ago
• ldbc / lsqb
  Labelled Subgraph Query Benchmark – A lightweight benchmark suite focusing on subgraph matching queries. Note: This is a microbenchmark f…
  ☆27Updated 2 weeks ago
• stanford-futuredata / msketch
  Moments Sketch Code
  ☆40Updated 6 years ago
• mfs409 / nonblocking
  Nonblocking data structures
  ☆12Updated 9 years ago
• efficient / msls-eval
  Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs
  ☆10Updated 8 years ago
• rapidsai / cuhornet
  ☆24Updated last year
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆139Updated 7 years ago
• ucbrise / fluent-old
  Bloom + C++
  ☆17Updated 7 years ago
• camsas / Musketeer
  The Musketeer workflow manager.
  ☆41Updated 6 years ago
• pschanely / scoredb
  A simple database optimized for returning results by custom scoring functions.
  ☆20Updated 8 years ago
• jrbn / vlog
  VLog is a high-performance Datalog engine. It is highly memory efficient and can process large programs with thousands of rules.
  ☆17Updated 6 years ago
• gh-rdf3x / gh-rdf3x
  Extension of the rdf3x engine and the translatesparql tool.
  ☆46Updated 11 years ago
• LouisJenkinsCS / Distributed-Data-Structures
  [GSoC] Distributed Data Structures - Collections Framework for Chapel language
  ☆15Updated 7 years ago
• dncc / qpick
  Search for similar short strings
  ☆53Updated 4 years ago
• sslab-gatech / mosaic
  ☆80Updated 7 years ago
• fzqneo / ByteSlice
  "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)
  ☆25Updated 6 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 8 years ago
• goatdb / llama
  LLAMA Graph Analytics Engine
  ☆41Updated 7 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆85Updated 5 years ago