Skip to main content
Pinecone is a vector database built for single-embedding KNN search. Mixpeek is a multimodal data warehouse that decomposes files into searchable features, stores them across cost tiers, and reassembles answers through multi-stage retrieval pipelines. This guide walks you through migrating your search workload from Pinecone to Mixpeek.

Why Migrate

Pinecone stores and queries individual vectors. Mixpeek processes raw files end-to-end: extracting features, storing documents across tiered storage, and executing multi-stage retrieval pipelines. You stop managing embeddings and start working with content.

Concept Mapping

Migration Steps

1

Create a Namespace

Set up a namespace to hold your data. This replaces your Pinecone index.
2

Create a Collection with Feature Extractors

Define what features to extract from your data. This replaces the external embedding step you had with Pinecone.
3

Re-ingest Your Data Through the Pipeline

Upload your source files to a bucket and let the collection process them. Do not try to import your existing Pinecone vectors directly. Mixpeek extracts richer, multi-modal features from your raw content.
Never insert vectors directly into the storage layer. All data must flow through the ingestion pipeline: bucket upload, collection trigger, feature extraction. This ensures proper lineage, validation, and multi-modal indexing.
4

Create a Retriever with Multi-Stage Pipelines

Build a retriever that goes beyond single-vector KNN. Chain semantic search with filters, reranking, and enrichment.
5

Test and Verify

Execute your retriever and compare results against your Pinecone baseline.

Side-by-Side Comparison

The Mixpeek retriever does in one API call what requires multiple steps with Pinecone: embedding generation, vector search, and post-processing.

What You Gain

Next Steps

Quickstart

Get Mixpeek running in 10 minutes

Feature Extractors

Learn about automatic feature extraction

Retrievers

Build multi-stage retrieval pipelines

Core Concepts

Understand the data model