Client API Config

Vald provides client libraries to make it easier to access different API provided by Vald, including indexing vectors, searching approximate nearest neighbor vectors, updating vectors, and removing indexed vectors. Each request allows setting request configuration for user demands. Please select the section you need.

Please read the API documentation for more API service details.

Insert Service

The Insert service allows users to insert new vector(s) into the Vald cluster. It requires the vector, its ID (specific ID for the vector), and optional configuration.

Configuration

// Represent insert configuration.
message Config {
  // Check whether or not the same set of vector and ID is already inserted.
  bool skip_strict_exist_check = 1;
  // Configuration for filters if your Vald cluster uses filters.
  Filter.Config filters = 2;
  // The timestamp when the vector was inserted.
  int64 timestamp = 3;
}
Insert Configuration Sample (Go)
package main

import (
	"context"
	"time"

	"github.com/vdaas/vald-client-go/v1/payload"
	"github.com/vdaas/vald-client-go/v1/vald"
	"google.golang.org/grpc"
)

func main() {
	// Create connection
	ctx, cancel := context.WithCancel(context.Background())
	defer cancel()
	target := "localhost:8080"
	conn, err := grpc.NewClient(target)
	if err != nil {
		panic(err)
	}
	// Init Vald client
	client := vald.NewValdClient(conn)

	// Insert sample
	location, err := client.Insert(ctx, &payload.Insert_Request{
		// Vector information (mandatory)
		Vector: &payload.Object_Vector{
			// Set the vector
			Vector: []float32{0, 1, 2},
			// Set the specific ID for the vector
			// The ID must not be indexed.
			Id:     "sample",
		},
		// Insert configuration (optional)
		Config: &payload.Insert_Config{
			SkipStrictExistCheck: false,
			Filters: &payload.Filter_Config{
				Targets: []*payload.Filter_Target{
					{
						Host: "vald-ingress-filter",
						Port: 8081,
					},
				},
			},
			Timestamp: time.Now().UnixMilli(),
		},
	})
	if err != nil {
		panic(err)
	}
	...
}

skip_strict_exist_check

skip_strict_exist_check is a flag to skip checking whether the same set of the vector and ID is already inserted or not. If it is set as true, the checking function will be skipped.
The default value is false.

filters

filters is the configuration when using filter functions. In the Insert section, it is common to use ingress filtering when applying the filter’s configuration.

The detailed configuration is following.

// Filter related messages.
message Filter {

  // Represent the target filter server.
  message Target {
    // The target filter component hostname.
    string host = 1;
    // The target filter component port.
    uint32 port = 2;
  }

  // Represent filter configuration.
  message Config {
    // Represent the filter target configuration.
    repeated Target targets = 1;
  }
}

timestamp

timestamp is the timestamp when the vector is inserted. When timestamp is not set, the current time will be used.

Update Service

The Update service allows users to update vector(s) that already exists in the Vald cluster. It requires the new vector, its ID (the target ID already indexed), and optional configuration.

Configuration

// Represent update configuration.
message Config {
  // Check whether or not the same set of vector and ID is already inserted.
  bool skip_strict_exist_check = 1;
  // Configuration for filters if your Vald cluster uses filters.
  Filter.Config filters = 2;
  // The timestamp when the vector was inserted.
  int64 timestamp = 3;
}
Update Configuration Sample (Go)
package main

import (
	"context"
	"time"

	"github.com/vdaas/vald-client-go/v1/payload"
	"github.com/vdaas/vald-client-go/v1/vald"
	"google.golang.org/grpc"
)

func example() {
	// Create connection
	ctx, cancel := context.WithCancel(context.Background())
	defer cancel()
	target := "localhost:8080"
	conn, err := grpc.NewClient(target)
	if err != nil {
		panic(err)
	}
	// Init Vald client
	client := vald.NewValdClient(conn)

	// Update sample
	location, err := client.Update(ctx, &payload.Update_Request{
		// Vector information (mandatory)
		Vector: &payload.Object_Vector{
			// Set the vector
			Vector: []float32{0, 1, 2},
			// Set the specific ID for the vector
                        // The ID must be already indexed.
			Id:     "sample",
		},
		// Update configuration (optional)
		Config: &payload.Update_Config{
			SkipStrictExistCheck: false,
			Filters: &payload.Filter_Config{
				Targets: []*payload.Filter_Target{
					{
						Host: "vald-ingress-filter",
						Port: 8081,
					},
				},
			},
			Timestamp: time.Now().UnixMilli(),
		},
	})
	if err != nil {
		panic(err)
	}
	...
}

