DELETED DATABASE RECORD REUSE
    3.
    发明申请

    公开(公告)号:US20160314151A1

    公开(公告)日:2016-10-27

    申请号:US14691678

    申请日:2015-04-21

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30309

    摘要: A computer-implemented method for reusing deleted database records includes, receiving, by a database manager executing within a computing device, a first query request to insert, into a database table, a first set of database records. The database manager identifies a first set of entries within a journal log bundle. The database manager also determines, in response to identifying a first set of entries, that there is a third set of deleted database records located on a same page as a second set of database records. The database manager also, in response to determining that there is a third set of deleted database records located on a same page as the second set of database records, inserts into the database table the first set of database records using the third set of deleted database records.

    Storing changes made toward a limit
    5.
    发明授权
    Storing changes made toward a limit 有权
    将更改存储到限制

    公开(公告)号:US09317546B2

    公开(公告)日:2016-04-19

    申请号:US13874529

    申请日:2013-05-01

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30312 G06F17/30138

    摘要: A program identifier, a limit identifier, a minimum value, and an increment value are stored to limit data. The limit identifier identifies a first variable used by the program. In response to storing a data value to a second variable, the stored limit identifier is found and a determination is made whether the stored limit identifier identifies the second variable. If the stored limit identifier identifies the second variable, a determination is made whether the data value is greater than the minimum value. If the data value is greater than the minimum value, the data value is stored to a log if an absolute value of the data value minus a most recently logged data value that was previously stored to the second variable is greater than the increment value. The execution of the program is halted or a user is notified in response to the storing to the log.

    摘要翻译: 存储节目标识符,限制标识符,最小值和增量值以限制数据。 限制标识符标识程序使用的第一个变量。 响应于将数据值存储到第二变量,找到存储的限制标识符,并且确定存储的限制标识符是否识别第二变量。 如果存储的限制标识符识别第二变量,则确定数据值是否大于最小值。 如果数据值大于最小值,则如果数据值的绝对值减去先前存储到第二个变量的最近记录的数据值,则该数据值将被存储到日志中。 响应于对日志的存储,中止程序的执行或通知用户。

    STORING CHANGES MADE TOWARD A LIMIT
    6.
    发明申请
    STORING CHANGES MADE TOWARD A LIMIT 有权
    存储变化达到限制

    公开(公告)号:US20140330823A1

    公开(公告)日:2014-11-06

    申请号:US13874529

    申请日:2013-05-01

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30312 G06F17/30138

    摘要: A program identifier, a limit identifier, a minimum value, and an increment value are stored to limit data. The limit identifier identifies a first variable used by the program. In response to storing a data value to a second variable, the stored limit identifier is found and a determination is made whether the stored limit identifier identifies the second variable. If the stored limit identifier identifies the second variable, a determination is made whether the data value is greater than the minimum value. If the data value is greater than the minimum value, the data value is stored to a log if an absolute value of the data value minus a most recently logged data value that was previously stored to the second variable is greater than the increment value. The execution of the program is halted or a user is notified in response to the storing to the log.

    摘要翻译: 存储节目标识符,限制标识符,最小值和增量值以限制数据。 限制标识符标识程序使用的第一个变量。 响应于将数据值存储到第二变量,找到存储的限制标识符,并且确定存储的限制标识符是否识别第二变量。 如果存储的限制标识符识别第二变量,则确定数据值是否大于最小值。 如果数据值大于最小值,则如果数据值的绝对值减去先前存储到第二个变量的最近记录的数据值,则该数据值将被存储到日志中。 响应于对日志的存储,中止程序的执行或通知用户。

    Blockchain: automatic fork protection

    公开(公告)号:US11042873B2

    公开(公告)日:2021-06-22

    申请号:US16207744

    申请日:2018-12-03

    摘要: Systems and methods for providing automatic fork protection including determining that a transaction having fork protection was included in a first block that was appended to a blockchain, that a hash of the first block was validated, that a consensus decision was made by validator nodes approving the first block for addition to the blockchain, that a second block was appended to the blockchain after the first block, that the second block comprises a hash that is not based on the first block, that the first block was on a first fork and the second block was on a second fork, that the blockchain was resolved in favor of the second fork, and that the transaction failed as a result of the blockchain being resolved in favor of the second fork. The method including compensating a party that submitted the failed transaction based on the fork protection.

    RESULT SET OUTPUT CRITERIA
    8.
    发明申请

    公开(公告)号:US20190340179A1

    公开(公告)日:2019-11-07

    申请号:US16516289

    申请日:2019-07-19

    IPC分类号: G06F16/2455

    摘要: A structured query language (SQL) query is configured to present a selected portion of a result set to a user interface. The selected portion of the result set can be based on an offset criteria appended to the SQL query. The offset criteria determines a location of a first presented instance of the selected portion of the result set. The offset criteria is configured to determine the location of the first presented instance of the selected portion of the result set independent of a number of instances appearing between a first instance of the result set and the first presented instance of the selected portion of the result set.

    Generating multiple query access plans for multiple computing environments

    公开(公告)号:US10108665B2

    公开(公告)日:2018-10-23

    申请号:US14734503

    申请日:2015-06-09

    IPC分类号: G06F17/30 G06F11/20

    摘要: A first database management system (DBMS) running on first computer having a first set of computing resources determines that with respect to the first set of computing resources a first query access plan for executing a query satisfies a set of query optimization criteria. A determination is then made that with respect to a second set of computing resources the first query access plan fails a set of preliminary criteria. In response to this failure determination, a second query access plan for executing the query is generated. Prior to having a second DBMS running on a second computer having the second set of computing resources receive a request to execute the query, a determination is made that with respect to the second set of computing resources the second query access plan satisfies the set query optimization criteria.