Alternatives and similar repositories for DPC

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

• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆19Updated 2 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…
  ☆29Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆214Updated 3 months ago
• TatsuyaShirakawa / nndescent
  Implementation of Efficient K-NN Graph Construction Algorithm NN-Descent in C++
  ☆30Updated 8 years ago
• wheatman / BP-Tree
  ☆15Updated 9 months ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆89Updated 6 years ago
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆71Updated 6 months ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆25Updated 8 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆26Updated 2 months ago
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆61Updated 9 months ago
• wheatman / Packed-Memory-Array
  ☆25Updated 11 months ago
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆120Updated 7 months ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆76Updated 4 years ago
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆16Updated 3 months ago
• ZJU-DAILY / HNSW-Flash
  Source code for the paper: "Accelerating Graph Indexing for ANNS on Modern CPUs"
  ☆24Updated 2 months ago
• johnpzh / parallel_ANNS
  Parallel Approximate Nearest Neighbor Search
  ☆14Updated 2 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆28Updated 2 years ago
• mtodat / ms-bfs
  Source code for VLDB 2015 paper "The More the Merrier: Efficient Multi-Source Graph Traversal"
  ☆25Updated 10 years ago
• Jacyhust / DB-LSH
  The source code for DB-LSH (ICDE 2022)
  ☆11Updated 3 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 4 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆31Updated last year
• bindscha / x-stream
  Edge-centric Graph Processing System using Streaming Partitions
  ☆82Updated 7 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆25Updated 4 years ago
• larsgottesbueren / gp-ann
  Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"
  ☆25Updated last year
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆36Updated 4 months ago