skip_strict_exist_check

skip_strict_exist_check (default value is false) is a flag to skip checking whether the same set of the vector and ID is already inserted or not. If it is set as true, the checking function will be skipped.

When skip_strict_exist_check is false, the following checking steps will run in the update process:

  1. Check whether the set of ID and vector is already inserted. If there is no data, the update process ends with returning the NOT_FOUND error.
  2. After passing the step.1, check whether the request vector is the same as the indexed vector. If it is the same, the update process ends with returning the ALREADY_EXIST error.

The update process will continue if all of the above steps have been passed.

filters

filters is the configuration when using filter functions. In the Update section, it is common to use ingress filtering when applying the filter’s configuration.```

The detailed configuration is following.

// Filter related messages.
message Filter {

  // Represent the target filter server.
  message Target {
    // The target filter component hostname.
    string host = 1;
    // The target filter component port.
    uint32 port = 2;
  }

  // Represent filter configuration.
  message Config {
    // Represent the filter target configuration.
    repeated Target targets = 1;
  }
}

timestamp

timestamp is the timestamp when the vector is updated. When timestamp is not set, the current time will be used.

Upsert Service

The Upsert service allows the user to update existing vectors in the Vald cluster or insert new vector(s) if the request vector is not indexed. It requires the vector, its ID (specific ID for the vector), and optional configuration.

Configuration

// Represent upsert configuration.
message Config {
  // Check whether or not the same set of vector and ID is already inserted.
  bool skip_strict_exist_check = 1;
  // Configuration for filters if your Vald cluster uses filters.
  Filter.Config filters = 2;
  // The timestamp when the vector was inserted.
  int64 timestamp = 3;
}
Upsert Configuration Sample (Go)
package main

import (
	"context"
	"time"

	"github.com/vdaas/vald-client-go/v1/payload"
	"github.com/vdaas/vald-client-go/v1/vald"
	"google.golang.org/grpc"
)

func example() {
	// Create connection
	ctx, cancel := context.WithCancel(context.Background())
	defer cancel()
	target := "localhost:8080"
	conn, err := grpc.NewClient(target)
	if err != nil {
		panic(err)
	}
	// Init Vald client
	client := vald.NewValdClient(conn)

	// Upsert sample
	location, err := client.Upsert(ctx, &payload.Upsert_Request{
		// Vector information (mandatory)
		Vector: &payload.Object_Vector{
			// Set the vector
			Vector: []float32{0, 1, 2},
			// Set the specific ID for the vector
			Id:     "sample",
		},
		// Upsert configuration (optional)
		Config: &payload.Upsert_Config{
			SkipStrictExistCheck: false,
			Filters: &payload.Filter_Config{
				Targets: []*payload.Filter_Target{
					{
						Host: "vald-ingress-filter",
						Port: 8081,
					},
				},
			},
			Timestamp: time.Now().UnixMilli(),
		},
	})
	if err != nil {
		panic(err)
	}
        ...
}

skip_strict_exist_check

skip_strict_exist_check (default value is false) is a flag to skip checking whether the same set of the vector and ID is already inserted or not. If it is set as false, the checking function will be skipped.

When skip_strict_exist_check is false, the following checking steps will run in the upsert process:

  1. Check whether the set of (ID and vector) is already inserted or not. The request ID and vector will be inserted if there is no data.
  2. After passing the step.1, check whether the request vector is the same as the indexed vector. If it is the same, the upsert process ends with returning the ALREADY_EXIST error.

The upsert process will continue if all of the above steps have been passed.

filters

filters is the configuration when using filter functions. In the Upsert section, it is common to use ingress filtering when applying the filter’s configuration.

The detailed configuration is following.

// Filter related messages.
message Filter {

  // Represent the target filter server.
  message Target {
    // The target filter component hostname.
    string host = 1;
    // The target filter component port.
    uint32 port = 2;
  }

  // Represent filter configuration.
  message Config {
    // Represent the filter target configuration.
    repeated Target targets = 1;
  }
}

timestamp

timestamp is the timestamp when the vector is inserted or updated. When timestamp is not set, the current time will be used.

Search Service

Vald provides four types of search services.

  1. Search

    • Search is the ANN(Approximate Nearest Neighbor) search with query vector. It is a fast search even though large dimension vector. The search duration is quick but less accurate than LinearSearch. The search algorithm depends on each core algorithm.
  2. SearchById

    • SearchById is the ANN(Approximate Nearest Neighbor) search with the stored vector’s ID. The ID should already exist in the NGT indexes before the search process. The search algorithm is the same as Search.
  3. LinearSearch

    • LinearSearch is the most general search algorithm with a query vector. It searches all indexed vectors and calculates the distance between the query. It returns accurate results but requires more processing time than Search (ANN search) as it needs to calculate from all indexed vectors instead of only a subset of indexed vectors.
  4. LinearSearchById

    • LinearSearchById is the primary search algorithm with the vector’s ID. The ID should already exist in the NGT indexes before the search process. The search algorithm is the same as LinearSearch.
Linear Search service is available from Vald v1.4 or later.

For more details, please refer to the Search API document.

Configuration

// Represent search configuration.
message Config {
  // Unique request ID.
  string request_id = 1;
  // Maximum number of results to be returned.
  uint32 num = 2 [ (validate.rules).uint32.gte = 1 ];
  // Search radius.
  float radius = 3;
  // Search coefficient.
  float epsilon = 4;
  // Search timeout in nanoseconds.
  int64 timeout = 5;
  // Ingress filter configurations.
  Filter.Config ingress_filters = 6;
  // Egress filter configurations.
  Filter.Config egress_filters = 7;
  // Minimum number of results to be returned.
  uint32 min_num = 8 [ (validate.rules).uint32.gte = 0 ];
  // Aggregation Algorithm
  AggregationAlgorithm aggregation_algorithm = 9;
}

// AggregationAlgorithm is enum of each aggregation algorithms
enum AggregationAlgorithm {
  Unknown = 0;
  ConcurrentQueue = 1;
  SortSlice = 2;
  SortPoolSlice = 3;
  PairingHeap = 4;
}

AggregationAlgorithm is available from v1.7.6. You can select 1 algorithm from 4 algorithms (Unknown is same as ConcurrentQueue) based on desired search performance. This table shows the description and recommended situation for each algorithm.

AlgorithmDescriptionRecommended Situation
ConcurrentQueueTraditional Vald proprietary aggregation algorithmGood performance when asynchronous aggregation from a large number of Agents and a huge number of threads.
SortSliceAggregate and rerank all agent results together to eliminate duplicatesGood performance when there are small top-K and small number of Agents.
SortPoolSliceMemory reduce version of SortSliceSame as SortSlice.
PairingHeapAggregation method using PairingHeap that supports Multi threads.Faster under the medium scale top-K and the medium number of Agents, which is difficult to achive performance with SortSlice.
Search Configuration Sample (Go)
package main

import (
	"context"
	"time"

	"github.com/vdaas/vald-client-go/v1/payload"
	"github.com/vdaas/vald-client-go/v1/vald"
	"google.golang.org/grpc"
)

func main() {
	// Create connection
	ctx, cancel := context.WithCancel(context.Background())
	defer cancel()
	target := "localhost:8080"
	conn, err := grpc.NewClient(target)
	if err != nil {
		panic(err)
	}
	// Init Vald client
	client := vald.NewValdClient(conn)

	// Search sample
	res, err := client.Search(ctx, &payload.Search_Request{
		// Query vector
		Vector: []float32{0, 1, 2},
		// Search configuration
		Config: &payload.Search_Config{
			RequestId: "unique-request-id",
			// The number of the search result to be returned.
			Num: 10,
			// The minimum number of the search result to be returned.
			// It prevents the timeout error when the number of results does NOT satisfy Num.
			MinNum: 5,
			// The space of search candidate radius for NN vectors.
			Radius: -1,
			// Epsilon determines how much to expand from the search candidate radius.
			Epsilon: 0.1,
			// Search timeout setting.
			Timeout: 100000000,
			IngressFilters: &payload.Filter_Config{
				Targets: []*payload.Filter_Target{
					{
						Host: "vald-ingress-filter",
						Port: 8081,
					},
				},
			},
			EgressFilters: &payload.Filter_Config{
				Targets: []*payload.Filter_Target{
					{
						Host: "vald-egress-filter",
						Port: 8081,
					},
				},
			},
                        AggregationAlgorithm: payload.Search_PairingHeap,
		},
	})

	if err != nil {
		panic(err)
	}
	...
}

request_id

request_id is a unique request ID. It is NOT indexed vector’s ID. Users can use it for, e.g., the error handling process.

num

num is the maximum number of search results you’d like to get. num should be a positive integer.

radius

radius, the specific parameter for NGT, specifies the search range centered on the query vector in terms of the radius of a sphere. The number of search target vectors increases along with the radius being large. There is a trade-off between accuracy and search speed. It is hard to set it depending on the dataset in many cases.

The default value is infinity. When setting a negative number as radius, NGT applies the radius as infinity.

NGT will self-update the radius during the search process.

epsilon

epsilon, the specific parameter for NGT, specifies the search range’s magnification coefficient (epsilon). NGT will use radius*(1+epsilon) as the search range. The number of search target vectors increases along with the epsilon being large.

The default value is 0.1, and it may work in most cases. However, the appropriate value may vary depending on the dataset. While it is desirable to adjust this value within 0 - 0.3, it can also set a negative value (over -1).

ingress_filters

ingress_filters is required when using the ingress filter component. It requires the ingress filter component’s hostname and port.

// Filter related messages.
message Filter {

  // Represent the target filter server.
  message Target {
    // The target filter component hostname.
    string host = 1;
    // The target filter component port.
    uint32 port = 2;
  }

  // Represent filter configuration.
  message Config {
    // Represent the filter target configuration.
    repeated Target targets = 1;
  }
}

egress_filters

egress_filters is required when using the egress filter component. It requires the egress filter component’s hostname and port.

// Filter related messages.
message Filter {

  // Represent the target filter server.
  message Target {
    // The target filter component hostname.
    string host = 1;
    // The target filter component port.
    uint32 port = 2;
  }

  // Represent filter configuration.
  message Config {
    // Represent the filter target configuration.
    repeated Target targets = 1;
  }
}

min_num

min_num is the minimum number of search results you’d like to get at least. It helps you avoid the timeout error when the search process requires more time. min_num should be a positive integer smaller than num.

Remove Service

The Remove service allows the user to delete indexed vectors from the Vald cluster. Removing the vector requires the vector’s ID and optional configuration.

For more details, please refer to the Remove API document.

Configuration

// Represent remove configuration.
message Config {
  // Check whether or not the same set of ID and vector is already inserted.
  bool skip_strict_exist_check = 1;
  // The timestamp when the vector was removed.
  int64 timestamp = 3;
}
Remove Configuration Sample (Go)
package main

import (
	"context"
	"time"

	"github.com/vdaas/vald-client-go/v1/payload"
	"github.com/vdaas/vald-client-go/v1/vald"
	"google.golang.org/grpc"
)

func example() {
	// Create connection
	ctx, cancel := context.WithCancel(context.Background())
	defer cancel()
	target := "localhost:8080"
	conn, err := grpc.NewClient(target)
	if err != nil {
		panic(err)
	}
	// Init Vald client
	client := vald.NewValdClient(conn)

	// Remove sample
	location, err := client.Remove(ctx, &payload.Remove_Request{
		// Vector ID (mandatory)
                // The ID must be already indexed.
		Id: &payload.Object_ID{
			Id: "sample",
		},
		// Remove configuration (optional)
		Config: &payload.Remove_Config{
			SkipStrictExistCheck: false,
			Timestamp: time.Now().UnixMilli(),
		},
	})
	if err != nil {
		panic(err)
	}
        ...
}

skip_strict_exist_check

skip_strict_exist_check (default value is false) is a flag to skip checking whether the same set of the vector and ID is already inserted or not. If it is set as true, the checking function will be skipped.

When skip_strict_exist_check is false, the following checking step will run in the removing process:

  1. Check whether the set of (ID and vector) is already inserted. If there is no data, the removal process ends with returning the NOT_FOUND error.

The removal process will continue if the above step has been passed.

timestamp

timestamp is the timestamp when the vector is removed. When timestamp is not set, the current time will be used.

See also