mirror of
https://github.com/hanzo-ds/cpp.git
synced 2026-10-30 20:31:26 +00:00
Pure rename applied on top of upstream tag v2.6.2 (8d2415d6), not HEAD.
The fork was cut at 737145d = v2.6.2-57, which still declared version 2.6.2
in version.h; renaming there would have shipped 57 unreleased commits wearing
a 2.6.2 label. Reset to the tag first so this commit changes names only.
clickhouse/ -> datastore/ (public include root)
namespace clickhouse -> namespace datastore
CLICKHOUSE_CPP_VERSION -> DATASTORE_CPP_VERSION
clickhouse-cpp-lib/-ut -> datastore-cpp-lib/-ut (CMake, Bazel)
CH_MAP_BOOL_TO_UINT8 -> DS_MAP_BOOL_TO_UINT8
CLICKHOUSE_* -> DATASTORE_* (test env vars)
doc links -> docs.hanzo.ai/datastore
This client speaks the NATIVE binary protocol only - there is no HTTP path
and no X-ClickHouse-* header anywhere in it, so the header rename that the
HTTP clients required does not apply and nothing here was broken.
The one string that reaches the wire is CLIENT_NAME, sent by both SendHello
and SendQuery's ClientInfo from a single macro, and it lands in
system.query_log.client_name. Both sites still read the one macro, so they
stay consistent and the server's Hello/Query consistency check is satisfied.
Old rows keep the old name; that is a reporting discontinuity, not a
migration, since nothing keys on it.
CI is repointed at our own server: ghcr.io/hanzoai/datastore:26.2.3.2, the
image production runs. Its entrypoint honours DATASTORE_SKIP_USER_SETUP, not
the CLICKHOUSE_ spelling the compose file used, and its config lives in
/etc/hanzo-datastore-server. ci/docker-compose/config.xml is now layered in
as a config.d drop-in so the image keeps its own white-labelling. That file
and users.xml deliberately keep a <clickhouse> root: it must match the roots
of the drop-ins the image ships, and a mismatch fails silently - the server
logs "Merging bypassed" and starts with every drop-in discarded.
The remote-TLS suites used to default to the third-party host
play.clickhouse.com. They now read DATASTORE_SECURE*_HOST and skip when it is
unset rather than point at a host we do not run.
Dropped as upstream infrastructure with no meaning here: AI_POLICY.md
(upstream's policy about their codebase), .travis.yml (dead CI referencing a
third-party apt repo), cross-repo-bug-relay.yml (relays our issues into an
upstream triage repo). LICENSE keeps its copyright notice, as Apache-2.0
requires.
Verified: cmake configure + 115-target build clean; the full suite is green
against ghcr.io/hanzoai/datastore:26.2.3.2 (894 passed, 0 failed); the
pristine v2.6.2 build run against that same server passes the identical set,
and both logged the same 3914 queries under their respective client names.
264 lines
9.0 KiB
C++
264 lines
9.0 KiB
C++
#include <datastore/columns/array.h>
|
|
#include <datastore/columns/date.h>
|
|
#include <datastore/columns/enum.h>
|
|
#include <datastore/columns/lowcardinality.h>
|
|
#include <datastore/columns/nullable.h>
|
|
#include <datastore/columns/numeric.h>
|
|
#include <datastore/columns/string.h>
|
|
#include <datastore/columns/uuid.h>
|
|
#include <datastore/client.h>
|
|
#include <datastore/base/output.h>
|
|
#include <datastore/base/input.h>
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
#include <string>
|
|
|
|
#include "utils.h"
|
|
#include "utils_performance.h"
|
|
|
|
using namespace datastore;
|
|
|
|
inline std::uint64_t generate(const ColumnUInt64&, size_t index) {
|
|
const auto base = static_cast<std::uint64_t>(index) % 255;
|
|
return base << 7*8 | base << 6*8 | base << 5*8 | base << 4*8 | base << 3*8 | base << 2*8 | base << 1*8 | base;
|
|
}
|
|
|
|
template <size_t RESULT_SIZE=8>
|
|
inline std::string_view generate_string_view(size_t index) {
|
|
static const char result_template[] = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
|
|
"9876543210ZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba"; // to double number of unique combinations
|
|
const auto template_size = sizeof(result_template) - 1;
|
|
|
|
const auto start_pos = index % (template_size - RESULT_SIZE);
|
|
return std::string_view(&result_template[start_pos], RESULT_SIZE);
|
|
}
|
|
|
|
inline std::string_view generate(const ColumnString&, size_t index) {
|
|
// ColumString stores item lengts,and on 1M etnries that builds up to extra 1M bytes,
|
|
// comparing to 8M bytes of serialized data for ColumnFixedString and ColumUInt64.
|
|
// So in order to make comparison mode fair, reducing size of data item.
|
|
return generate_string_view<7>(index);
|
|
}
|
|
|
|
inline std::string_view generate(const ColumnFixedString&, size_t index) {
|
|
return generate_string_view<8>(index);
|
|
}
|
|
|
|
inline std::string_view generate(const ColumnLowCardinalityT<ColumnString>&, size_t index) {
|
|
return generate_string_view<7>(index);
|
|
}
|
|
|
|
inline std::string_view generate(const ColumnLowCardinalityT<ColumnFixedString>&, size_t index) {
|
|
return generate_string_view<8>(index);
|
|
}
|
|
|
|
template <typename ColumnType>
|
|
auto ValidateColumnItems(const ColumnType & col, size_t expected_items) {
|
|
ASSERT_EQ(expected_items, col.Size());
|
|
// validate that appended items match expected
|
|
for (size_t i = 0; i < expected_items; ++i)
|
|
{
|
|
SCOPED_TRACE(i);
|
|
|
|
ASSERT_EQ(col.At(i), generate(col, i));
|
|
ASSERT_EQ(col[i], generate(col, i));
|
|
}
|
|
};
|
|
|
|
template <typename ColumnType>
|
|
ColumnType InstantiateColumn() {
|
|
if constexpr (std::is_same_v<ColumnType, ColumnFixedString>) {
|
|
return ColumnType(8);
|
|
} else if constexpr (std::is_same_v<ColumnType, ColumnLowCardinalityT<ColumnFixedString>>) {
|
|
return ColumnType(8);
|
|
} else {
|
|
return ColumnType();
|
|
}
|
|
}
|
|
|
|
template <typename ColumnType>
|
|
class ColumnPerformanceTest : public ::testing::Test {
|
|
};
|
|
|
|
TYPED_TEST_SUITE_P(ColumnPerformanceTest);
|
|
|
|
// Turns out this is the easiest way to skip test with current version of gtest
|
|
#ifdef NDEBUG
|
|
# define SKIP_IN_DEBUG_BUILDS() (void)(0)
|
|
#else
|
|
# define SKIP_IN_DEBUG_BUILDS() GTEST_SKIP_("Test skipped for DEBUG build...")
|
|
#endif
|
|
|
|
TYPED_TEST_P(ColumnPerformanceTest, SaveAndLoad) {
|
|
SKIP_IN_DEBUG_BUILDS();
|
|
|
|
auto column = InstantiateColumn<TypeParam>();
|
|
using Timer = Timer<std::chrono::microseconds>;
|
|
|
|
const size_t ITEMS_COUNT = 1'000'000;
|
|
const int LOAD_AND_SAVE_REPEAT_TIMES = 10; // run Load() and Save() multiple times to cancel out measurement errors.
|
|
|
|
std::cerr << "\n===========================================================" << std::endl;
|
|
std::cerr << "\t" << ITEMS_COUNT << " items of " << column.Type()->GetName() << std::endl;
|
|
|
|
{
|
|
Timer timer;
|
|
for (size_t i = 0; i < ITEMS_COUNT; ++i) {
|
|
const auto value = generate(column, i);
|
|
column.Append(value);
|
|
}
|
|
|
|
auto elapsed = timer.Elapsed();
|
|
EXPECT_EQ(ITEMS_COUNT, column.Size());
|
|
std::cerr << "Appending:\t" << elapsed << std::endl;
|
|
}
|
|
|
|
{
|
|
Timer timer;
|
|
EXPECT_NO_FATAL_FAILURE(ValidateColumnItems(column, ITEMS_COUNT));
|
|
auto elapsed = timer.Elapsed();
|
|
|
|
std::cerr << "Accessing (twice):\t" << elapsed << std::endl;
|
|
}
|
|
|
|
Buffer buffer;
|
|
|
|
// Save
|
|
{
|
|
Timer::DurationType total{0};
|
|
|
|
for (int i = 0; i < LOAD_AND_SAVE_REPEAT_TIMES; ++i) {
|
|
buffer.clear();
|
|
BufferOutput ostr(&buffer);
|
|
|
|
Timer timer;
|
|
column.Save(&ostr);
|
|
ostr.Flush();
|
|
total += timer.Elapsed();
|
|
}
|
|
const auto elapsed = total / (LOAD_AND_SAVE_REPEAT_TIMES * 1.0);
|
|
|
|
std::cerr << "Saving:\t" << elapsed << std::endl;
|
|
}
|
|
|
|
std::cerr << "Serialized binary size: " << buffer.size() << std::endl;
|
|
|
|
// Load
|
|
{
|
|
Timer::DurationType total{0};
|
|
|
|
for (int i = 0; i < LOAD_AND_SAVE_REPEAT_TIMES; ++i) {
|
|
ArrayInput istr(buffer.data(), buffer.size());
|
|
column.Clear();
|
|
|
|
Timer timer;
|
|
column.Load(&istr, ITEMS_COUNT);
|
|
total += timer.Elapsed();
|
|
}
|
|
const auto elapsed = total / (LOAD_AND_SAVE_REPEAT_TIMES * 1.0);
|
|
|
|
std::cerr << "Loading:\t" << elapsed << std::endl;
|
|
}
|
|
|
|
EXPECT_NO_FATAL_FAILURE(ValidateColumnItems(column, ITEMS_COUNT));
|
|
}
|
|
|
|
TYPED_TEST_P(ColumnPerformanceTest, InsertAndSelect) {
|
|
SKIP_IN_DEBUG_BUILDS();
|
|
|
|
using ColumnType = TypeParam;
|
|
using Timer = Timer<std::chrono::microseconds>;
|
|
|
|
const std::string table_name = "PerformanceTests_ColumnTest";
|
|
const std::string column_name = "column";
|
|
|
|
auto column = InstantiateColumn<ColumnType>();
|
|
Client client(ClientOptions()
|
|
.SetHost( getEnvOrDefault("DATASTORE_HOST", "localhost"))
|
|
.SetPort( std::stoi(getEnvOrDefault("DATASTORE_PORT", "9000")))
|
|
.SetUser( getEnvOrDefault("DATASTORE_USER", "default"))
|
|
.SetPassword( getEnvOrDefault("DATASTORE_PASSWORD", ""))
|
|
.SetDefaultDatabase(getEnvOrDefault("DATASTORE_DB", "default"))
|
|
);
|
|
// client.Execute("CREATE DATABASE IF NOT EXISTS PerformanceTests");
|
|
client.Execute("DROP TEMPORARY TABLE IF EXISTS PerformanceTests_ColumnTest");
|
|
client.Execute("CREATE TEMPORARY TABLE PerformanceTests_ColumnTest (" + column_name + " " + column.Type()->GetName() + ")");
|
|
|
|
const size_t ITEMS_COUNT = 1'000'000;
|
|
|
|
std::cerr << "\n===========================================================" << std::endl;
|
|
std::cerr << "\t" << ITEMS_COUNT << " items of " << column.Type()->GetName() << std::endl;
|
|
|
|
{
|
|
Timer timer;
|
|
for (size_t i = 0; i < ITEMS_COUNT; ++i) {
|
|
const auto value = generate(column, i);
|
|
column.Append(value);
|
|
}
|
|
|
|
auto elapsed = timer.Elapsed();
|
|
std::cerr << "Appending:\t" << elapsed << std::endl;
|
|
}
|
|
EXPECT_EQ(ITEMS_COUNT, column.Size());
|
|
|
|
EXPECT_NO_FATAL_FAILURE(ValidateColumnItems(column, ITEMS_COUNT));
|
|
|
|
{
|
|
Block block;
|
|
block.AppendColumn(column_name, column.Slice(0, ITEMS_COUNT));
|
|
|
|
Timer timer;
|
|
client.Insert(table_name, block);
|
|
auto elapsed = timer.Elapsed();
|
|
std::cerr << "INSERT:\t" << elapsed << std::endl;
|
|
}
|
|
|
|
{
|
|
size_t total_rows = 0;
|
|
Timer timer;
|
|
Timer::DurationType inner_loop_duration{0};
|
|
client.Select("SELECT " + column_name + " FROM " + table_name, [&](const Block & block) {
|
|
Timer timer;
|
|
total_rows += block.GetRowCount();
|
|
if (block.GetRowCount() == 0) {
|
|
return;
|
|
}
|
|
|
|
EXPECT_EQ(1u, block.GetColumnCount());
|
|
const auto col = block[0]->As<ColumnType>();
|
|
|
|
if (col.get() == 0)
|
|
{
|
|
// If server doesn't send response back as LowCardinality(X) but rather like X.
|
|
if constexpr (std::is_base_of_v<ColumnLowCardinality, ColumnType>)
|
|
{
|
|
using NestedColumnType = typename ColumnType::WrappedColumnType;
|
|
EXPECT_NO_FATAL_FAILURE(ValidateColumnItems(*block[0]->As<NestedColumnType>(), ITEMS_COUNT));
|
|
}
|
|
else
|
|
FAIL();
|
|
}
|
|
else
|
|
{
|
|
EXPECT_NO_FATAL_FAILURE(ValidateColumnItems(*col, ITEMS_COUNT));
|
|
}
|
|
inner_loop_duration += timer.Elapsed();
|
|
});
|
|
|
|
auto elapsed = timer.Elapsed() - inner_loop_duration;
|
|
std::cerr << "SELECT:\t" << elapsed << std::endl;
|
|
|
|
ASSERT_EQ(total_rows, ITEMS_COUNT);
|
|
}
|
|
}
|
|
|
|
REGISTER_TYPED_TEST_SUITE_P(ColumnPerformanceTest,
|
|
SaveAndLoad, InsertAndSelect);
|
|
|
|
using SimpleColumnTypes = testing::Types<ColumnUInt64, ColumnString, ColumnFixedString>;
|
|
INSTANTIATE_TYPED_TEST_SUITE_P(SimpleColumns, ColumnPerformanceTest, SimpleColumnTypes);
|
|
|
|
using LowCardinalityColumnTypes = ::testing::Types<ColumnLowCardinalityT<ColumnString>, ColumnLowCardinalityT<ColumnFixedString>>;
|
|
INSTANTIATE_TYPED_TEST_SUITE_P(LowCardinality, ColumnPerformanceTest, LowCardinalityColumnTypes);
|