mirror of
https://gitee.com/milvus-io/milvus.git
synced 2025-12-07 17:48:29 +08:00
* Add log to debug #678 * Rename nsg_mix to RNSG in C++ sdk #735 * [skip ci] change __function__ * clang-format * #766 If partition tag is similar, wrong partition is searched * #766 If partition tag is similar, wrong partition is searched * reorder changelog id * typo * define interface * Define interface (#832) * If partition tag is similar, wrong partition is searched (#825) * #766 If partition tag is similar, wrong partition is searched * #766 If partition tag is similar, wrong partition is searched * reorder changelog id * typo * define interface Attach files by dragging & dropping, selecting or pasting them. Co-authored-by: groot <yihua.mo@zilliz.com> * faiss & knowhere * faiss & knowhere (#842) * Add log to debug #678 * Rename nsg_mix to RNSG in C++ sdk #735 * [skip ci] change __function__ * clang-format * If partition tag is similar, wrong partition is searched (#825) * #766 If partition tag is similar, wrong partition is searched * #766 If partition tag is similar, wrong partition is searched * reorder changelog id * typo * faiss & knowhere Co-authored-by: groot <yihua.mo@zilliz.com> * support binary input * code lint * add wrapper interface * add knowhere unittest * sdk support binary * support using metric tanimoto and hamming * sdk binary insert/query example * fix bug * fix bug * update wrapper * format * Improve unittest and fix bugs * delete printresult * fix bug * #823 Support binary vector tanimoto metric * fix typo * dimension limit to 32768 * fix * dimension limit to 32768 * fix describe index bug * fix #886 * fix #889 * add jaccard cases * hamming dev-test case * change test_connect * Add tanimoto cases * change the output type of hamming * add abs * merge master * rearrange changelog id * modify feature description Co-authored-by: Yukikaze-CZR <48198922+Yukikaze-CZR@users.noreply.github.com> Co-authored-by: Tinkerrr <linxiaojun.cn@outlook.com>
419 lines
14 KiB
C++
419 lines
14 KiB
C++
// Licensed to the Apache Software Foundation (ASF) under one
|
|
// or more contributor license agreements. See the NOTICE file
|
|
// distributed with this work for additional information
|
|
// regarding copyright ownership. The ASF licenses this file
|
|
// to you under the Apache License, Version 2.0 (the
|
|
// "License"); you may not use this file except in compliance
|
|
// with the License. You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing,
|
|
// software distributed under the License is distributed on an
|
|
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
|
|
// KIND, either express or implied. See the License for the
|
|
// specific language governing permissions and limitations
|
|
// under the License.
|
|
|
|
#include <boost/filesystem.hpp>
|
|
#include <chrono>
|
|
#include <cmath>
|
|
#include <fstream>
|
|
#include <iostream>
|
|
#include <random>
|
|
#include <thread>
|
|
|
|
#include "db/Constants.h"
|
|
#include "db/engine/EngineFactory.h"
|
|
#include "db/insert/MemTable.h"
|
|
#include "db/insert/MemTableFile.h"
|
|
#include "db/insert/VectorSource.h"
|
|
#include "db/meta/MetaConsts.h"
|
|
#include "db/utils.h"
|
|
#include "gtest/gtest.h"
|
|
#include "metrics/Metrics.h"
|
|
|
|
namespace {
|
|
|
|
static constexpr int64_t TABLE_DIM = 256;
|
|
|
|
std::string
|
|
GetTableName() {
|
|
auto now = std::chrono::system_clock::now();
|
|
auto micros = std::chrono::duration_cast<std::chrono::microseconds>(now.time_since_epoch()).count();
|
|
static std::string table_name = std::to_string(micros);
|
|
return table_name;
|
|
}
|
|
|
|
milvus::engine::meta::TableSchema
|
|
BuildTableSchema() {
|
|
milvus::engine::meta::TableSchema table_info;
|
|
table_info.dimension_ = TABLE_DIM;
|
|
table_info.table_id_ = GetTableName();
|
|
table_info.engine_type_ = (int)milvus::engine::EngineType::FAISS_IDMAP;
|
|
return table_info;
|
|
}
|
|
|
|
void
|
|
BuildVectors(uint64_t n, milvus::engine::VectorsData& vectors) {
|
|
vectors.vector_count_ = n;
|
|
vectors.float_data_.clear();
|
|
vectors.float_data_.resize(n * TABLE_DIM);
|
|
float* data = vectors.float_data_.data();
|
|
for (int i = 0; i < n; i++) {
|
|
for (int j = 0; j < TABLE_DIM; j++) data[TABLE_DIM * i + j] = drand48();
|
|
}
|
|
}
|
|
} // namespace
|
|
|
|
TEST_F(MemManagerTest, VECTOR_SOURCE_TEST) {
|
|
milvus::engine::meta::TableSchema table_schema = BuildTableSchema();
|
|
auto status = impl_->CreateTable(table_schema);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
milvus::engine::meta::TableFileSchema table_file_schema;
|
|
table_file_schema.table_id_ = GetTableName();
|
|
status = impl_->CreateTableFile(table_file_schema);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
int64_t n = 100;
|
|
milvus::engine::VectorsData vectors;
|
|
BuildVectors(n, vectors);
|
|
|
|
milvus::engine::VectorSource source(vectors);
|
|
|
|
size_t num_vectors_added;
|
|
milvus::engine::ExecutionEnginePtr execution_engine_ = milvus::engine::EngineFactory::Build(
|
|
table_file_schema.dimension_, table_file_schema.location_,
|
|
(milvus::engine::EngineType)table_file_schema.engine_type_,
|
|
(milvus::engine::MetricType)table_file_schema.metric_type_, table_schema.nlist_);
|
|
|
|
status = source.Add(execution_engine_, table_file_schema, 50, num_vectors_added);
|
|
ASSERT_TRUE(status.ok());
|
|
ASSERT_EQ(num_vectors_added, 50);
|
|
ASSERT_EQ(source.GetVectorIds().size(), 50);
|
|
|
|
vectors.id_array_.clear();
|
|
status = source.Add(execution_engine_, table_file_schema, 60, num_vectors_added);
|
|
ASSERT_TRUE(status.ok());
|
|
ASSERT_EQ(num_vectors_added, 50);
|
|
ASSERT_EQ(source.GetVectorIds().size(), 100);
|
|
}
|
|
|
|
TEST_F(MemManagerTest, MEM_TABLE_FILE_TEST) {
|
|
auto options = GetOptions();
|
|
|
|
milvus::engine::meta::TableSchema table_schema = BuildTableSchema();
|
|
auto status = impl_->CreateTable(table_schema);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
milvus::engine::MemTableFile mem_table_file(GetTableName(), impl_, options);
|
|
|
|
int64_t n_100 = 100;
|
|
milvus::engine::VectorsData vectors_100;
|
|
BuildVectors(n_100, vectors_100);
|
|
|
|
milvus::engine::VectorSourcePtr source = std::make_shared<milvus::engine::VectorSource>(vectors_100);
|
|
|
|
milvus::engine::IDNumbers vector_ids;
|
|
status = mem_table_file.Add(source);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
// std::cout << mem_table_file.GetCurrentMem() << " " << mem_table_file.GetMemLeft() << std::endl;
|
|
|
|
size_t singleVectorMem = sizeof(float) * TABLE_DIM;
|
|
ASSERT_EQ(mem_table_file.GetCurrentMem(), n_100 * singleVectorMem);
|
|
|
|
int64_t n_max = milvus::engine::MAX_TABLE_FILE_MEM / singleVectorMem;
|
|
milvus::engine::VectorsData vectors_128M;
|
|
BuildVectors(n_max, vectors_128M);
|
|
|
|
milvus::engine::VectorSourcePtr source_128M =
|
|
std::make_shared<milvus::engine::VectorSource>(vectors_128M);
|
|
vector_ids.clear();
|
|
status = mem_table_file.Add(source_128M);
|
|
|
|
ASSERT_EQ(source_128M->GetVectorIds().size(), n_max - n_100);
|
|
|
|
ASSERT_TRUE(mem_table_file.IsFull());
|
|
}
|
|
|
|
TEST_F(MemManagerTest, MEM_TABLE_TEST) {
|
|
auto options = GetOptions();
|
|
|
|
milvus::engine::meta::TableSchema table_schema = BuildTableSchema();
|
|
auto status = impl_->CreateTable(table_schema);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
int64_t n_100 = 100;
|
|
milvus::engine::VectorsData vectors_100;
|
|
BuildVectors(n_100, vectors_100);
|
|
|
|
milvus::engine::VectorSourcePtr source_100 =
|
|
std::make_shared<milvus::engine::VectorSource>(vectors_100);
|
|
|
|
milvus::engine::MemTable mem_table(GetTableName(), impl_, options);
|
|
|
|
milvus::engine::IDNumbers vector_ids;
|
|
status = mem_table.Add(source_100);
|
|
ASSERT_TRUE(status.ok());
|
|
ASSERT_EQ(source_100->GetVectorIds().size(), 100);
|
|
|
|
milvus::engine::MemTableFilePtr mem_table_file;
|
|
mem_table.GetCurrentMemTableFile(mem_table_file);
|
|
size_t singleVectorMem = sizeof(float) * TABLE_DIM;
|
|
ASSERT_EQ(mem_table_file->GetCurrentMem(), n_100 * singleVectorMem);
|
|
|
|
int64_t n_max = milvus::engine::MAX_TABLE_FILE_MEM / singleVectorMem;
|
|
milvus::engine::VectorsData vectors_128M;
|
|
BuildVectors(n_max, vectors_128M);
|
|
|
|
vector_ids.clear();
|
|
milvus::engine::VectorSourcePtr source_128M =
|
|
std::make_shared<milvus::engine::VectorSource>(vectors_128M);
|
|
status = mem_table.Add(source_128M);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
ASSERT_EQ(source_128M->GetVectorIds().size(), n_max);
|
|
|
|
mem_table.GetCurrentMemTableFile(mem_table_file);
|
|
ASSERT_EQ(mem_table_file->GetCurrentMem(), n_100 * singleVectorMem);
|
|
|
|
ASSERT_EQ(mem_table.GetTableFileCount(), 2);
|
|
|
|
int64_t n_1G = 1024000;
|
|
milvus::engine::VectorsData vectors_1G;
|
|
BuildVectors(n_1G, vectors_1G);
|
|
|
|
milvus::engine::VectorSourcePtr source_1G = std::make_shared<milvus::engine::VectorSource>(vectors_1G);
|
|
|
|
vector_ids.clear();
|
|
status = mem_table.Add(source_1G);
|
|
ASSERT_TRUE(status.ok());
|
|
|
|
ASSERT_EQ(source_1G->GetVectorIds().size(), n_1G);
|
|
|
|
int expectedTableFileCount = 2 + std::ceil((n_1G - n_100) * singleVectorMem / milvus::engine::MAX_TABLE_FILE_MEM);
|
|
ASSERT_EQ(mem_table.GetTableFileCount(), expectedTableFileCount);
|
|
|
|
status = mem_table.Serialize();
|
|
ASSERT_TRUE(status.ok());
|
|
}
|
|
|
|
TEST_F(MemManagerTest2, SERIAL_INSERT_SEARCH_TEST) {
|
|
milvus::engine::meta::TableSchema table_info = BuildTableSchema();
|
|
auto stat = db_->CreateTable(table_info);
|
|
|
|
milvus::engine::meta::TableSchema table_info_get;
|
|
table_info_get.table_id_ = GetTableName();
|
|
stat = db_->DescribeTable(table_info_get);
|
|
ASSERT_TRUE(stat.ok());
|
|
ASSERT_EQ(table_info_get.dimension_, TABLE_DIM);
|
|
|
|
int64_t nb = 100000;
|
|
milvus::engine::VectorsData xb;
|
|
BuildVectors(nb, xb);
|
|
|
|
for (int64_t i = 0; i < nb; i++) {
|
|
xb.id_array_.push_back(i);
|
|
}
|
|
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_TRUE(stat.ok());
|
|
|
|
std::this_thread::sleep_for(std::chrono::seconds(3)); // ensure raw data write to disk
|
|
|
|
std::random_device rd;
|
|
std::mt19937 gen(rd());
|
|
std::uniform_int_distribution<int64_t> dis(0, nb - 1);
|
|
|
|
int64_t num_query = 10;
|
|
std::map<int64_t, milvus::engine::VectorsData> search_vectors;
|
|
for (int64_t i = 0; i < num_query; ++i) {
|
|
int64_t index = dis(gen);
|
|
milvus::engine::VectorsData search;
|
|
search.vector_count_ = 1;
|
|
for (int64_t j = 0; j < TABLE_DIM; j++) {
|
|
search.float_data_.push_back(xb.float_data_[index * TABLE_DIM + j]);
|
|
}
|
|
search_vectors.insert(std::make_pair(xb.id_array_[index], search));
|
|
}
|
|
|
|
int topk = 10, nprobe = 10;
|
|
for (auto& pair : search_vectors) {
|
|
auto& search = pair.second;
|
|
|
|
std::vector<std::string> tags;
|
|
milvus::engine::ResultIds result_ids;
|
|
milvus::engine::ResultDistances result_distances;
|
|
stat = db_->Query(dummy_context_, GetTableName(), tags, topk, nprobe, search, result_ids,
|
|
result_distances);
|
|
ASSERT_EQ(result_ids[0], pair.first);
|
|
ASSERT_LT(result_distances[0], 1e-4);
|
|
}
|
|
}
|
|
|
|
TEST_F(MemManagerTest2, INSERT_TEST) {
|
|
milvus::engine::meta::TableSchema table_info = BuildTableSchema();
|
|
auto stat = db_->CreateTable(table_info);
|
|
|
|
milvus::engine::meta::TableSchema table_info_get;
|
|
table_info_get.table_id_ = GetTableName();
|
|
stat = db_->DescribeTable(table_info_get);
|
|
ASSERT_TRUE(stat.ok());
|
|
ASSERT_EQ(table_info_get.dimension_, TABLE_DIM);
|
|
|
|
auto start_time = METRICS_NOW_TIME;
|
|
|
|
int insert_loop = 20;
|
|
for (int i = 0; i < insert_loop; ++i) {
|
|
int64_t nb = 40960;
|
|
milvus::engine::VectorsData xb;
|
|
BuildVectors(nb, xb);
|
|
milvus::engine::IDNumbers vector_ids;
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_TRUE(stat.ok());
|
|
}
|
|
auto end_time = METRICS_NOW_TIME;
|
|
auto total_time = METRICS_MICROSECONDS(start_time, end_time);
|
|
LOG(DEBUG) << "total_time spent in INSERT_TEST (ms) : " << total_time;
|
|
}
|
|
|
|
TEST_F(MemManagerTest2, CONCURRENT_INSERT_SEARCH_TEST) {
|
|
milvus::engine::meta::TableSchema table_info = BuildTableSchema();
|
|
auto stat = db_->CreateTable(table_info);
|
|
|
|
milvus::engine::meta::TableSchema table_info_get;
|
|
table_info_get.table_id_ = GetTableName();
|
|
stat = db_->DescribeTable(table_info_get);
|
|
ASSERT_TRUE(stat.ok());
|
|
ASSERT_EQ(table_info_get.dimension_, TABLE_DIM);
|
|
|
|
int64_t nb = 40960;
|
|
milvus::engine::VectorsData xb;
|
|
BuildVectors(nb, xb);
|
|
|
|
int64_t qb = 5;
|
|
milvus::engine::VectorsData qxb;
|
|
BuildVectors(qb, qxb);
|
|
|
|
std::thread search([&]() {
|
|
milvus::engine::ResultIds result_ids;
|
|
milvus::engine::ResultDistances result_distances;
|
|
int k = 10;
|
|
std::this_thread::sleep_for(std::chrono::seconds(2));
|
|
|
|
INIT_TIMER;
|
|
std::stringstream ss;
|
|
uint64_t count = 0;
|
|
uint64_t prev_count = 0;
|
|
|
|
for (auto j = 0; j < 10; ++j) {
|
|
ss.str("");
|
|
db_->Size(count);
|
|
prev_count = count;
|
|
|
|
START_TIMER;
|
|
|
|
std::vector<std::string> tags;
|
|
stat =
|
|
db_->Query(dummy_context_, GetTableName(), tags, k, 10, qxb, result_ids, result_distances);
|
|
ss << "Search " << j << " With Size " << count / milvus::engine::M << " M";
|
|
STOP_TIMER(ss.str());
|
|
|
|
ASSERT_TRUE(stat.ok());
|
|
for (auto i = 0; i < qb; ++i) {
|
|
ss.str("");
|
|
ss << "Result [" << i << "]:";
|
|
for (auto t = 0; t < k; t++) {
|
|
ss << result_ids[i * k + t] << " ";
|
|
}
|
|
/* LOG(DEBUG) << ss.str(); */
|
|
}
|
|
ASSERT_TRUE(count >= prev_count);
|
|
std::this_thread::sleep_for(std::chrono::seconds(1));
|
|
}
|
|
});
|
|
|
|
int loop = 20;
|
|
|
|
for (auto i = 0; i < loop; ++i) {
|
|
if (i == 0) {
|
|
qxb.id_array_.clear();
|
|
db_->InsertVectors(GetTableName(), "", qxb);
|
|
ASSERT_EQ(qxb.id_array_.size(), qb);
|
|
} else {
|
|
xb.id_array_.clear();
|
|
db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_EQ(xb.id_array_.size(), nb);
|
|
}
|
|
std::this_thread::sleep_for(std::chrono::microseconds(1));
|
|
}
|
|
|
|
search.join();
|
|
}
|
|
|
|
TEST_F(MemManagerTest2, VECTOR_IDS_TEST) {
|
|
milvus::engine::meta::TableSchema table_info = BuildTableSchema();
|
|
auto stat = db_->CreateTable(table_info);
|
|
|
|
milvus::engine::meta::TableSchema table_info_get;
|
|
table_info_get.table_id_ = GetTableName();
|
|
stat = db_->DescribeTable(table_info_get);
|
|
ASSERT_TRUE(stat.ok());
|
|
ASSERT_EQ(table_info_get.dimension_, TABLE_DIM);
|
|
|
|
int64_t nb = 100000;
|
|
milvus::engine::VectorsData xb;
|
|
BuildVectors(nb, xb);
|
|
|
|
xb.id_array_.resize(nb);
|
|
for (auto i = 0; i < nb; i++) {
|
|
xb.id_array_[i] = i;
|
|
}
|
|
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_EQ(xb.id_array_[0], 0);
|
|
ASSERT_TRUE(stat.ok());
|
|
|
|
nb = 25000;
|
|
BuildVectors(nb, xb);
|
|
|
|
xb.id_array_.resize(nb);
|
|
for (auto i = 0; i < nb; i++) {
|
|
xb.id_array_[i] = i + nb;
|
|
}
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_EQ(xb.id_array_[0], nb);
|
|
ASSERT_TRUE(stat.ok());
|
|
|
|
nb = 262144; // 512M
|
|
BuildVectors(nb, xb);
|
|
|
|
xb.id_array_.resize(nb);
|
|
for (auto i = 0; i < nb; i++) {
|
|
xb.id_array_[i] = i + nb / 2;
|
|
}
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_EQ(xb.id_array_[0], nb / 2);
|
|
ASSERT_TRUE(stat.ok());
|
|
|
|
nb = 65536; // 128M
|
|
BuildVectors(nb, xb);
|
|
xb.id_array_.clear();
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
ASSERT_TRUE(stat.ok());
|
|
|
|
nb = 100;
|
|
BuildVectors(nb, xb);
|
|
|
|
xb.id_array_.resize(nb);
|
|
for (auto i = 0; i < nb; i++) {
|
|
xb.id_array_[i] = i + nb;
|
|
}
|
|
stat = db_->InsertVectors(GetTableName(), "", xb);
|
|
for (auto i = 0; i < nb; i++) {
|
|
ASSERT_EQ(xb.id_array_[i], i + nb);
|
|
}
|
|
}
|