faiss

Build, tune, and query FAISS indices for vector similarity search.

97|8|Updated Mar 20, 2026
One-click install
npx skills add https://github.com/peteromallet/megaplan --skill faiss-peteromallet
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: faiss
Source: https://github.com/peteromallet/megaplan/tree/main/megaplan/agent/skills/mlops/vector-databases/faiss
Command: npx skills add https://github.com/peteromallet/megaplan --skill faiss-peteromallet

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

FAISS provides fast, scalable vector similarity search and retrieval for large-scale embedding datasets, enabling real-time retrieval and matching across billions of vectors.

Core Features & Use Cases

  • Performance-optimized index types: Flat (exact), IVF (approximate with clustering), HNSW (graph-based), and PQ variants for memory efficiency.
  • Hardware acceleration: GPU-enabled indices for substantial speedups on large datasets, with CPU fallback.
  • Flexible integration: Rich Python and C++ APIs, with compatibility for downstream pipelines (e.g., embeddings, retrieval, and ranking workloads).

Quick Start

Train an FAISS index on your embeddings and run a nearest-neighbor search.

Frequently Asked Questions about faiss

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I build a vector similarity search index for large-scale embeddings?

To build a vector similarity search index, train a FAISS index on your embedding collections. You can select from multiple index types like Flat, IVF, or HNSW to enable fast nearest-neighbor retrieval across large datasets.

What is the best way to perform real-time nearest-neighbor search on billions of vectors?

Real-time nearest-neighbor search on billions of vectors is achieved using FAISS. It provides performance-optimized index types and approximate search via clustering or graph-based methods to handle massive scale efficiently.

Can I use GPU acceleration for vector search on large embedding collections?

Yes, you can use GPU acceleration for vector search. FAISS supports GPU-enabled indices for substantial speedups on large datasets, with CPU fallback for flexible integration across different hardware environments.

When should I use HNSW vs IVF index types for approximate nearest-neighbor search?

Use IVF for approximate search via clustering and HNSW for graph-based approximate search. FAISS supports both, allowing you to tune and query indices based on your specific latency and memory efficiency requirements.

How do I reduce memory consumption when indexing large-scale embedding datasets?

To reduce memory consumption when indexing large-scale embedding datasets, use PQ variants within FAISS. These provide memory efficiency while maintaining fast, scalable vector similarity search and retrieval capabilities.