中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

75 records (took 0.021 seconds)

    Efficient determination of committed changes
    51.
    发明授权
    Efficient determination of committed changes 有权

    公开(公告)号：US10248685B2

    公开(公告)日：2019-04-02

    申请号：US15253626

    申请日：2016-08-31

    Applicant: Oracle International Corporation

    Inventor： Kartik Kulkarni ,  Juan R. Loaiza ,  Vivekanandhan Raja ,  Kothanda Umamageswaran ,  Sanket Hase ,  Vasudha Krishnaswamy ,  Tirthankar Lahiri

    IPC: G06F17/30

    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.

    Generating and applying redo records
    55.
    发明授权
    Generating and applying redo records 有权
    生成和应用重做记录

    公开(公告)号：US08977597B2

    公开(公告)日：2015-03-10

    申请号：US14073832

    申请日：2013-11-06

    Applicant: Oracle International Corporation

    Inventor： Amit Ganesh ,  Juan R. Loaiza ,  Krishna Kunchithapadam

    IPC: G06F17/30 ,  G06F11/14

    CPC classification number: G06F11/1474 ,  G06F17/30

    Abstract: Techniques for maintaining a cascading index are provided. In one approach, one or more branch node compression techniques are applied to the main index of a cascading index. In an approach, a Bloom filter is generated and associated with, e.g., a branch node in the main index. The Bloom filter is used to determine whether, without accessing any leaf blocks, a particular key value exists, e.g., in leaf blocks associated with the branch node. In an approach, a new redo record is generated in response to a merge operation between two levels of the cascading index. The new redo record comprises (a) one or more addresses of blocks that are affected by the merge operation, (b) data is that being “pushed down” to a lower level of the cascading index, and (c) one or more addresses of blocks that are written to storage as a result of the merge operation.

    Abstract translation: 提供了维护级联索引的技术。 在一种方法中，一个或多个分支节点压缩技术被应用于级联索引的主索引。 在一种方法中，生成Bloom过滤器并与例如主索引中的分支节点相关联。 Bloom过滤器用于确定在不访问任何叶片块的情况下是否存在特定的键值，例如在与分支节点相关联的叶片块中。 在一种方法中，响应于级联索引的两个级别之间的合并操作，生成新的重做记录。 新的重做记录包括（a）受合并操作影响的块的一个或多个地址，（b）数据被“下推”到级联索引的较低级，以及（c）一个或多个地址 作为合并操作的结果写入存储器的块。

    Storage-side storage request management
    56.
    发明授权
    Storage-side storage request management 有权
    存储端存储请求管理

    公开(公告)号：US08874807B2

    公开(公告)日：2014-10-28

    申请号：US13971158

    申请日：2013-08-20

    Applicant: Oracle International Corporation

    Inventor： Sue K. Lee ,  Vivekananda C. Kolla ,  Akshay D. Shah ,  Sumanta Chatterjee ,  Margaret Susairaj ,  Juan R. Loaiza ,  Alexander Tsukerman ,  Sridhar Subramaniam

    IPC: G06F3/00 ,  G06F3/06 ,  G06F17/30 ,  G06F12/00

    CPC classification number: G06F17/30498 ,  G06F3/0611 ,  G06F3/0659 ,  G06F3/067 ,  G06F12/00 ,  G06F17/3033 ,  G06F17/30492

    Abstract: Techniques are provided for managing, within a storage system, the sequence in which I/O requests are processed by the storage system based, at least in part, on one or more logical characteristics of the I/O requests. The logical characteristics may include, for example, the identity of the user for whom the I/O request was submitted, the service that submitted the I/O request, the database targeted by the I/O request, an indication of a consumer group to which the I/O request maps, the reason why the I/O request was issued, a priority category of the I/O request, etc. Techniques are also provided for automatically establishing a scheduling policy within a storage system, and for dynamically changing the scheduling policy in response to changes in workload.

    Abstract translation: 提供了技术，用于至少部分地基于I / O请求的一个或多个逻辑特性在存储系统内管理由存储系统处理I / O请求的序列。 逻辑特征可以包括例如提交I / O请求的用户的身份，提交I / O请求的服务，I / O请求所针对的数据库，消费者组的指示 I / O请求映射到哪里，发出I / O请求的原因，I / O请求的优先类别等。还提供了用于在存储系统内自动建立调度策略，并且为了动态地 根据工作负载的变化改变调度策略。

    Supporting blockchain collections in a database
    60.
    发明授权
    Supporting blockchain collections in a database 有权

    公开(公告)号：US11640391B2

    公开(公告)日：2023-05-02

    申请号：US16923279

    申请日：2020-07-08

    Applicant: Oracle International Corporation

    Inventor： Juan R. Loaiza ,  Wei-Ming Hu ,  Amrish Srivastava ,  Mahesh Baburao Girkar ,  James W. Stamos ,  Sachin Sonawane

    IPC: G06F16/23 ,  G06F16/2455 ,  H04L9/06 ,  G06F16/22 ,  H04L9/00

    Abstract: Herein are high throughput techniques for incorporating cryptographic blockchains into relational data. In an embodiment, a computer indicates, in a database dictionary in a database, that a relational table is for blockchain storage. The relational table contains application column(s). In response to that indication, the relational table is associated with system column(s) that are unmodifiable by administrators and clients of the database. The system column(s) include a cryptographic hash column. A request to store a particular value in a particular application column is received from a client. In response to receiving the request, a cryptographic hash value is calculated for a new row for the relational table. In the relational table, the computer stores the new row that contains: the particular value in the particular application column, and the cryptographic hash value in the cryptographic hash column.

Patent Agency Ranking