✳flâneur — a map of the web's best reading
Google AI Blog: Announcing ScaNN: Efficient Vector Similarity Search
ai.googleblog.com · 1,522 words · saved by 2 readers
Posted by Philip Sun, Software Engineer, Google Research Suppose one wants to search through a large dataset of literary works using que...
Announcing ScaNN: Efficient Vector Similarity Search Skip to main content Announcing ScaNN: Efficient Vector Similarity Search July 28, 2020 Posted by Philip Sun, Software Engineer, Google Research Quick links Share Copy link × Suppose one wants to search through a large dataset of literary works using queries that require an exact match of title, author, or other easily machine-indexable criteria. Such a task would be well suited for a relational database using a language such as SQL. However, if one wants to support more abstract queries, such as “Civil War poem,” it is no longer possible to
Explore this link on the map →saved by
related reading
- Faiss: A library for efficient similarity search - Engineering at Metaengineering.fb.com
- TurboQuant: Redefining AI efficiency with extreme compressionresearch.google
- Welcome to Faiss Documentation - Faiss documentationfaiss.ai
- TurboQuant: Redefining AI efficiency with extreme compressionresearch.google
- HNSWlib vs ScaNN on Vector Search - Zilliz blogzilliz.com
- Building a web search engine from scratch in two months with 3 billion neural embeddingsblog.wilsonl.in
- [2504.19874] TurboQuant: Online Vector Quantization with Near-optimal Distortion Ratearxiv.org
- Semantic Search - Sentence Transformers documentationsbert.net
- Product Quantization: Compressing high-dimensional vectors by 97% | Pineconepinecone.io
- How We Store and Search 30 Billion Facesclearview.ai
- Indexing 1T vectors · facebookresearch/faiss Wiki · GitHubgithub.com
- Not All Vector Databases Are Made Equal | Towards Data Sciencetowardsdatascience.com