中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

10 records (took 0.012 seconds)

    Mechanism for optimizing parallel execution of queries on symmetric resources
    1.
    发明授权
    Mechanism for optimizing parallel execution of queries on symmetric resources 有权

    公开(公告)号：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.

    SYSTEM AND METHOD FOR COLUMN-SPECIFIC MATERIALIZATION SCHEDULING
    3.
    发明申请
    SYSTEM AND METHOD FOR COLUMN-SPECIFIC MATERIALIZATION SCHEDULING 审中-公开
    用于柱特异性材料化调度的系统和方法

    公开(公告)号：US20150269202A1

    公开(公告)日：2015-09-24

    申请号：US14663210

    申请日：2015-03-19

    Applicant: Futurewei Technologies, Inc.

    Inventor： Chi Young Ku ,  Ron-Chung Hu ,  Mengmeng Chen

    IPC: G06F17/30

    CPC classification number: G06F17/30315 ,  G06F17/30463 ,  G06F17/30598 ,  G06F17/30864 ,  G06F17/30935

    Abstract: A method of dynamically computing an optimal materialization schedule for each column in a column oriented RDBMS. Dynamic column-specific materialization scheduling in a distributed column oriented RDBMS is optimized by choosing a materialization strategy based on execution cost including central processing unit (CPU), disk, and network costs for each individual exchange operator. The dynamic programming approach is computationally feasible because the optimal schedule for a sub-plan is path independent.

    Abstract translation: 一种动态计算面向列的RDBMS中每列的最优实现时间表的方法。 通过选择基于执行成本的实现策略，优化了基于分布式列的RDBMS中的动态列特定实现调度，包括每个单独交换运算符的中央处理单元（CPU），磁盘和网络成本。 动态规划方法在计算上是可行的，因为子计划的最优调度是路径独立的。

    Managing lock or latch in concurrent execution of queries
    6.
    发明授权
    Managing lock or latch in concurrent execution of queries 有权

    公开(公告)号：US09898476B2

    公开(公告)日：2018-02-20

    申请号：US14161388

    申请日：2014-01-22

    Applicant: Futurewei Technologies Inc.

    Inventor： Masood Mortazavi ,  Mengmeng Chen ,  Aniket Adnaik

    IPC: G06F17/30 ,  G06F9/52

    CPC classification number: G06F17/30117 ,  G06F9/522 ,  G06F17/30362 ,  G06F17/30584

    Abstract: Various disclosed embodiments include methods and systems for managing lock or latch chains in concurrent execution of database queries. A method includes receiving a plurality of transactions, each transaction associated with one or more queuing requests. The method includes, for each transaction, determining one or more partition sets. Each partition set corresponds to one or more database partitions needed for the transaction. The one or more database partitions are included within a partitioned database. The method includes, for each transaction, determining one or more queues needed for the transaction and storing a bitmap representation of the one or more queues needed for the transaction. The one or more queues needed for the transaction correspond to the one or more database partitions needed for the transaction.

    MANAGING LOCK OR LATCH IN CONCURRENT EXECUTION OF QUERIES
    7.
    发明申请
    MANAGING LOCK OR LATCH IN CONCURRENT EXECUTION OF QUERIES 有权
    在相互执行的查询中管理锁定或锁定

    公开(公告)号：US20150205812A1

    公开(公告)日：2015-07-23

    申请号：US14161388

    申请日：2014-01-22

    Applicant: Futurewei Technologies Inc.

    Inventor： Masood Mortazavi ,  Mengmeng Chen ,  Aniket Adnaik

    IPC: G06F17/30 ,  G06F9/46

    CPC classification number: G06F17/30117 ,  G06F9/522 ,  G06F17/30362 ,  G06F17/30584

    Abstract: Various disclosed embodiments include methods and systems for managing lock or latch chains in concurrent execution of database queries. A method includes receiving a plurality of transactions, each transaction associated with one or more queuing requests. The method includes, for each transaction, determining one or more partition sets. Each partition set corresponds to one or more database partitions needed for the transaction. The one or more database partitions are included within a partitioned database. The method includes, for each transaction, determining one or more queues needed for the transaction and storing a bitmap representation of the one or more queues needed for the transaction. The one or more queues needed for the transaction correspond to the one or more database partitions needed for the transaction.

    Abstract translation: 各种公开的实施例包括用于在并行执行数据库查询时管理锁或锁链的方法和系统。 一种方法包括接收与一个或多个排队请求相关联的每个事务的多个事务。 对于每个事务，该方法包括确定一个或多个分区集。 每个分区集对应于事务所需的一个或多个数据库分区。 一个或多个数据库分区包含在分区数据库中。 该方法包括针对每个事务确定事务所需的一个或多个队列，并且存储该事务所需的一个或多个队列的位图表示。 事务所需的一个或多个队列对应于事务所需的一个或多个数据库分区。

    PIPELINED RE-SHUFFLING FOR DISTRIBUTED COLUMN STORE
    9.
    发明申请
    PIPELINED RE-SHUFFLING FOR DISTRIBUTED COLUMN STORE 审中-公开
    用于分销柱存储的流水线重新分配

    公开(公告)号：US20150220571A1

    公开(公告)日：2015-08-06

    申请号：US14610574

    申请日：2015-01-30

    Applicant: Futurewei Technologies, Inc.

    Inventor： Chi Young Ku ,  Mengmeng Chen ,  Ron-Chung Hu ,  Masood Mortazavi ,  Fang Cao

    IPC: G06F17/30

    CPC classification number: G06F16/284 ,  G06F16/2453

    Abstract: A method of pipelining re-shuffled data of a distributed column oriented relational database management system (RDBMS). A request is received from a consumer process that requires RDBMS column data to be shuffled in a specific order according to an order that each of a plurality of columns will be used by the consumer process. For each of the plurality of columns, the method re-shuffles the RDBMS column data according to the specific order to form re-shuffled RDBMS column data, and sends the re-shuffled RDBMS column data to the consumer process.

    Abstract translation: 一种流水线分布式列关联数据库管理系统（RDBMS）的重新混洗数据的方法。 从消费者进程接收到要求RDBMS列数据按照消费者进程将使用多个列中的每一列的特定顺序进行混洗的请求。 对于多个列中的每一列，该方法根据特定顺序重新混洗RDBMS列数据，以形成重新混洗的RDBMS列数据，并将重新混洗的RDBMS列数据发送到消费者进程。

    Mechanism for Optimizing Parallel Execution of Queries on Symmetric Resources
    10.
    发明申请
    Mechanism for Optimizing Parallel Execution of Queries on Symmetric Resources 有权
    优化并行执行对称资源查询的机制

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

Patent Agency Ranking