AiIndexMetadataConfigArgs

data class AiIndexMetadataConfigArgs(val algorithmConfig: Output<AiIndexMetadataConfigAlgorithmConfigArgs>? = null, val approximateNeighborsCount: Output<Int>? = null, val dimensions: Output<Int>, val distanceMeasureType: Output<String>? = null, val featureNormType: Output<String>? = null, val shardSize: Output<String>? = null) : ConvertibleToJava<AiIndexMetadataConfigArgs>

Constructors

Link copied to clipboard
constructor(algorithmConfig: Output<AiIndexMetadataConfigAlgorithmConfigArgs>? = null, approximateNeighborsCount: Output<Int>? = null, dimensions: Output<Int>, distanceMeasureType: Output<String>? = null, featureNormType: Output<String>? = null, shardSize: Output<String>? = null)

Properties

Link copied to clipboard

The configuration with regard to the algorithms used for efficient search. Structure is documented below.

Link copied to clipboard
val approximateNeighborsCount: Output<Int>? = null

The default number of neighbors to find via approximate search before exact reordering is performed. Exact reordering is a procedure where results returned by an approximate search algorithm are reordered via a more expensive distance computation. Required if tree-AH algorithm is used.

Link copied to clipboard
val dimensions: Output<Int>

The number of dimensions of the input vectors.

Link copied to clipboard
val distanceMeasureType: Output<String>? = null

The distance measure used in nearest neighbor search. The value must be one of the followings:

Link copied to clipboard
val featureNormType: Output<String>? = null

Type of normalization to be carried out on each vector. The value must be one of the followings:

Link copied to clipboard
val shardSize: Output<String>? = null

Index data is split into equal parts to be processed. These are called "shards". The shard size must be specified when creating an index. The value must be one of the followings:

Functions

Link copied to clipboard
open override fun toJava(): AiIndexMetadataConfigArgs