知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

33 records (took 0.023 seconds)

    PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS
    1.
    发明申请
    PRIORITIZING REPOPULATION OF IN-MEMORY COMPRESSION UNITS 有权
    内存压缩单元的重新排列

    公开(公告)号：US20160085834A1

    公开(公告)日：2016-03-24

    申请号：US14823393

    申请日：2015-08-11

    Applicant: Oracle International Corporation

    Inventor： Michael J. Gleeson ,  Jesse Kamp ,  Vineet Marwah ,  Tirthankar Lahiri ,  Juan R. Loaiza ,  Sanket Hase ,  Niloy Mukherjee ,  Sujatha Muthulingam ,  Atrayee Mullick ,  Allison L. Holloway

    IPC: G06F17/30

    CPC classification number: G06F17/30339 ,  G06F17/30377 ,  G06F17/30578

    Abstract: To prioritize repopulation of in-memory compression units (IMCU), a database server compresses, into an IMCU, a plurality of data units from a database table. In response to changes to any of the plurality of data units within the database table, the database server performs the steps of: (a) invalidating corresponding data units in the IMCU; (b) incrementing an invalidity counter of the IMCU that reflects how many data units within the IMCU have been invalidated; (c) receiving a data request that targets one or more of the plurality of data units of the database table; (d) in response to receiving the data request, incrementing an access counter of the IMCU; and (e) determining a priority for repopulating the IMCU based, at least in part, on the invalidity counter and the access counter.

    Abstract translation: 为了优先重新填充内存中的压缩单元（IMCU），数据库服务器从数据库表将多个数据单元压缩到IMCU中。 响应于对数据库表内的多个数据单元中的任一个的改变，数据库服务器执行以下步骤：（a）使IMCU中的相应数据单元无效; （b）增加反映IMCU内有多少数据单位无效的IMCU的无效计数器; （c）接收针对所述数据库表的所述多个数据单元中的一个或多个的数据请求; （d）响应于接收到数据请求，递增IMCU的访问计数器; 以及（e）至少部分地基于无效计数器和访问计数器确定重新填充IMCU的优先级。

    Versioning and non-disruptive servicing of in-memory units in a database
    5.
    发明授权
    Versioning and non-disruptive servicing of in-memory units in a database 有权

    公开(公告)号：US10572469B2

    公开(公告)日：2020-02-25

    申请号：US15169013

    申请日：2016-05-31

    Applicant: Oracle International Corporation

    Inventor： Atrayee Mullick ,  Niloy Mukherjee ,  Sanket Hase ,  Tirthankar Lahiri ,  Juan Loaiza

    IPC: G06F17/30 ,  G06F16/23 ,  G06F16/11 ,  G06F16/18 ,  G06F11/14

    Abstract: Techniques for non-disruptive versioning of in-memory units in a database are provided. A database server generates and maintains a first IMU that reflects changes made to a mirrored-data-set up to a first snapshot time, and a second IMU that reflects changes made to the mirrored-data-set up to a second snapshot time. During a first period, the database server responds to updates to first data items in the mirrored data by storing first staleness metadata that indicates that the copies of the first data items in the first IMU are stale. During a second period, the database server responds to updates to second data items in the mirrored data by storing second staleness metadata that indicates that the copies of the second data items in the second IMU are stale. The database server responds to a request by accessing the first IMU or the second IMU.

    Distributed directory service for in-memory compression unit home location
    9.
    发明授权
    Distributed directory service for in-memory compression unit home location 有权

    公开(公告)号：US09645928B2

    公开(公告)日：2017-05-09

    申请号：US14820672

    申请日：2015-08-07

    Applicant: Oracle International Corporation

    Inventor： Niloy Mukherjee ,  Amit Ganesh ,  Vineet Marwah

    IPC: G06F12/08 ,  G06F12/0817 ,  G06F3/06 ,  G06F12/1009 ,  G06F12/0868

    CPC classification number: G06F12/0824 ,  G06F3/064 ,  G06F3/067 ,  G06F3/0673 ,  G06F12/0868 ,  G06F12/1009 ,  G06F2212/1016 ,  G06F2212/314 ,  G06F2212/465 ,  G06F2212/621 ,  G06F2212/656

    Abstract: Techniques are described herein for maintaining a directory map that contains a data chunk-to-server mapping. Directory maps, maintained within the volatile memory of each server node in the set of multiple server nodes, include a node hierarchy represented as a tree structure in which each node represents a range of an on-disk address range. Each child node, within the node hierarchy, represents a sub-range of the on-disk address range represented by the parent node of the child node. Once a data chunk is loaded into volatile memory of a particular server, mapping information relating the particular on-disk starting address of the data chunk loaded into volatile memory and the pointer address to the location in volatile memory is loaded into one or more node in the directory map. Loading mapping information into the directory map includes first, locating a target child node, in the node hierarchy that has a range into which the particular on-disk starting address falls, where the target node is the Nth child node of a particular parent node. Then inserting a mapping entry into the target child node. Then determining a set of parent nodes, other than the particular parent node of the target child node, that has ranges that overlap with the particular on-disk address range. Then inserting into each Nth child node of each parent node in the set of parents nodes, an entry corresponding to mapping information that includes an indication of the on-disk starting address and the particular in-memory address.

Patent Agency Ranking