Alternatives and similar repositories for DSTAlgoEvaluation:

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

• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 3 years ago
• xvz / graph-processing
  Comparison of graph processing systems.
  ☆23Updated 7 years ago
• plofgren / bidirectional-random-walk
  Random Walk (Personalized PageRank) Algorithms for Large Graphs
  ☆73Updated 9 years ago
• jinw18 / Readings_MLDB
  Paper list about adopting machine learning techniques into data management tasks.
  ☆37Updated 4 years ago
• xgfs / deepwalk-c
  DeepWalk implementation in C++
  ☆99Updated 10 months ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆23Updated 7 years ago
• qcri / Arabesque
  Scalable Graph Mining
  ☆61Updated 2 years ago
• BigDataAnalyticsGroup / GENE
  Code used for VLDB paper "The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures"
  ☆10Updated 2 years ago
• TsinghuaDatabaseGroup / Dima
  simialrity join or search on spark core directly
  ☆27Updated 4 years ago
• sfu-db / BOExplain
  Explaining Inference Queries with Bayesian Optimization
  ☆10Updated 4 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆65Updated 2 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆24Updated 9 years ago
• parimarjan / db-embedding-tools
  blah
  ☆35Updated 5 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 4 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆82Updated 3 months ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆12Updated 4 years ago
• TsinghuaDatabaseGroup / Similarity-Search-and-Join
  similarity join and search algorithms for edit distance and jaccard
  ☆18Updated 7 years ago
• DBAIWangGroup / nns_benchmark
  Benchmark of Nearest Neighbor Search on High Dimensional Data
  ☆207Updated 3 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• HazyResearch / dimmwitted
  ☆10Updated 9 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 4 years ago
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• pkumod / GraphSetIntersection
  Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…
  ☆28Updated 6 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 5 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 5 years ago
• InitialDLab / XDB
  An approXimate DB that supports online aggregation queries
  ☆60Updated 11 months ago