Sequenced modifications of multiple rows in a temporal table
    21.
    发明授权
    Sequenced modifications of multiple rows in a temporal table 有权
    在时间表中对多行进行了顺序修改

    公开(公告)号:US08666956B1

    公开(公告)日:2014-03-04

    申请号:US12969795

    申请日:2010-12-16

    IPC分类号: G06F17/30

    摘要: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row. Applying the next of the ordered plurality of Source table rows includes creating an RDIFF row being the same as the Target table row except the ValidTime of the RDIFF row is set to RDIFF range. A second of the ordered plurality of Source table rows d) is applied by applying c) to the RDIFF row as the Target table row.

    摘要翻译: SEQUENCED请求a)将时间源表应用于谓词下的时间目标表。 源表包含多个行,这些行有资格应用于谓词下的单个目标表行。 谓词指定了源表连接列。 多个源表行和单个目标表行中的每一个包括一个有效时间维度。 多个源表行是b)由源表连接列排序并进行修改。 通过确定目标表行具有TransactionTime并且作为响应关闭目标表行的TransactionTime,应用下一个排序的多个源表行。 应用下一个有序的多个源表行包括将RDIFF范围标识为正在应用的源表行的周期,该时间段晚于单个目标表行的ValidTime范围。 应用下一个有序的多个源表行包括创建与目标表行相同的RDIFF行,但RDIFF行的有效时间值被设置为RDIFF范围。 通过将c)应用到RDIFF行作为目标表行来应用订购的多个源表行d)中的第二行。

    Deciding whether to cache a generic plan for executing a request based on a system performance metric
    22.
    发明授权
    Deciding whether to cache a generic plan for executing a request based on a system performance metric 有权
    决定是否缓存基于系统性能指标执行请求的通用计划

    公开(公告)号:US08621482B1

    公开(公告)日:2013-12-31

    申请号:US12205380

    申请日:2008-09-05

    IPC分类号: G06F9/46 G06F7/00

    摘要: A method, computer program, and database system are disclosed. A plurality of instances of a request to a database system are received. All instances of the request have a same set of variables to use in executing the request. The values of the variables are supplied by data in a data source. A specific plan for executing one instance of the request is generated. Generating the specific plan includes taking into account data in the data source. The specific plan is executed on the database system. A system run-time metric and a parsing time for executing the specific plan are captured and saved. A generic plan is generated and cached based on a comparison of the system run-time metric and the parsing time for executing the specific plan.

    摘要翻译: 公开了一种方法,计算机程序和数据库系统。 接收到对数据库系统的请求的多个实例。 请求的所有实例都有一组相同的变量用于执行请求。 变量的值由数据源中的数据提供。 生成用于执行请求的一个实例的具体计划。 生成具体计划包括考虑数据源中的数据。 具体计划在数据库系统上执行。 捕获并保存用于执行特定计划的系统运行时度量和解析时间。 基于系统运行时间度量和执行特定计划的解析时间的比较,生成和缓存通用计划。

    Commit-time timestamping of temporal rows
    23.
    发明授权
    Commit-time timestamping of temporal rows 有权
    时间行的提交时间戳

    公开(公告)号:US08301934B1

    公开(公告)日:2012-10-30

    申请号:US12425692

    申请日:2009-04-17

    IPC分类号: G06F11/00

    CPC分类号: G06F17/30705

    摘要: A base table temporal row affected by a transaction is timestamped. The temporal row has a row ID. The temporal row in the base table is modified according to the transaction. The row ID for the modified temporal row is associated with an identifier for the transaction in a temporal work table. Upon committing the transaction: the temporal work table is searched to determine the row ID of the temporal row modified by the transaction, and a commit-time is saved into the temporal row identified by the row ID.

    摘要翻译: 受事务影响的基表时间行是时间戳的。 时间行有行ID。 根据交易修改基表中的时间行。 修改的时间行的行ID与时间工作表中的事务的标识符相关联。 在提交事务时:搜索时间工作表以确定由事务修改的时间行的行ID,并将提交时间保存到由行ID标识的时间行中。

    Method and system for performing logical partial declustering
    24.
    发明授权
    Method and system for performing logical partial declustering 有权
    执行逻辑部分去聚簇的方法和系统

    公开(公告)号:US08005836B2

    公开(公告)日:2011-08-23

    申请号:US11622595

    申请日:2007-01-12

    IPC分类号: G06F17/30

    摘要: A method and system for performing logical partial declustering in a shared-nothing database environment. The solution defines a partial declustering technique that can be used to dynamically adapt the declustering of base tables or intermediate result sets. The partial declustering technique is defined to limit the number of partitions (P) involved in an operation. The technique is defined to limit the operation to a subset of the system partitioning map (SPM). There are two components: the association between the data values and partitions is altered by restricting the data values to P′ partition values where P′ is less than P; and the actual partitions of the SPM selected are then derived based on a seed derived from a dynamic parameter, such as a session number, or a static parameter, such as a table identifier. In the case of intermediate result sets the number of P′ partitions selected is a cost based decision based on the estimated number of rows in the input intermediate result sets. In the case of a base table the number of P′ partitions is selected based on the table DDL. There is no physical partitioning definitions, rather logical partitions are defined based on subsetting the SPM.

    摘要翻译: 一种用于在无共享数据库环境中执行逻辑部分去聚簇的方法和系统。 该解决方案定义了一种部分去聚簇技术,可用于动态调整基表或中间结果集的去聚类。 定义了部分去聚类技术来限制操作中涉及的分区(P)的数量。 该技术被定义为将操作限制为系统分区映射(SPM)的子集。 有两个组件:通过将数据值限制为P'小于P的P'分区值来改变数据值和分区之间的关联; 并且然后基于从诸如会话号码的动态参数或诸如表标识符的静态参数导出的种子导出所选择的SPM的实际分区。 在中间结果集的情况下,所选择的P'分区的数量是基于输入中间结果集中的估计行数的基于成本的决定。 在基表的情况下,根据表DDL选择P'分区的数量。 没有物理分区定义,而是基于子集SPM来定义逻辑分区。

    Database system
    25.
    发明授权
    Database system 有权
    数据库系统

    公开(公告)号:US07792809B2

    公开(公告)日:2010-09-07

    申请号:US11608407

    申请日:2006-12-08

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30445

    摘要: There is provided a parallel database system 1. System 1 includes a storage device 2 for maintaining a plurality of rows 3. System 1 also includes a plurality of access modules 4 for accessing in parallel a respectively assigned one or more of rows 3. An interface 5 receives data 6 indicative of a table 7 defined by a selection 8 of rows 3. A processor 9 is responsive to data 6 for selectively designating table 7 to be a single-module table. In this single module table, selection 8 is collectively assigned to an owning one of modules 4, indicated by reference numeral 10.

    摘要翻译: 提供了并行数据库系统1.系统1包括用于维持多行3的存储装置2.系统1还包括多个访问模块4,用于并行地访问分配给一个或多个行3的接口 5接收指示由行3的选择8定义的表7的数据6.处理器9响应于数据6,用于选择性地将表7指定为单模块表。 在该单个模块表中,选择8被共同地分配给由附图标记10表示的模块4中的所有一个。

    SOFTWARE UPDATE SYSTEM AND METHOD
    27.
    发明申请
    SOFTWARE UPDATE SYSTEM AND METHOD 有权
    软件更新系统和方法

    公开(公告)号:US20090064123A1

    公开(公告)日:2009-03-05

    申请号:US11849500

    申请日:2007-09-04

    IPC分类号: G06F9/44

    CPC分类号: G06F8/65

    摘要: There is provided a method, system and computer program for updating at least one component in a multi-component software application. The method includes receiving application data describing characteristics of the software application, receiving update data describing at least one update applicable to the software application and reviewing the application data and update data to determine whether the at least one update is applied to the software application.

    摘要翻译: 提供了一种用于在多组件软件应用程序中更新至少一个组件的方法,系统和计算机程序。 所述方法包括接收描述所述软件应用的特征的应用数据,接收描述适用于所述软件应用的至少一个更新的更新数据,以及查看所述应用数据和更新数据以确定所述至少一个更新是否应用于所述软件应用。

    DATABASE SYSTEM
    28.
    发明申请
    DATABASE SYSTEM 审中-公开
    数据库系统

    公开(公告)号:US20070143244A1

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

    申请号:US11608362

    申请日:2006-12-08

    IPC分类号: G06F17/30

    CPC分类号: G06F16/24561

    摘要: There is provided a database system 1 including a source cluster, in the form of a source clique 2, for providing a clique shared spool file 3. This spool file is provided for consumption by a target module 4 belonging to a target cluster, in the form of a target clique 5. A node interconnect 6 receives of spool 3, and exports the spool for consumption by module 4.

    摘要翻译: 提供了数据库系统1,其包括以源组2的形式的源集群,用于提供集体共享假脱机文件3。 该假脱机文件被提供为目标组5的形式的属于目标集群的目标模块4的消耗。 节点互连6接收线轴3,并且导出线轴以供模块4消耗。

    Optimizing an equi-join operation using a bitmap index structure
    29.
    发明授权
    Optimizing an equi-join operation using a bitmap index structure 有权
    使用位图索引结构优化等式连接操作

    公开(公告)号:US07092954B1

    公开(公告)日:2006-08-15

    申请号:US10038673

    申请日:2001-12-31

    申请人: Bhashyam Ramesh

    发明人: Bhashyam Ramesh

    IPC分类号: G06F17/00

    摘要: A method, computer program and database system are disclosed for joining a plurality of tables T1 through TN, where each of the tables has an associated Star Map, S1 through SN, respectively. Each Star Map includes bitmap entries having locations indexed by the hash of one or more values associated with one or more join key columns of its associated table. A bitmap entry in a Star Map, if set, indicates the presence of a row in its associated table that has entries in the one or more join key columns that together hash to the location of the bitmap entry. The method includes a) performing a Boolean operation using the bitmap entries of the Star Maps S1 through SN to produce a join Star Map SJ, b) using SJ to select rows from the tables T1 through TN, and c) joining the resulting rows to produce a join result.

    摘要翻译: 公开了一种用于连接多个表T 1至TN的方法,计算机程序和数据库系统,其中每个表分别具有相关联的星图,S1至SN。 每个星图包括位图条目,其位置由与其关联表的一个或多个连接键列相关联的一个或多个值的散列值索引。 星图中的位图条目(如果设置)指示在其关联表中存在一行,该行中的一个或多个连接键列中的条目一起哈希到位图条目的位置。 该方法包括:a)使用星图S 1至SN的位图条目执行布尔运算以产生连接星图SJ,b)使用SJ从表T 1至TN中选择行,以及c)将所得到的结果 行以产生连接结果。

    Optimizing an outer join operation using a bitmap index structure
    30.
    发明授权
    Optimizing an outer join operation using a bitmap index structure 有权
    使用位图索引结构优化外连接操作

    公开(公告)号:US06957222B1

    公开(公告)日:2005-10-18

    申请号:US10038849

    申请日:2001-12-31

    申请人: Bhashyam Ramesh

    发明人: Bhashyam Ramesh

    IPC分类号: G06F17/00 G06F17/30

    摘要: A method, computer program and database system are disclosed for performing an outer join of at least a first table T1 and a second table T2. The join has join conditions. Each of the tables has an associated Star Map, S1 and S2, respectively. Each Star Map includes bitmap entries which have locations indexed by the hash of one or more values associated with one or more join key columns of its associated table. A bitmap entry in a Star Map, if set, indicates the presence of a row in its associated table that has entries in the one or more join key columns that together hash to the location of the bitmap entry. The method, computer program and database system include a) performing one or more Boolean operations using the bitmap entries of the Star Maps S1 and S2 to produce set bitmap entries in a Star Map SJ where there is a corresponding set bitmap entry in S1 and a corresponding set bitmap entry in S2, b) selecting a row from table T1 and hashing the combined entries in the one or more join key columns of the selected T1 row to identify a bitmap entry in SJ, and c) if the identified bitmap entry in SJ is not set, projecting the selected T1 row with a NULL corresponding to data from table T2. If d) the identified bitmap entry in SJ is set, performing the following: d1) if no row in T2 satisfies the join conditions and has entries in its one or more join key columns that together hash to the location of the identified set bitmap entry in SJ, projecting the selected T1 row and a NULL corresponding to data from table T2, d2) otherwise, for each row from T2 that satisfies the join condition and has entries in its one or more join key columns that together hash to the location of the identified set bitmap entry in SJ, projecting the selected T1 row with data from the row from T2, and e) repeating b)-d) for all rows in T1.

    摘要翻译: 公开了一种用于执行至少第一表T1和第二表T2的外连接的方法,计算机程序和数据库系统。 连接有连接条件。 每个表分别具有相关联的星图,S1和S2。 每个星图包括位图条目,其位置由与关联表的一个或多个连接键列相关联的一个或多个值的散列进行索引。 星图中的位图条目(如果设置)指示在其关联表中存在一行,该行中的一个或多个连接键列中的条目一起哈希到位图条目的位置。 方法,计算机程序和数据库系统包括:a)使用星图S1和S2的位图条目执行一个或多个布尔运算,以在星图SJ中产生设置的位图条目,其中S1中存在相应的设置位图条目, b)从表T1中选择一行,并在所选择的T1行的一个或多个连接密钥列中散列组合的条目,以标识SJ中的位图条目,以及c)如果识别的位图条目在 未设置SJ,将所选择的T1行与对应于表T2的数据的NULL进行投影。 如果d)设置了SJ中识别的位图条目,则执行以下操作:d1)如果T2中没有行满足连接条件,并且在其一个或多个连接键列中的条目一起散列到所标识的集合位图条目的位置 在SJ中投影所选择的T1行和对应于来自表T2的数据的空值d2)否则,对于满足连接条件的T2的每一行,并且在其一个或多个连接键列中的条目一起散列到 在SJ中识别的设置位图条目,将来自T2的行的数据投影到所选择的T1行,以及e)对T1中的所有行重复b)-d)。