中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

75 records (took 0.022 seconds)

    DIRECTLY MAPPED BUFFER CACHE ON NON-VOLATILE MEMORY
    12.
    发明申请
    DIRECTLY MAPPED BUFFER CACHE ON NON-VOLATILE MEMORY 审中-公开

    公开(公告)号：US20190065383A1

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

    申请号：US15693273

    申请日：2017-08-31

    Applicant: Oracle International Corporation

    Inventor： Juan R. Loaiza ,  J. William Lee ,  Wei-Ming Hu ,  Kothanda Umamageswaran ,  Neil J.S. MacNaughton ,  Adam Y. Lee

    IPC: G06F12/0873 ,  G06F17/30

    Abstract: A method and apparatus for implementing a buffer cache for a persistent file system in non-volatile memory is provided. A set of data is maintained in one or more extents in non-volatile random-access memory (NVRAM) of a computing device. At least one buffer header is allocated in dynamic random-access memory (DRAM) of the computing device. In response to a read request by a first process executing on the computing device to access one or more first data blocks in a first extent of the one or more extents, the first process is granted direct read access of the first extent in NVRAM. A reference to the first extent in NVRAM is stored in a first buffer header. The first buffer header is associated with the first process. The first process uses the first buffer header to directly access the one or more first data blocks in NVRAM.

    AUTOMATIC CACHING OF SCAN AND RANDOM ACCESS DATA IN COMPUTING SYSTEMS
    13.
    发明申请
    AUTOMATIC CACHING OF SCAN AND RANDOM ACCESS DATA IN COMPUTING SYSTEMS 审中-公开
    计算机系统中扫描和随机访问数据的自动访问

    公开(公告)号：US20150088805A1

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

    申请号：US14489221

    申请日：2014-09-17

    Applicant: Oracle International Corporation

    Inventor： Sarat B. Kakarla ,  Jia Shi ,  Selcuk Aya ,  Kothanda Umamageswaran ,  Juan R. Loaiza

    IPC: G06F17/30 ,  G06F12/08

    CPC classification number: G06F17/3048 ,  G06F17/30306 ,  G06F17/30592

    Abstract: Approaches, techniques, and mechanisms are disclosed for improved caching in database systems that deal with multiple data access patterns, such as in database systems that interface with both OLTP and Data Warehouse clients. A cache is deployed between a database server and a storage system that stores data units. Some of the data units accessed by the database server are buffered within the cache. The data units may be associated with data access patterns, such as a random data access pattern or a scan data access pattern, in accordance with which the database server is or appears to be accessing the data units. A processor selects when to cache data units accessed by the database server, based at least on the associated data access patterns. Recent access counts may also be stored for the data units, and may further be utilized to select when to cache data units.

    Abstract translation: 披露了处理多种数据访问模式的数据库系统中的改进缓存的方法，技术和机制，例如在与OLTP和数据仓库客户端接口的数据库系统中。 缓存部署在数据库服务器和存储数据单元的存储系统之间。 数据库服务器访问的一些数据单元被缓存在缓存内。 数据单元可以与诸如随机数据访问模式或扫描数据访问模式的数据访问模式相关联，数据库服务器根据该数据访问模式或者似乎正在访问数据单元。 处理器至少基于相关联的数据访问模式来选择什么时候来高速缓存由数据库服务器访问的数据单元。 也可以为数据单元存储最近的访问计数，并且还可以用于选择何时高速缓存数据单元。

    User-specified chains and row versions in a blockchain table
    14.
    发明授权
    User-specified chains and row versions in a blockchain table 有权

    公开(公告)号：US12182100B2

    公开(公告)日：2024-12-31

    申请号：US18476207

    申请日：2023-09-27

    Applicant: Oracle International Corporation

    Inventor： Juan R. Loaiza ,  Sachin Vijakumar Sonawane ,  Mahesh Baburao Girkar ,  Wei-Ming Hu

    IPC: G06F16/22 ,  G06F16/23

    Abstract: A blockchain object stores multiple user blockchains, each blockchain comprising an ordered set of records in the blockchain object. The records of a user blockchain have the same blockchain key value. Users can create multiple blockchains by establishing respective blockchain key values for the blockchains. Like blocks in a blockchain, the records in a user blockchain are ordered by a sequence of numbers that is specific to the user blockchain; each user blockchain has its own sequence of numbers. Each record in a user blockchain holds a sequence number in a field of the blockchain object. An efficient mechanism maintains and assigns a sequence number to a record when appended to a user blockchain.

    System and method for transaction continuity across failures in a scale-out database
    17.
    发明授权
    System and method for transaction continuity across failures in a scale-out database 有权

    公开(公告)号：US11599421B2

    公开(公告)日：2023-03-07

    申请号：US17137745

    申请日：2020-12-30

    Applicant: Oracle International Corporation

    Inventor： Ajit Mylavarapu ,  Vasudha Krishnaswamy ,  Sukhada Pendse ,  Solmaz Kolahi ,  Ankita Kumar ,  Garret F. Swart ,  Tirthankar Lahiri ,  Juan R. Loaiza

    IPC: G06F16/22 ,  G06F11/14

    Abstract: A shared-nothing database system is provided in which parallelism and workload balancing are increased by assigning the rows of each table to “slices”, and storing multiple copies (“duplicas”) of each slice across the persistent storage of multiple nodes of the shared-nothing database system. When the data for a table is distributed among the nodes of a shared-nothing system in this manner, requests to read data from a particular row of the table may be handled by any node that stores a duplica of the slice to which the row is assigned. For each slice, a single duplica of the slice is designated as the “primary duplica”. All DML operations (e.g. inserts, deletes, updates, etc.) that target a particular row of the table are performed by the node that has the primary duplica of the slice to which the particular row is assigned. The changes made by the DML operations are then propagated from the primary duplica to the other duplicas (“secondary duplicas”) of the same slice.

    ROUTING REQUESTS IN SHARED-STORAGE DATABASE SYSTEMS
    20.
    发明申请
    ROUTING REQUESTS IN SHARED-STORAGE DATABASE SYSTEMS 审中-公开

    公开(公告)号：US20190102408A1

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

    申请号：US15845747

    申请日：2017-12-18

    Applicant: Oracle International Corporation

    Inventor： Juan R. Loaiza ,  Wei-Ming Hu ,  Mark Dilman ,  Leonid Novak

    IPC: G06F17/30

    Abstract: Techniques are described herein for routing queries to particular nodes of a multi-node database system based on the query. A database table is partitioned into a plurality of affinity groups. Each affinity group is assigned a particular node as the master node of the affinity group. A mapping is sent to a query router indicating the master node for each affinity group of the plurality of affinity groups. The query router determines, for a particular query, a target node to which to send the particular query based on the mapping and the particular query.

Patent Agency Ranking