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
• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆15Updated last year
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆18Updated 4 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 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 9 years ago
• wangyiqiu / pargeo
  A Collection of Parallel Algorithms for Computational Geometry
  ☆12Updated 2 years ago
• wheatman / BP-Tree
  ☆14Updated last week
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆48Updated last week
• Jacyhust / LSH-APG
  This is a source code for LSH-APG (PVLDB 2023)
  ☆27Updated 5 months ago
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆64Updated 3 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  Updated 3 years ago
• jalvarm / hcnng
  This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs
  ☆17Updated 4 years ago
• wheatman / Packed-Memory-Array
  ☆15Updated last month
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• naivewong / timeunion
  ☆13Updated 2 years ago
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 4 years ago
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆14Updated 2 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• HuangQiang / lccs-lsh
  LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)
  ☆14Updated 3 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆23Updated 2 months ago
• csypeng / LAN
  Learning-based Approximate k-NN Search in Graph Databases
  ☆10Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆67Updated 2 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.
  ☆12Updated last year
• zilliztech / starling
  ☆50Updated 4 months ago
• ryanrossi / pmc
  Parallel Maximum Clique Library
  ☆113Updated last year
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 3 years ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated last month
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago