test_segcore.cpp 6.6 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
// Copyright (C) 2019-2020 Zilliz. All rights reserved.
//
// Licensed 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.

F
FluorineDog 已提交
12
#include <gtest/gtest.h>
13
#include <random>
14
#include <string>
15

16
#include "segcore/SegmentGrowingImpl.h"
17

18
using namespace milvus;
19

20 21 22 23 24 25 26 27 28
namespace {
auto
generate_data(int N) {
    std::vector<char> raw_data;
    std::vector<uint64_t> timestamps;
    std::vector<int64_t> uids;
    std::default_random_engine er(42);
    std::normal_distribution<> distribution(0.0, 1.0);
    std::default_random_engine ei(42);
29

30 31 32 33 34 35 36 37
    for (int i = 0; i < N; ++i) {
        uids.push_back(10 * N + i);
        timestamps.push_back(0);
        // append vec
        float vec[16];
        for (auto& x : vec) {
            x = distribution(er);
        }
38
        raw_data.insert(raw_data.end(), (const char*)std::begin(vec), (const char*)std::end(vec));
39
        int age = ei() % 100;
40
        raw_data.insert(raw_data.end(), (const char*)&age, ((const char*)&age) + sizeof(age));
41 42 43
    }
    return std::make_tuple(raw_data, timestamps, uids);
}
44
}  // namespace
45

G
GuoRentong 已提交
46 47
TEST(SegmentCoreTest, NormalDistributionTest) {
    using namespace milvus::segcore;
48 49
    using namespace milvus::engine;
    auto schema = std::make_shared<Schema>();
G
GuoRentong 已提交
50 51
    schema->AddDebugField("fakevec", DataType::VECTOR_FLOAT, 16, MetricType::METRIC_L2);
    schema->AddDebugField("age", DataType::INT32);
G
groot 已提交
52
    int N = 100 * 1000;
53
    auto [raw_data, timestamps, uids] = generate_data(N);
54
    auto segment = CreateGrowingSegment(schema);
55 56 57 58
    segment->PreInsert(N);
    segment->PreDelete(N);
}

59
// Test insert row-based data
G
GuoRentong 已提交
60 61
TEST(SegmentCoreTest, MockTest) {
    using namespace milvus::segcore;
62 63
    using namespace milvus::engine;
    auto schema = std::make_shared<Schema>();
G
GuoRentong 已提交
64 65
    schema->AddDebugField("fakevec", DataType::VECTOR_FLOAT, 16, MetricType::METRIC_L2);
    schema->AddDebugField("age", DataType::INT32);
66 67
    std::vector<char> raw_data;
    std::vector<Timestamp> timestamps;
F
FluorineDog 已提交
68
    std::vector<int64_t> uids;
69 70
    int N = 10000;
    std::default_random_engine e(67);
71
    for (int i = 0; i < N; ++i) {
72 73 74 75
        uids.push_back(100000 + i);
        timestamps.push_back(0);
        // append vec
        float vec[16];
76
        for (auto& x : vec) {
77 78 79 80 81 82 83 84 85
            x = e() % 2000 * 0.001 - 1.0;
        }
        raw_data.insert(raw_data.end(), (const char*)std::begin(vec), (const char*)std::end(vec));
        int age = e() % 100;
        raw_data.insert(raw_data.end(), (const char*)&age, ((const char*)&age) + sizeof(age));
    }
    auto line_sizeof = (sizeof(int) + sizeof(float) * 16);
    assert(raw_data.size() == line_sizeof * N);

F
FluorineDog 已提交
86
    // auto index_meta = std::make_shared<IndexMeta>(schema);
87
    auto segment = CreateGrowingSegment(schema);
F
FluorineDog 已提交
88

G
GuoRentong 已提交
89
    RowBasedRawData data_chunk{raw_data.data(), (int)line_sizeof, N};
F
FluorineDog 已提交
90 91
    auto offset = segment->PreInsert(N);
    segment->Insert(offset, N, uids.data(), timestamps.data(), data_chunk);
92 93 94
    SearchResult search_result;
    // segment->Query(nullptr, 0, query_result);
    // segment->BuildIndex();
95 96 97
    int i = 0;
    i++;
}
G
GuoRentong 已提交
98

