Vertex AI V1 API - Class Google::Cloud::AIPlatform::V1::RagVectorDbConfig::RagManagedDb::ANN (v1.15.0)

Version latest

• 1.15.0 (latest)
• 1.14.0
• 1.13.0
• 1.12.0
• 1.11.0
• 1.10.0
• 1.9.0
• 1.8.0
• 1.7.0
• 1.6.0
• 1.5.0
• 1.4.0
• 1.3.0
• 1.2.0
• 1.1.0
• 1.0.0
• 0.64.0
• 0.63.0
• 0.62.0
• 0.61.0
• 0.60.0
• 0.59.0
• 0.58.0
• 0.57.0
• 0.56.0
• 0.55.0
• 0.54.0
• 0.53.0
• 0.52.0
• 0.51.0
• 0.50.0
• 0.49.0
• 0.48.0
• 0.47.0
• 0.46.0
• 0.45.0
• 0.44.0
• 0.43.0
• 0.42.0
• 0.41.0
• 0.40.0
• 0.39.0
• 0.38.0
• 0.37.0
• 0.36.0
• 0.35.0
• 0.34.0
• 0.33.0
• 0.32.0
• 0.31.0
• 0.30.0
• 0.29.0
• 0.28.0
• 0.27.0
• 0.26.0
• 0.25.0
• 0.24.0
• 0.23.0
• 0.22.0
• 0.21.0
• 0.20.0
• 0.19.0
• 0.18.0
• 0.17.0
• 0.16.0
• 0.15.0
• 0.14.0
• 0.13.0
• 0.12.0
• 0.11.0
• 0.10.0
• 0.9.1
• 0.8.0
• 0.7.0
• 0.6.0
• 0.5.0
• 0.4.0
• 0.3.0
• 0.2.0
• 0.1.0

Reference documentation and code samples for the Vertex AI V1 API class Google::Cloud::AIPlatform::V1::RagVectorDbConfig::RagManagedDb::ANN.

Config for ANN search.

RagManagedDb uses a tree-based structure to partition data and facilitate faster searches. As a tradeoff, it requires longer indexing time and manual triggering of index rebuild via the ImportRagFiles and UpdateRagCorpus API.

Inherits

• Object

Extended By

• Google::Protobuf::MessageExts::ClassMethods

Includes

• Google::Protobuf::MessageExts

Methods

#leaf_count

def leaf_count() -> ::Integer

Returns

• (::Integer) — Number of leaf nodes in the tree-based structure. Each leaf node contains groups of closely related vectors along with their corresponding centroid.

  Recommended value is 10 * sqrt(num of RagFiles in your RagCorpus).

  Default value is 500.

#leaf_count=

def leaf_count=(value) -> ::Integer

Parameter

• value (::Integer) — Number of leaf nodes in the tree-based structure. Each leaf node contains groups of closely related vectors along with their corresponding centroid.

  Recommended value is 10 * sqrt(num of RagFiles in your RagCorpus).

  Default value is 500.

Returns

• (::Integer) — Number of leaf nodes in the tree-based structure. Each leaf node contains groups of closely related vectors along with their corresponding centroid.

  Recommended value is 10 * sqrt(num of RagFiles in your RagCorpus).

  Default value is 500.

#tree_depth

def tree_depth() -> ::Integer

Returns

• (::Integer) — The depth of the tree-based structure. Only depth values of 2 and 3 are supported.

  Recommended value is 2 if you have if you have O(10K) files in the RagCorpus and set this to 3 if more than that.

  Default value is 2.

#tree_depth=

def tree_depth=(value) -> ::Integer

Parameter

• value (::Integer) — The depth of the tree-based structure. Only depth values of 2 and 3 are supported.

  Recommended value is 2 if you have if you have O(10K) files in the RagCorpus and set this to 3 if more than that.

  Default value is 2.

Returns

• (::Integer) — The depth of the tree-based structure. Only depth values of 2 and 3 are supported.

  Recommended value is 2 if you have if you have O(10K) files in the RagCorpus and set this to 3 if more than that.

  Default value is 2.