joinoperator.c 15.5 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
/*
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

16
#include "filter.h"
17
#include "executorimpl.h"
18 19 20 21
#include "function.h"
#include "os.h"
#include "querynodes.h"
#include "tcompare.h"
22
#include "tdatablock.h"
23
#include "thash.h"
24
#include "tmsg.h"
25 26
#include "ttypes.h"

H
Haojun Liao 已提交
27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
typedef struct SJoinOperatorInfo {
  SSDataBlock* pRes;
  int32_t      joinType;
  int32_t      inputOrder;

  SSDataBlock* pLeft;
  int32_t      leftPos;
  SColumnInfo  leftCol;

  SSDataBlock* pRight;
  int32_t      rightPos;
  SColumnInfo  rightCol;
  SNode*       pCondAfterMerge;
} SJoinOperatorInfo;

42
static void         setJoinColumnInfo(SColumnInfo* pColumn, const SColumnNode* pColumnNode);
43
static SSDataBlock* doMergeJoin(struct SOperatorInfo* pOperator);
44
static void         destroyMergeJoinOperator(void* param);
45 46 47
static void         extractTimeCondition(SJoinOperatorInfo* pInfo, SOperatorInfo** pDownstream, int32_t numOfDownstream,
                                         SSortMergeJoinPhysiNode* pJoinNode);

S
slzhou 已提交
48 49
static void extractTimeCondition(SJoinOperatorInfo* pInfo, SOperatorInfo** pDownstream, int32_t numOfDownstream,
                                 SSortMergeJoinPhysiNode* pJoinNode) {
50 51 52
  SNode* pMergeCondition = pJoinNode->pMergeCondition;
  if (nodeType(pMergeCondition) == QUERY_NODE_OPERATOR) {
    SOperatorNode* pNode = (SOperatorNode*)pMergeCondition;
S
slzhou 已提交
53 54 55 56
    SColumnNode*   col1 = (SColumnNode*)pNode->pLeft;
    SColumnNode*   col2 = (SColumnNode*)pNode->pRight;
    SColumnNode*   leftTsCol = NULL;
    SColumnNode*   rightTsCol = NULL;
57
    if (col1->dataBlockId == col2->dataBlockId ) {
58 59 60
      leftTsCol = col1;
      rightTsCol = col2;
    } else {
61 62 63 64 65 66 67 68 69 70
      if (col1->dataBlockId == pDownstream[0]->resultDataBlockId) {
        ASSERT(col2->dataBlockId == pDownstream[1]->resultDataBlockId);
        leftTsCol = col1;
        rightTsCol = col2;
      } else {
        ASSERT(col1->dataBlockId == pDownstream[1]->resultDataBlockId);
        ASSERT(col2->dataBlockId == pDownstream[0]->resultDataBlockId);
        leftTsCol = col2;
        rightTsCol = col1;
      }
71 72 73 74 75
    }
    setJoinColumnInfo(&pInfo->leftCol, leftTsCol);
    setJoinColumnInfo(&pInfo->rightCol, rightTsCol);
  } else {
    ASSERT(false);
76
  }}
77

78 79
SOperatorInfo* createMergeJoinOperatorInfo(SOperatorInfo** pDownstream, int32_t numOfDownstream,
                                           SSortMergeJoinPhysiNode* pJoinNode, SExecTaskInfo* pTaskInfo) {
80 81
  SJoinOperatorInfo* pInfo = taosMemoryCalloc(1, sizeof(SJoinOperatorInfo));
  SOperatorInfo*     pOperator = taosMemoryCalloc(1, sizeof(SOperatorInfo));
H
Haojun Liao 已提交
82 83

  int32_t code = TSDB_CODE_SUCCESS;
84
  if (pOperator == NULL || pInfo == NULL) {
H
Haojun Liao 已提交
85
    code = TSDB_CODE_OUT_OF_MEMORY;
86 87 88
    goto _error;
  }

H
Haojun Liao 已提交
89
  int32_t      numOfCols = 0;
H
Haojun Liao 已提交
90
  SSDataBlock* pResBlock = createDataBlockFromDescNode(pJoinNode->node.pOutputDataBlockDesc);
H
Haojun Liao 已提交
91
  SExprInfo*   pExprInfo = createExprInfo(pJoinNode->pTargets, NULL, &numOfCols);
92
  initResultSizeInfo(&pOperator->resultInfo, 4096);
93

94
  pInfo->pRes = pResBlock;
H
Haojun Liao 已提交
95 96

  setOperatorInfo(pOperator, "MergeJoinOperator", QUERY_NODE_PHYSICAL_PLAN_MERGE_JOIN, false, OP_NOT_OPENED, pInfo, pTaskInfo);
97 98
  pOperator->exprSupp.pExprInfo = pExprInfo;
  pOperator->exprSupp.numOfExprs = numOfCols;
99

100
  extractTimeCondition(pInfo, pDownstream, numOfDownstream, pJoinNode);
101

102 103
  if (pJoinNode->pOnConditions != NULL && pJoinNode->node.pConditions != NULL) {
    pInfo->pCondAfterMerge = nodesMakeNode(QUERY_NODE_LOGIC_CONDITION);
H
Haojun Liao 已提交
104 105 106 107 108
    if (pInfo->pCondAfterMerge == NULL) {
      code = TSDB_CODE_OUT_OF_MEMORY;
      goto _error;
    }

109 110
    SLogicConditionNode* pLogicCond = (SLogicConditionNode*)(pInfo->pCondAfterMerge);
    pLogicCond->pParameterList = nodesMakeList();
H
Haojun Liao 已提交
111 112 113 114 115
    if (pLogicCond->pParameterList == NULL) {
      code = TSDB_CODE_OUT_OF_MEMORY;
      goto _error;
    }

116 117 118 119 120 121 122 123 124
    nodesListMakeAppend(&pLogicCond->pParameterList, nodesCloneNode(pJoinNode->pOnConditions));
    nodesListMakeAppend(&pLogicCond->pParameterList, nodesCloneNode(pJoinNode->node.pConditions));
    pLogicCond->condType = LOGIC_COND_TYPE_AND;
  } else if (pJoinNode->pOnConditions != NULL) {
    pInfo->pCondAfterMerge = nodesCloneNode(pJoinNode->pOnConditions);
  } else if (pJoinNode->node.pConditions != NULL) {
    pInfo->pCondAfterMerge = nodesCloneNode(pJoinNode->node.pConditions);
  } else {
    pInfo->pCondAfterMerge = NULL;
125 126
  }

H
Haojun Liao 已提交
127 128 129 130 131
  code = filterInitFromNode(pInfo->pCondAfterMerge, &pOperator->exprSupp.pFilterInfo, 0);
  if (code != TSDB_CODE_SUCCESS) {
    goto _error;
  }

132
  pInfo->inputOrder = TSDB_ORDER_ASC;
133
  if (pJoinNode->inputTsOrder == ORDER_ASC) {
134
    pInfo->inputOrder = TSDB_ORDER_ASC;
135
  } else if (pJoinNode->inputTsOrder == ORDER_DESC) {
136
    pInfo->inputOrder = TSDB_ORDER_DESC;
137 138
  }

139
  pOperator->fpSet = createOperatorFpSet(optrDummyOpenFn, doMergeJoin, NULL, destroyMergeJoinOperator, optrDefaultBufFn, NULL);
H
Haojun Liao 已提交
140
  code = appendDownstream(pOperator, pDownstream, numOfDownstream);
141 142 143 144 145 146
  if (code != TSDB_CODE_SUCCESS) {
    goto _error;
  }

  return pOperator;

147
_error:
H
Haojun Liao 已提交
148 149 150 151
  if (pInfo != NULL) {
    destroyMergeJoinOperator(pInfo);
  }

152
  taosMemoryFree(pOperator);
H
Haojun Liao 已提交
153
  pTaskInfo->code = code;
154 155 156 157 158 159 160 161 162 163 164
  return NULL;
}

void setJoinColumnInfo(SColumnInfo* pColumn, const SColumnNode* pColumnNode) {
  pColumn->slotId = pColumnNode->slotId;
  pColumn->type = pColumnNode->node.resType.type;
  pColumn->bytes = pColumnNode->node.resType.bytes;
  pColumn->precision = pColumnNode->node.resType.precision;
  pColumn->scale = pColumnNode->node.resType.scale;
}

165
void destroyMergeJoinOperator(void* param) {
166
  SJoinOperatorInfo* pJoinOperator = (SJoinOperatorInfo*)param;
167
  nodesDestroyNode(pJoinOperator->pCondAfterMerge);
168

S
shenglian zhou 已提交
169
  pJoinOperator->pRes = blockDataDestroy(pJoinOperator->pRes);
D
dapan1121 已提交
170
  taosMemoryFreeClear(param);
171
}
172 173

static void mergeJoinJoinLeftRight(struct SOperatorInfo* pOperator, SSDataBlock* pRes, int32_t currRow,
174 175
                                   SSDataBlock* pLeftBlock, int32_t leftPos, SSDataBlock* pRightBlock,
                                   int32_t rightPos) {
176 177 178 179 180 181 182 183 184 185 186 187
  SJoinOperatorInfo* pJoinInfo = pOperator->info;

  for (int32_t i = 0; i < pOperator->exprSupp.numOfExprs; ++i) {
    SColumnInfoData* pDst = taosArrayGet(pRes->pDataBlock, i);

    SExprInfo* pExprInfo = &pOperator->exprSupp.pExprInfo[i];

    int32_t blockId = pExprInfo->base.pParam[0].pCol->dataBlockId;
    int32_t slotId = pExprInfo->base.pParam[0].pCol->slotId;
    int32_t rowIndex = -1;

    SColumnInfoData* pSrc = NULL;
H
Haojun Liao 已提交
188
    if (pLeftBlock->info.id.blockId == blockId) {
189 190
      pSrc = taosArrayGet(pLeftBlock->pDataBlock, slotId);
      rowIndex = leftPos;
191
    } else {
192 193
      pSrc = taosArrayGet(pRightBlock->pDataBlock, slotId);
      rowIndex = rightPos;
194
    }
195

196 197 198 199 200 201 202 203
    if (colDataIsNull_s(pSrc, rowIndex)) {
      colDataAppendNULL(pDst, currRow);
    } else {
      char* p = colDataGetData(pSrc, rowIndex);
      colDataAppend(pDst, currRow, p, false);
    }
  }
}
204
typedef struct SRowLocation {
205 206
  SSDataBlock* pDataBlock;
  int32_t      pos;
207 208
} SRowLocation;

209
// pBlock[tsSlotId][startPos, endPos) == timestamp,
S
shenglian zhou 已提交
210
static int32_t mergeJoinGetBlockRowsEqualTs(SSDataBlock* pBlock, int16_t tsSlotId, int32_t startPos, int64_t timestamp,
211
                                            int32_t* pEndPos, SArray* rowLocations, SArray* createdBlocks) {
212 213
  int32_t numRows = pBlock->info.rows;
  ASSERT(startPos < numRows);
S
shenglian zhou 已提交
214
  SColumnInfoData* pCol = taosArrayGet(pBlock->pDataBlock, tsSlotId);
215 216

  int32_t i = startPos;
217
  for (; i < numRows; ++i) {
218
    char* pNextVal = colDataGetData(pCol, i);
219
    if (timestamp != *(int64_t*)pNextVal) {
220 221 222 223
      break;
    }
  }
  int32_t endPos = i;
S
shenglian zhou 已提交
224
  *pEndPos = endPos;
225

226 227 228 229
  if (endPos - startPos == 0) {
    return 0;
  }

230
  SSDataBlock* block = pBlock;
S
slzhou 已提交
231
  bool         createdNewBlock = false;
S
shenglian zhou 已提交
232
  if (endPos == numRows) {
S
slzhou 已提交
233
    block = blockDataExtractBlock(pBlock, startPos, endPos - startPos);
S
shenglian zhou 已提交
234
    taosArrayPush(createdBlocks, &block);
235
    createdNewBlock = true;
236
  }
237
  SRowLocation location = {0};
238 239
  for (int32_t j = startPos; j < endPos; ++j) {
    location.pDataBlock = block;
S
slzhou 已提交
240
    location.pos = (createdNewBlock ? j - startPos : j);
241
    taosArrayPush(rowLocations, &location);
242 243 244
  }
  return 0;
}
245

246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
// whichChild == 0, left child of join; whichChild ==1, right child of join
static int32_t mergeJoinGetDownStreamRowsEqualTimeStamp(SOperatorInfo* pOperator, int32_t whichChild, int16_t tsSlotId,
                                                        SSDataBlock* startDataBlock, int32_t startPos,
                                                        int64_t timestamp, SArray* rowLocations,
                                                        SArray* createdBlocks) {
  ASSERT(whichChild == 0 || whichChild == 1);

  SJoinOperatorInfo* pJoinInfo = pOperator->info;
  int32_t            endPos = -1;
  SSDataBlock*       dataBlock = startDataBlock;
  mergeJoinGetBlockRowsEqualTs(dataBlock, tsSlotId, startPos, timestamp, &endPos, rowLocations, createdBlocks);
  while (endPos == dataBlock->info.rows) {
    SOperatorInfo* ds = pOperator->pDownstream[whichChild];
    dataBlock = ds->fpSet.getNextFn(ds);
    if (whichChild == 0) {
      pJoinInfo->leftPos = 0;
      pJoinInfo->pLeft = dataBlock;
    } else if (whichChild == 1) {
      pJoinInfo->rightPos = 0;
      pJoinInfo->pRight = dataBlock;
    }

    if (dataBlock == NULL) {
      setTaskStatus(pOperator->pTaskInfo, TASK_COMPLETED);
      endPos = -1;
      break;
    }
273

274 275 276 277 278 279 280 281 282
    mergeJoinGetBlockRowsEqualTs(dataBlock, tsSlotId, 0, timestamp, &endPos, rowLocations, createdBlocks);
  }
  if (endPos != -1) {
    if (whichChild == 0) {
      pJoinInfo->leftPos = endPos;
    } else if (whichChild == 1) {
      pJoinInfo->rightPos = endPos;
    }
  }
283 284 285
  return 0;
}

286 287 288 289 290 291 292 293
static int32_t mergeJoinJoinDownstreamTsRanges(SOperatorInfo* pOperator, int64_t timestamp, SSDataBlock* pRes,
                                               int32_t* nRows) {
  SJoinOperatorInfo* pJoinInfo = pOperator->info;
  SArray*            leftRowLocations = taosArrayInit(8, sizeof(SRowLocation));
  SArray*            leftCreatedBlocks = taosArrayInit(8, POINTER_BYTES);

  SArray* rightRowLocations = taosArrayInit(8, sizeof(SRowLocation));
  SArray* rightCreatedBlocks = taosArrayInit(8, POINTER_BYTES);
294
  int32_t code = TSDB_CODE_SUCCESS;
295 296 297 298 299 300 301
  mergeJoinGetDownStreamRowsEqualTimeStamp(pOperator, 0, pJoinInfo->leftCol.slotId, pJoinInfo->pLeft,
                                           pJoinInfo->leftPos, timestamp, leftRowLocations, leftCreatedBlocks);
  mergeJoinGetDownStreamRowsEqualTimeStamp(pOperator, 1, pJoinInfo->rightCol.slotId, pJoinInfo->pRight,
                                           pJoinInfo->rightPos, timestamp, rightRowLocations, rightCreatedBlocks);

  size_t leftNumJoin = taosArrayGetSize(leftRowLocations);
  size_t rightNumJoin = taosArrayGetSize(rightRowLocations);
302 303
  code = blockDataEnsureCapacity(pRes, *nRows + leftNumJoin * rightNumJoin);
  if (code != TSDB_CODE_SUCCESS) {
H
Hongze Cheng 已提交
304 305
    qError("%s can not ensure block capacity for join. left: %zu, right: %zu", GET_TASKID(pOperator->pTaskInfo),
           leftNumJoin, rightNumJoin);
306 307
  }
  if (code == TSDB_CODE_SUCCESS) {
H
Hongze Cheng 已提交
308 309 310 311 312 313 314
    for (int32_t i = 0; i < leftNumJoin; ++i) {
      for (int32_t j = 0; j < rightNumJoin; ++j) {
        SRowLocation* leftRow = taosArrayGet(leftRowLocations, i);
        SRowLocation* rightRow = taosArrayGet(rightRowLocations, j);
        mergeJoinJoinLeftRight(pOperator, pRes, *nRows, leftRow->pDataBlock, leftRow->pos, rightRow->pDataBlock,
                               rightRow->pos);
        ++*nRows;
315
      }
H
Hongze Cheng 已提交
316
    }
317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333
  }

  for (int i = 0; i < taosArrayGetSize(rightCreatedBlocks); ++i) {
    SSDataBlock* pBlock = taosArrayGetP(rightCreatedBlocks, i);
    blockDataDestroy(pBlock);
  }
  taosArrayDestroy(rightCreatedBlocks);
  taosArrayDestroy(rightRowLocations);
  for (int i = 0; i < taosArrayGetSize(leftCreatedBlocks); ++i) {
    SSDataBlock* pBlock = taosArrayGetP(leftCreatedBlocks, i);
    blockDataDestroy(pBlock);
  }
  taosArrayDestroy(leftCreatedBlocks);
  taosArrayDestroy(leftRowLocations);
  return TSDB_CODE_SUCCESS;
}

334 335
static bool mergeJoinGetNextTimestamp(SOperatorInfo* pOperator, int64_t* pLeftTs, int64_t* pRightTs) {
  SJoinOperatorInfo* pJoinInfo = pOperator->info;
336

337 338 339
  if (pJoinInfo->pLeft == NULL || pJoinInfo->leftPos >= pJoinInfo->pLeft->info.rows) {
    SOperatorInfo* ds1 = pOperator->pDownstream[0];
    pJoinInfo->pLeft = ds1->fpSet.getNextFn(ds1);
340

341 342 343 344
    pJoinInfo->leftPos = 0;
    if (pJoinInfo->pLeft == NULL) {
      setTaskStatus(pOperator->pTaskInfo, TASK_COMPLETED);
      return false;
345
    }
346
  }
347

348 349 350
  if (pJoinInfo->pRight == NULL || pJoinInfo->rightPos >= pJoinInfo->pRight->info.rows) {
    SOperatorInfo* ds2 = pOperator->pDownstream[1];
    pJoinInfo->pRight = ds2->fpSet.getNextFn(ds2);
351

352 353 354 355
    pJoinInfo->rightPos = 0;
    if (pJoinInfo->pRight == NULL) {
      setTaskStatus(pOperator->pTaskInfo, TASK_COMPLETED);
      return false;
356
    }
357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373
  }
  // only the timestamp match support for ordinary table
  SColumnInfoData* pLeftCol = taosArrayGet(pJoinInfo->pLeft->pDataBlock, pJoinInfo->leftCol.slotId);
  char*            pLeftVal = colDataGetData(pLeftCol, pJoinInfo->leftPos);
  *pLeftTs = *(int64_t*)pLeftVal;

  SColumnInfoData* pRightCol = taosArrayGet(pJoinInfo->pRight->pDataBlock, pJoinInfo->rightCol.slotId);
  char*            pRightVal = colDataGetData(pRightCol, pJoinInfo->rightPos);
  *pRightTs = *(int64_t*)pRightVal;

  ASSERT(pLeftCol->info.type == TSDB_DATA_TYPE_TIMESTAMP);
  ASSERT(pRightCol->info.type == TSDB_DATA_TYPE_TIMESTAMP);
  return true;
}

static void doMergeJoinImpl(struct SOperatorInfo* pOperator, SSDataBlock* pRes) {
  SJoinOperatorInfo* pJoinInfo = pOperator->info;
374

375
  int32_t nrows = pRes->info.rows;
376

377
  bool asc = (pJoinInfo->inputOrder == TSDB_ORDER_ASC) ? true : false;
378

379 380 381
  while (1) {
    int64_t leftTs = 0;
    int64_t rightTs = 0;
382
    bool    hasNextTs = mergeJoinGetNextTimestamp(pOperator, &leftTs, &rightTs);
383 384 385
    if (!hasNextTs) {
      break;
    }
386

387
    if (leftTs == rightTs) {
388
      mergeJoinJoinDownstreamTsRanges(pOperator, leftTs, pRes, &nrows);
H
Haojun Liao 已提交
389
    } else if ((asc && leftTs < rightTs) || (!asc && leftTs > rightTs)) {
390 391 392 393 394
      pJoinInfo->leftPos += 1;

      if (pJoinInfo->leftPos >= pJoinInfo->pLeft->info.rows) {
        continue;
      }
H
Haojun Liao 已提交
395
    } else if ((asc && leftTs > rightTs) || (!asc && leftTs < rightTs)) {
396 397 398 399 400 401 402 403 404 405 406 407
      pJoinInfo->rightPos += 1;
      if (pJoinInfo->rightPos >= pJoinInfo->pRight->info.rows) {
        continue;
      }
    }

    // the pDataBlock are always the same one, no need to call this again
    pRes->info.rows = nrows;
    if (pRes->info.rows >= pOperator->resultInfo.threshold) {
      break;
    }
  }
408 409 410 411
}

SSDataBlock* doMergeJoin(struct SOperatorInfo* pOperator) {
  SJoinOperatorInfo* pJoinInfo = pOperator->info;
412

413 414 415 416 417 418 419 420 421 422
  SSDataBlock* pRes = pJoinInfo->pRes;
  blockDataCleanup(pRes);
  blockDataEnsureCapacity(pRes, 4096);
  while (true) {
    int32_t numOfRowsBefore = pRes->info.rows;
    doMergeJoinImpl(pOperator, pRes);
    int32_t numOfNewRows = pRes->info.rows - numOfRowsBefore;
    if (numOfNewRows == 0) {
      break;
    }
H
Haojun Liao 已提交
423 424
    if (pOperator->exprSupp.pFilterInfo != NULL) {
      doFilter(pRes, pOperator->exprSupp.pFilterInfo, NULL);
425
    }
426 427 428 429
    if (pRes->info.rows >= pOperator->resultInfo.threshold) {
      break;
    }
  }
430 431
  return (pRes->info.rows > 0) ? pRes : NULL;
}