OPTIMIZING THE PROCESSING OF IN-LIST ROWS
    1.
    发明申请
    OPTIMIZING THE PROCESSING OF IN-LIST ROWS 有权
    优化内容列表的处理

    公开(公告)号:US20070073676A1

    公开(公告)日:2007-03-29

    申请号:US11535670

    申请日:2006-09-27

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30445 G06F17/30457

    摘要: A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query includes an IN-List. The method includes utilizing an array insert to insert the IN-List into a spool and piggybacking IN-List rows into a join step.

    摘要翻译: 公开了一种用于优化SQL查询的方法,数据库系统和计算机程序,其中SQL查询包括IN列表。 该方法包括利用阵列插入件将IN列表插入到线轴中,并将IN列表行连接到连接步骤中。

    OPTIMIZING A QUERY THAT INCLUDES A LARGE IN LIST
    3.
    发明申请
    OPTIMIZING A QUERY THAT INCLUDES A LARGE IN LIST 审中-公开
    优化一个包含大量列表的查询

    公开(公告)号:US20070130115A1

    公开(公告)日:2007-06-07

    申请号:US11561446

    申请日:2006-11-20

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24535

    摘要: An optimization technique involves optimizing a SQL query, in which the SQL query includes a large IN-List query to access data in a table. The technique includes determining whether an IN-List exceeds a predetermined size, and, if so, removing the IN-List query statement and inserting a new query statement including a join operation.

    摘要翻译: 优化技术涉及优化SQL查询,其中SQL查询包含大型IN-List查询以访问表中的数据。 该技术包括确定IN列表是否超过预定大小,如果是,则删除IN-List查询语句并插入包括连接操作的新查询语句。

    Optimizing access to a database by utilizing a star join
    4.
    发明授权
    Optimizing access to a database by utilizing a star join 有权
    通过利用星形连接来优化对数据库的访问

    公开(公告)号:US07814094B2

    公开(公告)日:2010-10-12

    申请号:US11535615

    申请日:2006-09-27

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30466

    摘要: A database query is optimized for a star database schema that includes at least one fact table and at least one dimension table, where the database query includes an IN-List condition. During optimization, the IN-List is transformed into a relation and the relation is joined with the dimension table to produce a join result. The join result is then joined to the fact table.

    摘要翻译: 为包含至少一个事实表和至少一个维度表的星型数据库模式优化数据库查询,其中数据库查询包含IN-List条件。 在优化期间,将IN列表转换为关系,并将关系与维度表相结合以产生连接结果。 连接结果然后被加入到事实表中。

    Optimizing search trees by increasing success size parameter
    5.
    发明授权
    Optimizing search trees by increasing success size parameter 有权
    使用列表查询优化对数据库的访问

    公开(公告)号:US07882101B2

    公开(公告)日:2011-02-01

    申请号:US11535632

    申请日:2006-09-27

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30442

    摘要: A SQL query that includes an IN-List is optimized by (1) performing an evaluation to determine whether access to a table can be performed as a join operation, (2) converting the IN-List to an IN-LIST relation, and (3) joining the IN-List relation with the table to access the data in the table.

    摘要翻译: 包括IN列表的SQL查询通过以下方式进行优化:(1)执行评估以确定是否可以执行对表的访问作为连接操作,(2)将IN列表转换为IN-LIST关系,以及( 3)加入表中的IN-List关系以访问表中的数据。

    OPTIMIZING ACCESS TO A DATABASE BY UTILIZING A STAR JOIN
    6.
    发明申请
    OPTIMIZING ACCESS TO A DATABASE BY UTILIZING A STAR JOIN 有权
    通过利用STAR加入优化访问数据库

    公开(公告)号:US20070083490A1

    公开(公告)日:2007-04-12

    申请号:US11535615

    申请日:2006-09-27

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30466

    摘要: A database query is optimized for a star database schema that includes at least one fact table and at least one dimension table, where the database query includes an IN-List condition. During optimization, the IN-List is transformed into a relation and the relation is joined with the dimension table to produce a join result. The join result is then joined to the fact table.

    摘要翻译: 为包含至少一个事实表和至少一个维度表的星型数据库模式优化数据库查询,其中数据库查询包括IN-List条件。 在优化期间,将IN列表转换为关系,并将关系与维度表相结合以产生连接结果。 连接结果然后被加入到事实表中。

    OPTIMIZING ACCESS TO A DATABASE
    7.
    发明申请
    OPTIMIZING ACCESS TO A DATABASE 有权
    优化访问数据库

    公开(公告)号:US20070073647A1

    公开(公告)日:2007-03-29

    申请号:US11535632

    申请日:2006-09-27

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30442

    摘要: A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query includes an IN-List. An evaluation is performed to determine whether the IN-List query can be performed as a join operation. If so, a new access path that converting IN-List to a relation, and subsequently joined with the table to complete the IN-List query is cost and competes with other access paths.

    摘要翻译: 公开了一种用于优化SQL查询的方法,数据库系统和计算机程序,其中SQL查询包括IN列表。 执行评估以确定IN-List查询是否可以作为连接操作执行。 如果是这样,将IN-List转换为关系并随后与表结合以完成IN-List查询的新的访问路径是成本并与其他访问路径竞争。

    Selecting a compression technique
    8.
    发明授权
    Selecting a compression technique 有权
    选择压缩技术

    公开(公告)号:US09141632B1

    公开(公告)日:2015-09-22

    申请号:US13719390

    申请日:2012-12-19

    申请人: Bhashyam Ramesh

    发明人: Bhashyam Ramesh

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30153 G06F17/30091

    摘要: Demographics for data are determined. A compression ratio (“CR”) is determined for each of a plurality of compression techniques. CR is a size of the data before compression divided into a predicted size of the data after compression. The predicted size of the data after compression is determined as a function of the determined demographics. An access efficiency of each of the compression techniques is determined as a function of the determined demographics. The compression techniques are ranked by CR and access efficiency. A compression technique is selected based on the ranking. The data is compressed using the selected compression technique. The compressed data is stored.

    摘要翻译: 确定数据的人口统计。 针对多种压缩技术中的每一种确定压缩比(“CR”)。 CR是压缩前的数据的大小,分为压缩后的数据的预测大小。 压缩后的数据的预测大小被确定为确定的人口统计学的函数。 根据所确定的人口统计特征确定每种压缩技术的访问效率。 压缩技术由CR和访问效率排列。 基于排名选择压缩技术。 使用所选的压缩技术对数据进行压缩。 压缩数据被存储。

    Dynamic partition enhanced inequality joining using a value-count index
    9.
    发明授权
    Dynamic partition enhanced inequality joining using a value-count index 有权
    动态分区增强使用数值计数索引的不等式加入

    公开(公告)号:US07873629B1

    公开(公告)日:2011-01-18

    申请号:US10862649

    申请日:2004-06-07

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30498 G06F17/30442

    摘要: Methods, computer programs, and database systems for performing a database query to join a column A and a column B on an inequality condition are disclosed. A database includes value-count indexes for columns A and B. Minimum and a maximum values for A and B are determined, using the value-count indexes for A and B, respectively. The method includes defining three or more sets of values in A and B, relative to the minimum and maximum values for B and A, respectively. The method includes generating one or more Cartesian products between values in A and B. The database query is performed on a set of values in A and a set of values in B to generate a partial query result. The method includes merging one or more Cartesian products and the partial query result.

    摘要翻译: 公开了用于执行数据库查询以在不等式条件下连接列A和列B的方法,计算机程序和数据库系统。 数据库包括A列和B列的值计数索引.A和B的最小值和最大值分别使用A和B的值计数索引确定。 该方法包括相对于B和A的最小值和最大值分别定义A和B中的三组或更多组值。 该方法包括在A和B中的值之间生成一个或多个笛卡尔乘积。数据库查询是在A中的一组值和B中的一组值中执行的,以生成部分查询结果。 该方法包括合并一个或多个笛卡尔乘积和部分查询结果。

    Closed-loop predicate analysis
    10.
    发明授权
    Closed-loop predicate analysis 有权
    闭环谓词分析

    公开(公告)号:US07860858B2

    公开(公告)日:2010-12-28

    申请号:US11328702

    申请日:2006-01-10

    IPC分类号: G06F17/30 G06Q99/00

    CPC分类号: G06F17/30457 G06Q30/0283

    摘要: Processing of a request is optimized. The request has one or more predicates. A list of the one or more predicates in the request is created and predicates for which an actual cost has not been stored or for which a cost cannot be estimated are pruned from the list. An access path for the each of the predicates is selected. The request is processed using the selected access paths producing one or more actual predicate costs. The one or more actual predicate costs are stored.

    摘要翻译: 优化处理请求。 请求具有一个或多个谓词。 创建请求中一个或多个谓词的列表,并创建实际成本尚未存储的谓词,或从列表中修剪成本无法估计的谓词。 选择每个谓词的访问路径。 使用所选择的访问路径处理请求,产生一个或多个实际的谓词成本。 存储一个或多个实际谓词成本。