Alternatives and similar repositories for tinyknn

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

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• technicolor-research / quick-adc
  Quick ADC
  ☆25Updated 6 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆40Updated 6 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆121Updated 2 weeks 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
• ThirdAIResearch / Dessert
  DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables
  ☆16Updated last year
• 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
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆148Updated this week
• BlaiseMuhirwa / flatnav
  A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net
  ☆27Updated last month
• jermp / autocomplete
  Efficient and effective query auto-completion in C++.
  ☆54Updated last year
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆58Updated 3 years ago
• WPJiang / HWTL_SDU-ANNS
  ☆73Updated 5 months ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• HuangQiang / BC-Tree
  BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)
  ☆19Updated last year
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• Shekhale / gbnns_dim_red
  Reducing Dimensionality method for Nearest Neighbor Search
  ☆15Updated 4 years ago
• zilliztech / starling
  ☆65Updated 9 months ago
• technicolor-research / pq-fast-scan
  PQ Fast Scan
  ☆62Updated 6 years ago
• andrusha97 / online-hnsw
  Implementation of HNSW that supports online updates
  ☆66Updated 7 years ago
• pisa-engine / BMP
  Faster Learned Sparse Retrieval with Block-Max Pruning. ACM SIGIR 2024.
  ☆29Updated last month
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• gaurav16gupta / BLISS
  Large Scale Search Index
  ☆31Updated 2 years ago
• anikristo / LearnedSort
  Learned Sort: a model-enhanced sorting algorithm
  ☆81Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• intel / ScalableVectorSearch
  ☆167Updated this week
• 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
• HuangQiang / QALSH
  Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)
  ☆29Updated 3 years ago
• dbaranchuk / nns-meets-deep-rl
  Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning
  ☆21Updated 5 years ago