Episode Details
Back to EpisodesInside Oracle AI Vector Search: Indexes, Metrics, and Best Practices
Description
00:00
Welcome to the Oracle University Podcast, the first stop on your cloud journey. During this series of informative podcasts, we'll bring you foundational training on the most popular Oracle technologies. Let's get started!
00:26
Nikita: Welcome to the Oracle University Podcast! I'm Nikita Abraham, Team Lead: Editorial Services with Oracle University, and joining me is Lois Houston, Director of Communications and Adoption Programs with Customer Success Services.
Lois: Hi everyone! Thanks for joining us again as we continue our exploration into the exciting world of Oracle AI Vector Search. In today's episode, we're taking you inside the technology powering vector search in Oracle Database 23ai. We'll break down core concepts like vector indices, how vectors are stored and managed, and how you can use similarity metrics to unlock new possibilities with your data.
01:09
Nikita: We'll also dig into best practices for handling vectors, everything from memory requirements and table creation to the nuts and bolts of running both exact and approximate similarity searches. Back with us today is Senior Principal APEX & Apps Dev Instructor Brent Dayley. Hi Brent! What exactly are vector indexes?
Brent: Now, vector indexes are specialized indexing data structures that can make your queries more efficient against your vectors. They use techniques such as clustering, and partitioning, and neighbor graphs. Now, they greatly reduce the search space, which means that your queries happen quicker. They're also extremely efficient. They do require that you enable the vector pool in the SGA.
02:06
Lois: And are there different types of vector indices supported?
Brent: So, Oracle AI Vector Search supports two types of indexes, in-memory neighbor graph vector index. HNSW is the only type of in-memory neighbor graph vector index that is supported. These are very efficient indexes for vector approximate similarity search. HNSW graphs are structured using principles from small world networks along with layered hierarchical organization.
And neighbor partition vector index. Neighbor partition vector index, inverted file flat index, is the only type of neighbor partition index supported. It is a partition-based index which balances high search quality with reasonabl