Alternatives and similar repositories for P2HNNS

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

• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆28Updated 3 years ago
• HuangQiang / LCCS-LSH
  LSH Scheme based on Longest Circular Co-Substring (SIGMOD 2020)
  ☆15Updated 3 years ago
• HuangQiang / QALSH_Mem
  Query-Aware LSH for Approximate NNS (In-Memory Version of QALSH)
  ☆17Updated 3 years ago
• Shekhale / gbnns_theory
  Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''
  ☆19Updated 4 years ago
• HuangQiang / H2_ALSH
  Accurate and Fast ALSH for Maximum Inner Product Search (KDD 2018)
  ☆25Updated 3 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• HuangQiang / k-FreqItemspp
  Massive Sparse Data Clustering Based on Frequent Items (SIGMOD 2023) (CPU version)
  ☆13Updated last year
• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆19Updated last year
• jalvarm / hcnng
  This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs
  ☆18Updated 5 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• efficient / faiss-learned-termination
  Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"
  ☆54Updated 4 years ago
• Patrick-H-Chen / FINGER
  ☆13Updated last year
• gaoj0017 / ADSampling
  [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations
  ☆54Updated 4 months ago
• CaucherWang / Steiner-hardness
  A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of yo…
  ☆16Updated 3 months ago
• rutgers-db / SeRF
  SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
  ☆33Updated 3 months ago
• Jacyhust / PM-LSH
  The source code for PM-LSH (PVLDB 2020)
  ☆11Updated 6 months ago
• ZJU-DAILY / PSP
  [VLDB 25] Maximum Inner Product is Query-Scaled Nearest Neighbor
  ☆13Updated 2 weeks ago
• JoshEngels / RangeFilteredANN
  Algorithms for approximate nearest neighbor search with window filters
  ☆40Updated last year
• sunbelbd / song
  SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.
  ☆69Updated last month
• Jacyhust / LSH-APG
  This is a source code for LSH-APG (PVLDB 2023)
  ☆30Updated 9 months ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• IntelLabs / VectorSearchDatasets
  ☆24Updated 3 months ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 10 months ago
• Lsyhprum / WEAVESS
  A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search
  ☆71Updated 4 years ago
• Visual-Computing / DynamicExplorationGraph
  Repository related to the Dynamic Exploration Graph and its previous iterations.
  ☆25Updated 2 months ago
• gouyt13 / SymphonyQG
  ☆27Updated 4 months ago
• brc7 / RACEKernels
  RACE sketches for kernel density estimation (KDE)
  ☆14Updated 5 years ago
• csypeng / LAN
  Learning-based Approximate k-NN Search in Graph Databases
  ☆11Updated 3 years ago
• whenever5225 / TOGG
  Two-stage routing with Optimized Guided search and Greedy algorithm
  ☆10Updated last year