公开(公告)号：US08214352B2

公开(公告)日：2012-07-03

申请号：US12625482

申请日：2009-11-24

Applicant: Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

Inventor： Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30463

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for modular query optimizer. In one aspect, a method includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于模块化查询优化器。 在一个方面，一种方法包括从数据库查询中的每个表的一组投影中选择一个或多个投影，其中所选择的表中的每个选择的投影导致与未被选择的查询相比估计的较低执行成本 预测 基于计算机网络中的站点中的一个或多个所选择的投影的数据分布来生成用于查询的连接订单，其中所述连接顺序反映应用于所述查询的一个或多个联接的输出的数据分发操作的不同组合; 并且基于使用成本模型对连接订单的评估从连接订单中选择连接顺序。

公开(公告)号：US08312027B2

公开(公告)日：2012-11-13

申请号：US13489094

申请日：2012-06-05

Applicant: Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

Inventor： Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30463

Abstract: Computer programs encoded on a computer storage medium provide for a modular query optimizer. In one aspect, a computer program product includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract translation: 在计算机存储介质上编码的计算机程序提供模块化查询优化器。 在一个方面，计算机程序产品包括从数据库查询中的每个表的一组投影中选择一个或多个投影，其中对于表的每个所选择的投影导致查询的估计较低的执行成本，与非非 选择投影 基于计算机网络中的站点中的一个或多个所选择的投影的数据分布来生成用于查询的连接订单，其中所述连接顺序反映应用于所述查询的一个或多个联接的输出的数据分发操作的不同组合; 并且基于使用成本模型对连接订单的评估从连接订单中选择连接顺序。

公开(公告)号：US20120246147A1

公开(公告)日：2012-09-27

申请号：US13489094

申请日：2012-06-05

Applicant: Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

Inventor： Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30463

Abstract: Computer programs encoded on a computer storage medium provide for a modular query optimizer. In one aspect, a computer program product includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract translation: 在计算机存储介质上编码的计算机程序提供模块化查询优化器。 在一个方面，计算机程序产品包括从数据库查询中的每个表的一组投影中选择一个或多个投影，其中对于表的每个所选择的投影导致查询的估计较低的执行成本，与非非 选择投影 基于计算机网络中的站点中的一个或多个所选择的投影的数据分布来生成用于查询的连接订单，其中所述连接顺序反映应用于所述查询的一个或多个联接的输出的数据分发操作的不同组合; 并且基于使用成本模型对连接订单的评估从连接订单中选择连接顺序。

公开(公告)号：US20100131490A1

公开(公告)日：2010-05-27

申请号：US12625482

申请日：2009-11-24

Applicant: Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

Inventor： Andrew Lamb ,  Lakshmikant Shrinivas ,  Shilpa Lawande ,  Mitch Cherniack ,  Nga Tran

IPC: G06F17/30

CPC classification number: G06F17/30424 ,  G06F17/30463

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for modular query optimizer. In one aspect, a method includes selecting one or more projections from a set of projections for each table in a database query wherein each of the selected projections for the table has leads to an estimated lower execution cost for the query as compared to non-selected projections; generating join orders for the query based on data distribution of one or more of the selected projections among sites in a computer network wherein the join orders reflect different combinations of data distribution operations applied to the output of one or more of the query's joins; and selecting a join order from the join orders based on evaluation of the join orders using a cost model.

Abstract translation: 方法，系统和装置，包括在计算机存储介质上编码的计算机程序，用于模块化查询优化器。 在一个方面，一种方法包括从数据库查询中的每个表的一组投影中选择一个或多个投影，其中所选择的表中的每个选择的投影导致与未被选择的查询相比估计的较低执行成本 预测 基于计算机网络中的站点中的一个或多个所选择的投影的数据分布来生成用于查询的连接订单，其中所述连接顺序反映应用于所述查询的一个或多个联接的输出的数据分发操作的不同组合; 并且基于使用成本模型对连接订单的评估从连接订单中选择连接顺序。

公开(公告)号：US20120290559A1

公开(公告)日：2012-11-15

申请号：US13469641

申请日：2012-05-11

Applicant: Matthew Steven Fuller ,  Andrew Allinson Lamb ,  Lakshmikant Shrinivas

Inventor： Matthew Steven Fuller ,  Andrew Allinson Lamb ,  Lakshmikant Shrinivas

IPC: G06F17/30

CPC classification number: G06F17/30498

Abstract: A query that is submitted to a database is analyzed so as to determine a join order restriction. The join order restriction is associated with a join between two tables of a plurality of tables of the database that participate in the query. The join order restriction constrains its associated join to be executed prior to another join of the query. At least one join plan is generated, the join plan being constrained by the join order restriction. Different join plans include different join orders. A join plan is selected from among the join plans for execution of the query.

Abstract translation: 分析提交给数据库的查询，以确定连接顺序限制。 连接顺序限制与参与查询的数据库的多个表的两个表之间的连接相关联。 连接顺序限制约束其关联的连接以在查询的另一个连接之前执行。 生成至少一个连接计划，连接计划受连接顺序限制约束。 不同的连接计划包括不同的连接订单。 从执行查询的连接计划中选择一个连接计划。

公开(公告)号：US09934280B2

公开(公告)日：2018-04-03

申请号：US13469641

申请日：2012-05-11

Applicant: Matthew Steven Fuller ,  Andrew Allinson Lamb ,  Lakshmikant Shrinivas

