Faster search · facebookresearch/faiss Wiki
To speed up the search, it is possible to segment the dataset into pieces. We define Voronoi cells in the d-dimensional space, and each database vector falls in one of the cells. At search time, only the database vectors y contained in the cell the query x falls in and a few neighboring ones are compared against the query vector.
Faster search · facebookresearch/faiss Wiki · GitHub Skip to content You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert {{ message }} Uh oh! There was an error while loading. Please reload this page . facebookresearch / faiss Public Notifications You must be signed in to change notification settings Fork 4.5k Star 40.6k Faster search Jump to bottom Matthijs Douze edited this page Jun 28, 2020 · 5 rev
Explore this link on the map →related reading
- Faiss: A library for efficient similarity search - Engineering at Metaengineering.fb.com
- Indexing 1T vectors · facebookresearch/faiss Wiki · GitHubgithub.com
- Getting started · facebookresearch/faiss Wiki · GitHubgithub.com
- Welcome to Faiss Documentation - Faiss documentationfaiss.ai
- Faiss indexes · facebookresearch/faiss Wiki · GitHubgithub.com
- Lower memory footprint · facebookresearch/faiss Wiki · GitHubgithub.com
- Guidelines to choose an index · facebookresearch/faiss Wiki · GitHubgithub.com
- GitHub - matsui528/faiss_tips: Some useful tips for faiss · GitHubgithub.com
- GitHub - facebookresearch/faiss: A library for efficient similarity search and clustering of dense vectors. · GitHubgithub.com
- Hierarchical Navigable Small Worlds (HNSW) | Pineconepinecone.io
- Introduction to Facebook AI Similarity Search (Faiss) | Pineconepinecone.io
- Building a web search engine from scratch in two months with 3 billion neural embeddingsblog.wilsonl.in