OpenSearch Vector Engine can now run vector search at a 3rd of the price on OpenSearch 2.17+ domains. Now you can configure k-NN (vector) indexes to run on disk mode, optimizing it for memory-constrained environments, and allow low-cost, correct vector search that responds in low lots of of milliseconds. Disk mode gives a cost-effective different to reminiscence mode if you don’t want close to single-digit latency.
On this put up, you’ll study the advantages of this new function, the underlying mechanics, buyer success tales, and getting began.
Overview of vector search and the OpenSearch Vector Engine
Vector search is a method that improves search high quality by enabling similarity matching on content material that has been encoded by machine studying (ML) fashions into vectors (numerical encodings). It permits use circumstances like semantic search, permitting you to contemplate context and intent together with key phrases to ship extra related searches.
OpenSearch Vector Engine permits real-time vector searches past billions of vectors by creating indexes on vectorized content material. You possibly can then run searches for the highest Ok paperwork in an index which might be most much like a given question vector, which might be a query, key phrase, or content material (equivalent to a picture, audio clip, or textual content) that has been encoded by the identical ML mannequin.
Tuning the OpenSearch Vector Engine
Search purposes have various necessities when it comes to pace, high quality, and price. As an illustration, ecommerce catalogs require the bottom potential response occasions and high-quality search to ship a constructive buying expertise. Nevertheless, optimizing for search high quality and efficiency positive aspects typically incurs price within the type of further reminiscence and compute.
The appropriate steadiness of pace, high quality, and price depends upon your use circumstances and buyer expectations. OpenSearch Vector Engine gives complete tuning choices so you may make good trade-offs to realize optimum outcomes tailor-made to your distinctive necessities.
You need to use the next tuning controls:
- Algorithms and parameters – This contains the next:
- Hierarchical Navigable Small World (HNSW) algorithm and parameters like
ef_search,ef_construct, andm - Inverted File Index (IVF) algorithm and parameters like
nlistandnprobes - Precise k-nearest neighbors (k-NN), also referred to as brute-force k-NN (BFKNN) algorithm
- Hierarchical Navigable Small World (HNSW) algorithm and parameters like
- Engines – Fb AI Similarity Search (FAISS), Lucene, and Non-metric House Library (NMSLIB).
- Compression methods – Scalar (equivalent to byte and half precision), binary, and product quantization
- Similarity (distance) metrics – Interior product, cosine, L1, L2, and hamming
- Vector embedding sorts – Dense and sparse with variable dimensionality
- Rating and scoring strategies – Vector, hybrid (mixture of vector and Finest Match 25 (BM25) scores), and multi-stage rating (equivalent to cross-encoders and personalizers)
You possibly can regulate a mix of tuning controls to realize a various steadiness of pace, high quality, and price that’s optimized to your wants. The next diagram gives a tough efficiency profiling for pattern configurations.
Tuning for disk-optimization
With OpenSearch 2.17+, you may configure your k-NN indexes to run on disk mode for high-quality, low-cost vector search by buying and selling in-memory efficiency for increased latency. In case your use case is happy with ninetieth percentile (P90) latency within the vary of 100–200 milliseconds, disk mode is a superb possibility so that you can obtain price financial savings whereas sustaining excessive search high quality. The next diagram illustrates disk mode’s efficiency profile amongst different engine configurations.
Disk mode was designed to expire of the field, decreasing your reminiscence necessities by 97% in comparison with reminiscence mode whereas offering excessive search high quality. Nevertheless, you may tune compression and sampling charges to regulate for pace, high quality, and price.
The next desk presents efficiency benchmarks for disk mode’s default settings. OpenSearch Benchmark (OSB) was used to run the primary three assessments, and VectorDBBench (VDBB) was used for the final two. Efficiency tuning greatest practices had been utilized to realize optimum outcomes. The low scale assessments (Tasb-1M and Marco-1M) had been run on a single r7gd.giant knowledge node with one duplicate. The opposite assessments had been run on two r7gd.2xlarge knowledge nodes with one duplicate. The % price discount metric is calculated by evaluating an equal, right-sized in-memory deployment with the default settings.
These assessments are designed to display that disk mode can ship excessive search high quality with 32 occasions compression throughout quite a lot of datasets and fashions whereas sustaining our goal latency (beneath P90 200 milliseconds). These benchmarks aren’t designed for evaluating ML fashions. A mannequin’s affect on search high quality varies with a number of components, together with the dataset.
Disk mode’s optimizations beneath the hood
While you configure a k-NN index to run on disk mode, OpenSearch mechanically applies a quantization approach, compressing vectors as they’re loaded to construct a compressed index. By default, disk mode converts every full-precision vector—a sequence of lots of to hundreds of dimensions, every saved as 32-bit numbers—into binary vectors, which symbolize every dimension as a single-bit. This conversion leads to a 32 occasions compression fee, enabling the engine to construct an index that’s 97% smaller than one composed of full-precision vectors. A right-sized cluster will preserve this compressed index in reminiscence.
Compression lowers price by decreasing the reminiscence required by the vector engine, however it sacrifices accuracy in return. Disk mode recovers accuracy, and subsequently search high quality, utilizing a two-step search course of. The primary part of the question execution begins by effectively traversing the compressed index in reminiscence for candidate matches. The second part makes use of these candidates to oversample corresponding full-precision vectors. These full-precision vectors are saved on disk in a format designed to cut back I/O and optimize disk retrieval pace and effectivity. The pattern of full-precision vectors is then used to reinforce and re-score matches from part one (utilizing precise k-NN), thereby recovering the search high quality loss attributed to compression. Disk mode’s increased latency relative to reminiscence mode is attributed to this re-scoring course of, which requires disk entry and extra computation.
Early buyer successes
Prospects are already operating the vector engine in disk mode. On this part, we share testimonials from early adopters.
Asana is enhancing search high quality for purchasers on their work administration platform by phasing in semantic search capabilities via OpenSearch’s vector engine. They initially optimized the deployment through the use of product quantization to compress indexes by 16 occasions. By switching over to the disk-optimized configurations, they had been in a position to doubtlessly cut back price by one other 33% whereas sustaining their search high quality and latency targets. These economics make it viable for Asana to scale to billions of vectors and democratize semantic search all through their platform.
DevRev bridges the elemental hole in software program corporations by instantly connecting customer-facing groups with builders. As an AI-centered platform, it creates direct pathways from buyer suggestions to product growth, serving to over 1,000 corporations speed up progress with correct search, quick analytics, and customizable workflows. Constructed on giant language fashions (LLMs) and Retrieval Augmented Technology (RAG) flows operating on OpenSearch’s vector engine, DevRev permits clever conversational experiences.
“With OpenSearch’s disk-optimized vector engine, we achieved our search high quality and latency targets with 16x compression. OpenSearch provides scalable economics for our multi-billion vector search journey.”
– Anshu Avinash, Head of AI and Search at DevRev.
Get began with disk mode on the OpenSearch Vector Engine
First, you have to decide the sources required to host your index. Begin by estimating the reminiscence required to help your disk-optimized k-NN index (with the default 32 occasions compression fee) utilizing the next formulation:
Required reminiscence (bytes) = 1.1 x ((vector dimension depend)/8 + 8 x m) x (vector depend)
As an illustration, if you happen to use the defaults for Amazon Titan Textual content V2, your vector dimension depend is 1024. Disk mode makes use of the HNSW algorithm to construct indexes, so “m” is without doubt one of the algorithm parameters, and it defaults to 16. In the event you construct an index for a 1-billion vector corpus encoded by Amazon Titan Textual content, your reminiscence necessities are 282 GB.
If in case you have a throughput-heavy workload, you have to be certain that your area has adequate IOPs and CPUs as properly. In the event you comply with deployment greatest practices, you need to use occasion retailer and storage efficiency optimized occasion sorts, which is able to typically offer you adequate IOPs. You need to at all times carry out load testing for high-throughput workloads, and regulate the unique estimates to accommodate for increased IOPs and CPU necessities.
Now you may deploy an OpenSearch 2.17+ area that has been right-sized to your wants. Create your k-NN index with the mode parameter set to on_disk, after which ingest your knowledge. If you have already got a k-NN index operating on the default in_memory mode, you may convert it by switching the mode to on_disk adopted by a reindex job. After the index is rebuilt, you may downsize your area accordingly.
Conclusion
On this put up, we mentioned how one can profit from operating the OpenSearch Vector Engine on disk mode, shared buyer success tales, and supplied you tips about getting began. You’re now set to run the OpenSearch Vector Engine at as little as a 3rd of the price.
To be taught extra, consult with the documentation.
In regards to the Authors
Dylan Tong is a Senior Product Supervisor at Amazon Net Providers. He leads the product initiatives for AI and machine studying (ML) on OpenSearch together with OpenSearch’s vector database capabilities. Dylan has many years of expertise working instantly with prospects and creating merchandise and options within the database, analytics and AI/ML area. Dylan holds a BSc and MEng diploma in Laptop Science from Cornell College.
Vamshi Vijay Nakkirtha is a software program engineering supervisor engaged on the OpenSearch Mission and Amazon OpenSearch Service. His major pursuits embrace distributed methods.