Hacker GitHub

← All repos

erikbern/ann-benchmarks

View on GitHub ↗ ★ 5,746 Python

Benchmarks of approximate nearest neighbor libraries in Python

20 mentions on Hacker News by 17 people: 4 stories, 16 comments · first 2015-08-27 · latest 2025-06-10

Mentions per year 20 mentions · busiest year 2023 (7)
20082026
AllStoriesComments NewestTopOldest
  1. …new index is 10x smaller than pgvector HNSW. We don't have numbers for HNSWPQ in FAISS yet. [0]: https://github.com/erikbern/ann-benchmarks/
    comment by avthar · 2023-09-26 · in How We Made PostgreSQL a Better Vector Database
  2. Here you go :) https://github.com/erikbern/ann-benchmarks/pull/451
    comment by ashvardanian · 2023-08-01 · in USearch: Smaller and faster single-file vector search engine
  3. Try the original data source https://github.com/erikbern/ann-benchmarks
    comment by KRAKRISMOTT · 2023-07-31 · in Which vector database should I use? A comparison cheatsheet
  4. …gluing together a few random open source extensions is not great for developer experience. [0] https://github.com/erikbern/ann-benchmarks
    comment by KRAKRISMOTT · 2023-07-12 · in 20x faster than pgvector: HNSW index in Postgres with pg_embedding
  5. Check out https://github.com/erikbern/ann-benchmarks for some benchmarks on some of the different ANN libraries out there. I'd be interested in hearing other's experiences using these libraries in production.
    comment by ntonozzi · 2023-03-30 · in Faiss: A library for efficient similarity search
  6. …at a different company [1] https://web.archive.org/web/20210227105542/https://www.pinec... [2] https://github.com/erikbern/ann-benchmarks
    comment by pbadams · 2022-08-16 · in Vector search just got up to 10x faster and vertically scalable
  7. This site keeps track of them: https://github.com/erikbern/ann-benchmarks#glove-100-angular ScaNN is currently SOTA: https://ai.googleblog.com/2020/07/announcing-scann-efficient...
    comment by cgreerrun · 2021-06-24 · in Introduction to Locality-Sensitive Hashing
  8. …[3] if you want to play with LSH, python "annoy" library is the best place to start [4] [0] https://github.com/erikbern/ann-benchmarks [1] https://github.com/google-research/google-research/tree/mast... [2]…
    comment by andyxor · 2021-06-24 · in Introduction to Locality-Sensitive Hashing
  9. Erik Bernhardsson who was one of original author on Annoy has a pretty developed test suite https://github.com/erikbern/ann-benchmarks .
    comment by chuckcode · 2021-03-03 · in Show HN: NNext.net – A Firebase-like managed vector storage for ML applications
  10. This is great. This is already better that FLANN (by facebook), Annoy (by spotify). https://github.com/erikbern/ann-benchmarks#evaluated Still, We are very far away from creating reverse video search engine. Also, Most of these techniques…
    comment by Immortal333 · 2020-07-30 · in ScaNN: Efficient Vector Similarity Search
  11. how does it compare to state-of-the art? ( https://github.com/erikbern/ann-benchmarks )
    comment by bra-ket · 2020-01-10 · in Milvus – An Open-Source Vector Similarity Search Engine
  12. …nsmlib is a great alternative to faiss that can be faster in some applications, as shown here: https://github.com/erikbern/ann-benchmarks
    comment by cs702 · 2019-11-06 · in The Most Underrated Python Packages
  13. Good press release title. Now just add it to the pile ;) https://github.com/erikbern/ann-benchmarks
    comment by anewhnaccount2 · 2019-05-16 · in Microsoft makes AI tool for better search available as an open source project
  14. …vector search: http://radimrehurek.com/2013/12/performance-shootout-of-near... and also the updated https://github.com/erikbern/ann-benchmarks . In particular, for something good AND open source: - Leonid Boytsov's NMSLIB [1] - Erik…
    comment by Radim · 2018-02-11 · in Using k-d trees to efficiently calculate nearest neighbors in 3D vector space
  15. …functions). - Use an Approximate Nearest Neighbors approach like one of the ones benchmarked here ( https://github.com/erikbern/ann-benchmarks ). These can be much faster than exhaustively computing neighbors, at the cost of some accuracy…
    comment by kleebeesh · 2017-11-17 · in Ask HN: Vector-space database (as a service)?
  16. …retrieval. This may be a bad idea. That implementation seems to perform very poorly: [benchmarks]( https://github.com/erikbern/ann-benchmarks/pull/5#issuecomme... ) As is often the case, simpler algorithms have fewer moving parts, and due…
    comment by Radim · 2015-08-27 · in A Word Is Worth a Thousand Vectors