Share via


IndexKind.Flat Field

Definition

Does a brute force search to find the nearest neighbors. Calculates the distances between all pairs of data points, so has a linear time complexity, that grows directly proportional to the number of points. Also referred to as exhaustive k nearest neighbor in some databases.

public const string Flat;
val mutable Flat : string
Public Const Flat As String 

Field Value

Remarks

High recall accuracy, but slower and more expensive than HNSW. Better with smaller datasets.

Applies to