公开(公告)号：US20150066972A1

公开(公告)日：2015-03-05

申请号：US14477296

申请日：2014-09-04

Applicant: Futurewei Technologies, Inc.

Inventor： Yanchen Liu ,  Masood Mortazavi ,  Mengmeng Chen ,  Fang Cao

IPC: G06F17/30

CPC classification number: G06F17/30442 ,  G06F17/30306 ,  G06F17/30433 ,  G06F17/30469 ,  G06F17/30474

Abstract: A method that comprises receiving a logical execution plan for a database query corresponding to a plurality of tables of the database, wherein the logical execution plan comprises one or more operators, receiving an operator cost for each of the operators in the logical execution plan, computing a first accumulated processing cost for a first of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the first table, computing a second accumulated processing cost for a second of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the second table, comparing the first accumulated processing cost and the second accumulated processing cost to determine a table with the highest accumulated processing cost, and responsive to comparing the accumulated processing costs, computing a physical execution plan that requires partitioning the table with the highest accumulated processing cost.

Abstract translation: 一种方法，包括接收与所述数据库的多个表相对应的数据库查询的逻辑执行计划，其中所述逻辑执行计划包括一个或多个运算符，在所述逻辑执行计划中接收每个运算符的运算符成本，运算 基于与第一表相对应的逻辑执行计划，操作员选择性和操作者成本，对于第一表的第一累积处理成本，基于逻辑执行计划，运算符计算第二表的第二累积处理成本 选择性和操作者成本，比较第一累积处理成本和第二累积处理成本以确定具有最高累积处理成本的表，并且响应于比较累积的处理成本，计算需要的物理执行计划 以最高的累积处理成本划分表。

公开(公告)号：US10019478B2

公开(公告)日：2018-07-10

申请号：US14477296

申请日：2014-09-04

Applicant: Futurewei Technologies, Inc.

Inventor： Yanchen Liu ,  Masood Mortazavi ,  Mengmeng Chen ,  Fang Cao

IPC: G06F17/30

CPC classification number: G06F16/2453 ,  G06F16/217 ,  G06F16/24524 ,  G06F16/24545 ,  G06F16/24549

Abstract: A method that comprises receiving a logical execution plan for a database query corresponding to a plurality of tables of the database, wherein the logical execution plan comprises one or more operators, receiving an operator cost for each of the operators in the logical execution plan, computing a first accumulated processing cost for a first of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the first table, computing a second accumulated processing cost for a second of the tables based on the logical execution plan, operator selectivity, and operator costs corresponding to the second table, comparing the first accumulated processing cost and the second accumulated processing cost to determine a table with the highest accumulated processing cost, and responsive to comparing the accumulated processing costs, computing a physical execution plan that requires partitioning the table with the highest accumulated processing cost.