Skip to main content
LangChain offers is an in-memory, ephemeral vectorstore that stores embeddings in-memory and does an exact, linear search for the most similar embeddings. The default similarity metric is cosine similarity, but can be changed to any of the similarity metrics supported by ml-distance. As it is intended for demos, it does not yet support ids or deletion. This guide provides a quick overview for getting started with MemoryVectorStore vector stores.

Overview

Integration details

Setup

To use in-memory vector stores, you’ll need to install the langchain package: This guide will also use OpenAI embeddings, which require you to install the @langchain/openai integration package. You can also use other supported embeddings models if you wish.

Credentials

There are no required credentials to use in-memory vector stores. If you are using OpenAI embeddings for this guide, you’ll need to set your OpenAI key as well:
If you want to get automated tracing of your model calls you can also set your LangSmith API key by uncommenting below:

Instantiation

Manage vector store

Add items to vector store

Query vector store

Once your vector store has been created and the relevant documents have been added you will most likely wish to query it during the running of your chain or agent.

Query directly

Performing a simple similarity search can be done as follows:
The filter is optional, and must be a predicate function that takes a document as input, and returns true or false depending on whether the document should be returned. If you want to execute a similarity search and receive the corresponding scores you can run:

Query by turning into retriever

You can also transform the vector store into a retriever for easier usage in your chains:

Maximal marginal relevance

This vector store also supports maximal marginal relevance (MMR), a technique that first fetches a larger number of results (given by searchKwargs.fetchK), with classic similarity search, then reranks for diversity and returns the top k results. This helps guard against redundant information:

Usage for retrieval-augmented generation

For guides on how to use this vector store for retrieval-augmented generation (RAG), see the following sections: