Manage the Different Categories of Vector Indexes

Learn how vector indexing methods make vector searches faster and how to enable vector indexes creation.

There are two ways to make vector searches faster:

  • Reduce the search scope by clustering vectors (nearest neighbors) into structures based on certain attributes and restricting the search to closest clusters.
  • Reduce the vector size by reducing the number of bits representing vectors values.

Oracle AI Vector Search supports the following categories of vector indexing methods based on approximate nearest-neighbors (ANN) search:

  • In-Memory Neighbor Graph Vector Index
  • Neighbor Partition Vector Index

The distance function used to create and search the index should be the one recommended by the embedding model used to create the vectors. You can specify this distance function at the time of index creation or when you perform a similarity search using the VECTOR_DISTANCE() function. If you use a different distance function than the one used to create the index, an exact match is triggered because you cannot use the index in this case.

Note:

  • Oracle AI Vector Search indexes supports the same distance metrics as the VECTOR_DISTANCE() function. COSINE is the default metric if you do not specify any metric at the time of index creation or during a similarity search using the VECTOR_DISTANCE() function.
  • You should always define the distance metric in an index based on the distance metric used by the embedding model you are using.