We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

Comparing vector implementations in generic databases

Formal Metadata

Title
Comparing vector implementations in generic databases
Title of Series
Number of Parts
64
Author
License
CC Attribution 3.0 Unported:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal purpose as long as the work is attributed to the author in the manner specified by the author or licensor.
Identifiers
Publisher
Release Date
Language

Content Metadata

Subject Area
Genre
Abstract
We're going to look in particular at (at least) two vector search implementation in popular tools that a lot of people already use: * pgvector for PostgreSQL * Lucene vector implementation for Elasticsearch and OpenSearch We recently had to evaluate the two for a particular use case and the comparison is quite interesting, there are pros to each, for example: * pgvector means less infra and cost, and is always strongly consistent * Elasticsearch/Opensearch can do automatic sharding * in postgres you can shard by tenant easier by using schemas or partitioned indexes * Lucene can combine functionality with full-text search We'll go through the above and also discuss when going for a dedicated vector DB makes sense.