lbug 0.16.1

An in-process property graph database management system built for query speed and scalability
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

#include "processor/operator/base_partitioner_shared_state.h"

#include "storage/table/node_table.h"
#include "transaction/transaction.h"

namespace lbug::processor {
void PartitionerSharedState::initialize(const common::logical_type_vec_t&,
    common::idx_t numPartitioners, const main::ClientContext* clientContext) {
    DASSERT(numPartitioners >= 1 && numPartitioners <= DIRECTIONS);
    auto transaction = transaction::Transaction::Get(*clientContext);
    numNodes[0] = srcNodeTable->getNumTotalRows(transaction);
    if (numPartitioners > 1) {
        numNodes[1] = dstNodeTable->getNumTotalRows(transaction);
    }
    numPartitions[0] = getNumPartitionsFromRows(numNodes[0]);
    if (numPartitioners > 1) {
        numPartitions[1] = getNumPartitionsFromRows(numNodes[1]);
    }
}

common::partition_idx_t PartitionerSharedState::getNextPartition(common::idx_t partitioningIdx) {
    auto nextPartitionIdxToReturn = nextPartitionIdx++;
    if (nextPartitionIdxToReturn >= numPartitions[partitioningIdx]) {
        return common::INVALID_PARTITION_IDX;
    }
    return nextPartitionIdxToReturn;
}

common::partition_idx_t PartitionerSharedState::getNumPartitionsFromRows(common::offset_t numRows) {
    return (numRows + common::StorageConfig::NODE_GROUP_SIZE - 1) /
           common::StorageConfig::NODE_GROUP_SIZE;
}

void PartitionerSharedState::resetState(common::idx_t) {
    nextPartitionIdx = 0;
}
} // namespace lbug::processor