Halloween Protection in a Multi-Version Database System
    1.
    发明申请
    Halloween Protection in a Multi-Version Database System 有权
    万维网保护多版本数据库系统

    公开(公告)号:US20160048553A1

    公开(公告)日:2016-02-18

    申请号:US14829325

    申请日:2015-08-18

    Abstract: Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record.

    Abstract translation: 减轻与万圣节问题相关的问题,包括更新操作可能允许在操作期间多次访问记录。 一种方法包括访问数据存储操作语句的实例。 执行数据存储操作语句的实例,导致更新或删除到旧版本的数据存储记录或创建数据存储记录,从而在更新或创建数据存储记录的情况下产生新版本的数据存储记录 数据存储记录和数据存储记录的删除版本。 数据存储操作语句的实例与数据存储记录的新版本或数据存储记录的删除版本相关联。

    Computing resource management with fast sorting using vector instructions

    公开(公告)号:US11947963B2

    公开(公告)日:2024-04-02

    申请号:US17712879

    申请日:2022-04-04

    CPC classification number: G06F9/30036 G06F7/08 G06F9/3836

    Abstract: Computing resource management is improved during fast sorting using vector instructions. The process includes: determining a pivot value and a pivot position in a data set (e.g., by sampling with vectors and determining the sample median), determining whether moving data in the sampled portion may be avoided (e.g., if it is constant-valued or already sorted) and, leveraging that determination to possibly avoid unnecessary data movement, sorting the data set. Some examples further determine the microarchitecture version of the computing device performing the sorting and select an implementation of sorting instruction that is tuned for that microarchitecture version (e.g., based on the number of vector registers and motherboard cache configuration). Some examples leverage a soft 3-way quicksort by finding data elements adjacent to the pivot position that also have the pivot value and adding a partition boundary at the end of the set of same-valued data elements.

    Halloween protection in a multi-version database system
    6.
    发明授权
    Halloween protection in a multi-version database system 有权
    多版本数据库系统中的万圣节保护

    公开(公告)号:US09547685B2

    公开(公告)日:2017-01-17

    申请号:US14829325

    申请日:2015-08-18

    Abstract: Mitigating problems related to the Halloween problem including where update operations potentially allow the record to be visited more than once during the operation. A method includes accessing an instance of a data store operation statement. The instance of the data store operation statement is executed causing an update or delete to an old version of data store record or creation of a data store record resulting in a new version of the data store record in the case of an update or creation of a data store record and a deleted version of the data store record in the case of a delete in the data store. The instance of the data store operation statement is correlated with the new version of the data store record or the deleted version of the data store record.

    Abstract translation: 减轻与万圣节问题相关的问题,包括更新操作可能允许在操作期间多次访问记录。 一种方法包括访问数据存储操作语句的实例。 执行数据存储操作语句的实例,导致更新或删除到旧版本的数据存储记录或创建数据存储记录,从而在更新或创建数据存储记录的情况下产生新版本的数据存储记录 数据存储记录和数据存储记录的删除版本。 数据存储操作语句的实例与数据存储记录的新版本或数据存储记录的删除版本相关联。

Patent Agency Ranking