99 100
// Test insert column-based data
TEST(SegmentCoreTest, MockTest2) {
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170
    using namespace milvus::segcore;
    using namespace milvus::engine;

    // schema
    auto schema = std::make_shared<Schema>();
    schema->AddDebugField("fakevec", DataType::VECTOR_FLOAT, 16, MetricType::METRIC_L2);
    schema->AddDebugField("age", DataType::INT32);

    // generate random row-based data
    std::vector<char> row_data;
    std::vector<Timestamp> timestamps;
    std::vector<int64_t> uids;
    int N = 10000;  // number of records
    std::default_random_engine e(67);
    for (int i = 0; i < N; ++i) {
        uids.push_back(100000 + i);
        timestamps.push_back(0);
        // append vec
        float vec[16];
        for (auto& x : vec) {
            x = e() % 2000 * 0.001 - 1.0;
        }
        row_data.insert(row_data.end(), (const char*)std::begin(vec), (const char*)std::end(vec));
        int age = e() % 100;
        row_data.insert(row_data.end(), (const char*)&age, ((const char*)&age) + sizeof(age));
    }
    auto line_sizeof = (sizeof(int) + sizeof(float) * 16);
    assert(row_data.size() == line_sizeof * N);

    int64_t size = N;
    const int64_t* uids_raw = uids.data();
    const Timestamp* timestamps_raw = timestamps.data();
    std::vector<std::tuple<Timestamp, idx_t, int64_t>> ordering(size);  // timestamp, pk, order_index
    for (int i = 0; i < size; ++i) {
        ordering[i] = std::make_tuple(timestamps_raw[i], uids_raw[i], i);
    }
    std::sort(ordering.begin(), ordering.end());  // sort according to timestamp

    // convert row-based data to column-based data accordingly
    auto sizeof_infos = schema->get_sizeof_infos();
    std::vector<int> offset_infos(schema->size() + 1, 0);
    std::partial_sum(sizeof_infos.begin(), sizeof_infos.end(), offset_infos.begin() + 1);
    std::vector<aligned_vector<uint8_t>> entities(schema->size());

    for (int fid = 0; fid < schema->size(); ++fid) {
        auto len = sizeof_infos[fid];
        entities[fid].resize(len * size);
    }

    auto raw_data = row_data.data();
    std::vector<idx_t> sorted_uids(size);
    std::vector<Timestamp> sorted_timestamps(size);
    for (int index = 0; index < size; ++index) {
        auto [t, uid, order_index] = ordering[index];
        sorted_timestamps[index] = t;
        sorted_uids[index] = uid;
        for (int fid = 0; fid < schema->size(); ++fid) {
            auto len = sizeof_infos[fid];
            auto offset = offset_infos[fid];
            auto src = raw_data + order_index * line_sizeof + offset;
            auto dst = entities[fid].data() + index * len;
            memcpy(dst, src, len);
        }
    }

    // insert column-based data
    ColumnBasedRawData data_chunk{entities, N};
    auto segment = CreateGrowingSegment(schema);
    auto reserved_begin = segment->PreInsert(N);
    segment->Insert(reserved_begin, size, sorted_uids.data(), sorted_timestamps.data(), data_chunk);
171 172
}

G
GuoRentong 已提交
173 174 175 176
TEST(SegmentCoreTest, SmallIndex) {
    using namespace milvus::segcore;
    using namespace milvus::engine;
    auto schema = std::make_shared<Schema>();
G
GuoRentong 已提交
177 178
    schema->AddDebugField("fakevec", DataType::VECTOR_FLOAT, 16, MetricType::METRIC_L2);
    schema->AddDebugField("age", DataType::INT32);
G
GuoRentong 已提交
179
}