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

Under the hood of vector search with JVector

Formal Metadata

Title
Under the hood of vector search with JVector
Title of Series
Number of Parts
64
Author
Contributors
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
- ANN (approximate nearest neighbor) vector search is totally different from the problems that we're used to solving with databases. You can't just throw a B-tree at it and call it a day. - It's a super young field with arguably the most important breakthrough (HNSW) created only eight years ago. The best commercial products have started to ship designs based on DiskANN, which is five years old. - Nobody really knows the best way to solve several important problems (how to build indexes larger than memory? how to partition across machines? How to combine indexes to ""garbage collect"" obsolete data without a full rebuild?) - The importance of ANN to RAG (retrieval augmented generation) in generative AI is supercharging interest in the field and we should expect the state of the art to advance quickly.