ClickHouse/dbms/include/DB/Storages/MergeTree/MergeTreeBlockOutputStream.h

42 lines
1.3 KiB
C
Raw Normal View History

2014-03-13 12:48:07 +00:00
#pragma once
#include <DB/Storages/StorageMergeTree.h>
2014-05-08 07:30:00 +00:00
#include <iomanip>
2014-03-13 12:48:07 +00:00
namespace DB
{
class MergeTreeBlockOutputStream : public IBlockOutputStream
{
public:
MergeTreeBlockOutputStream(StorageMergeTree & storage_)
: storage(storage_) {}
2014-03-13 12:48:07 +00:00
void write(const Block & block)
{
auto part_blocks = storage.writer.splitBlockIntoParts(block);
2014-03-13 17:44:00 +00:00
for (auto & current_block : part_blocks)
2014-03-13 12:48:07 +00:00
{
2014-05-16 15:55:57 +00:00
size_t parts_count = storage.data.getMaxPartsCountForMonth();
2014-04-11 16:56:49 +00:00
if (parts_count > storage.data.settings.parts_to_delay_insert)
{
double delay = std::pow(storage.data.settings.insert_delay_step, parts_count - storage.data.settings.parts_to_delay_insert);
delay /= 1000;
2014-05-08 07:30:00 +00:00
delay = std::min(delay, 5 * 60.); /// Ограничим задержку 5 минутами.
LOG_INFO(storage.log, "Delaying inserting block by "
<< std::fixed << std::setprecision(4) << delay << "s because there are " << parts_count << " parts");
2014-04-11 16:56:49 +00:00
std::this_thread::sleep_for(std::chrono::duration<double>(delay));
}
2014-03-13 12:48:07 +00:00
UInt64 temp_index = storage.increment.get();
MergeTreeData::MutableDataPartPtr part = storage.writer.writeTempPart(current_block, temp_index);
storage.data.renameTempPartAndAdd(part, &storage.increment);
2014-03-13 12:48:07 +00:00
}
}
private:
StorageMergeTree & storage;
};
}