Inventor： Matthew Steven Fuller ,  Andrew Allinson Lamb ,  Lakshmikant Shrinivas

IPC: G06F17/30

CPC classification number: G06F17/30498

Abstract: A query that is submitted to a database is analyzed so as to determine a join order restriction. The join order restriction is associated with a join between two tables of a plurality of tables of the database that participate in the query. The join order restriction constrains its associated join to be executed prior to another join of the query. At least one join plan is generated, the join plan being constrained by the join order restriction. Different join plans include different join orders. A join plan is selected from among the join plans for execution of the query.

公开(公告)号：US20120117054A1

公开(公告)日：2012-05-10

申请号：US13291711

申请日：2011-11-08

Applicant: Lakshmikant Shrinivas ,  Sreenath Bodagala ,  Matthew Steven Fuller ,  Charles Edward Bear

Inventor： Lakshmikant Shrinivas ,  Sreenath Bodagala ,  Matthew Steven Fuller ,  Charles Edward Bear

IPC: G06F17/30

CPC classification number: G06F16/24537 ,  G06F16/24545

Abstract: A method of analyzing an expression to infer output data properties, comprises storing, in a storage device, a root node “e” in R, in which “e” is an expression and R is a root node of an abstract syntax tree (AST) of the expression “e”, storing a number of child nodes of R into C1, . . . Cn, with a processor coupled to the storage device, calling analyze(Ci), storing output properties of expression C into Pi I, and determining if any of the child nodes Ci in {C1 . . . Cn} has not been analyzed, in which if the last child node has been analyzed, with the processor, calling compute-output-properties(R, P1, . . . Pn), storing, in the storage device, the result in Poutput, and returning Poutput as the output properties of the expression “e.”

Abstract translation: 一种分析表达式以推断输出数据属性的方法，包括在存储设备中存储R中的根节点“e”，其中“e”是表达式，R是抽象语法树（AST）的根节点 ）表示“e”，将多个子节点存入C1。 。 。 Cn，其中处理器耦合到存储设备，调用分析（Ci），将表达式C的输出属性存储到Pi I中，以及确定{C1中是否有任何子节点Ci。 。 。 Cn}没有被分析，其中如果最后一个子节点已经被分析，则与处理器一起调用计算输出属性（R，P1，... Pn），在存储设备中存储Poutput中的结果 ，并返回Poutput作为表达式“e”的输出属性。

公开(公告)号：US10380269B2

公开(公告)日：2019-08-13

申请号：US13155232

申请日：2011-06-07

Applicant: Chuck Bear ,  Lakshmikant Shrinivas ,  Andrew Lamb

Inventor： Chuck Bear ,  Lakshmikant Shrinivas ,  Andrew Lamb

IPC: G06F17/30

Abstract: Methods, systems and program products for query optimization using sideways information passing. In one implementation, a join clause in a query is identified that specifies an outer table of tuples to be joined with an inner table, the outer table having one or more attributes, and each of the attributes of the outer table having values stored in an attribute file that is distinct from attribute files in which the values of other attributes are stored. A plan for the query is created which, when executed, causes selection of a subset of tuples of the outer table to serve as input to the join clause in place of the outer table based on one or more predicates applied to the inner table.

公开(公告)号：US09116947B2

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

申请号：US13421761

申请日：2012-03-15

Applicant: Matthew Steven Fuller ,  Mingsheng Hong ,  Hongmin Fan ,  Andrew Allinson Lamb ,  William F. Mann ,  Lakshmikant Shrinivas

Inventor： Matthew Steven Fuller ,  Mingsheng Hong ,  Hongmin Fan ,  Andrew Allinson Lamb ,  William F. Mann ,  Lakshmikant Shrinivas

IPC: G06F17/30

CPC classification number: G06F17/30424

Abstract: A record-pattern expression of a record pattern of data records is translated to a character-pattern expression of a character pattern. A data-record series of data records is converted to a character string in which each character in the character string corresponds to a respective data record in the data-record series. Pattern instances of the character pattern in the character string are searched to identify ordinal character positions in the character string of characters in the character pattern instances. Data records at ordinal record positions in the record series of data records corresponding to the ordinal character positions are reported.

Abstract translation: 数据记录的记录模式的记录模式表达式被转换为字符模式的字符模式表达。 数据记录系列的数据记录被转换为字符串，其中字符串中的每个字符对应于数据记录系列中的相应数据记录。 搜索字符串中字符模式的模式实例以识别字符模式实例中字符字符串中的顺序字符位置。 报告对应于序数字符位置的记录数据记录系列中的顺序记录位置的数据记录。

公开(公告)号：US08805811B2

公开(公告)日：2014-08-12

申请号：US13459760

申请日：2012-04-30

Applicant: Lakshmikant Shrinivas ,  Hongmin Fan ,  Charles Edward Bear ,  Andrew Allinson Lamb

Inventor： Lakshmikant Shrinivas ,  Hongmin Fan ,  Charles Edward Bear ,  Andrew Allinson Lamb

IPC: G06F17/30

CPC classification number: G06F17/30312 ,  G06F17/30469 ,  G06F17/30943

Abstract: A method for executing a user-defined function on a plurality of input database tuples. The method may include causing a processor to invoke the function once; and to compute results of the function for the plurality of database tuples.

Abstract translation: 一种用于在多个输入数据库元组上执行用户定义函数的方法。 该方法可以包括使处理器调用该功能一次; 并计算多个数据库元组的函数的结果。