Alternatives and similar repositories for DPC

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

• syhlalala / PAM-AE
  ☆9Updated 6 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
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆22Updated 7 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆34Updated 3 months ago
• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆19Updated last year
• wheatman / BP-Tree
  ☆13Updated 4 months ago
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆14Updated 2 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆1Updated 4 years ago
• tum-db / partitioned-filters
  A four-dimensional Analysis of Partitioned Approximate Filters
  ☆10Updated 2 years ago
• wheatman / Packed-Memory-Array
  ☆17Updated 5 months ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• HuangQiang / LCCS-LSH
  LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)
  ☆15Updated 3 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 3 years ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 5 months ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 8 months ago
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆22Updated 10 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆211Updated 5 months ago
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated 3 weeks ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆27Updated 2 months ago
• Jacyhust / DB-LSH
  The source code for DB-LSH (ICDE 2022)
  ☆10Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• csypeng / LAN
  Learning-based Approximate k-NN Search in Graph Databases
  ☆11Updated 3 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…
  ☆30Updated 6 years ago
• LijunChang / MC-BRB
  Maximum clique computation over large sparse graphs
  ☆19Updated 3 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago