中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

39 records (took 0.026 seconds)

    Mechanism to run OLTP workload on in-memory database under memory pressure
    17.
    发明授权
    Mechanism to run OLTP workload on in-memory database under memory pressure 有权
    在内存压力下对内存数据库运行OLTP工作负载的机制

    公开(公告)号：US09323799B2

    公开(公告)日：2016-04-26

    申请号：US14337182

    申请日：2014-07-21

    Applicant: Oracle International Corporation

    Inventor： Sanket Hase ,  Vivekanandhan Raja ,  Amit Ganesh ,  Vineet Marwah ,  Sukhada Pendse ,  Shuang Su ,  Atrayee Mullick

    IPC: G06F7/00 ,  G06F17/00 ,  G06F17/30

    CPC classification number: G06F17/30592 ,  G06F17/30088 ,  G06F17/30185 ,  G06F17/30345

    Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.

    Abstract translation: 提供的技术用于以一种格式持续保持数据，但使数据库可以以多种格式提供给数据库服务器。 例如，数据可用于查询处理的格式之一是基于磁盘格式，而数据可用于查询处理的另一种格式与磁盘格式无关。 独立于磁盘格式的格式的数据可以专门保存在易失性存储器中，以减少与保持数据与数据的磁盘格式副本同步的开销。

    TEMPORAL CLONES TO IDENTIFY VALID ITEMS FROM A SET OF ITEMS
    18.
    发明申请
    TEMPORAL CLONES TO IDENTIFY VALID ITEMS FROM A SET OF ITEMS 有权
    从一些项目中识别有效项目的时间克隆

    公开(公告)号：US20160098347A1

    公开(公告)日：2016-04-07

    申请号：US14506613

    申请日：2014-10-04

    Applicant: Oracle International Corporation

    Inventor： Vivekanandhan Raja ,  Sanket Hase ,  Amit Ganesh ,  Vineet Marwah

    IPC: G06F12/08

    CPC classification number: G06F17/30315 ,  G06F3/0604 ,  G06F3/064 ,  G06F3/065 ,  G06F3/0689 ,  G06F12/0815 ,  G06F12/1018 ,  G06F15/78 ,  G06F15/8007 ,  G06F15/8076 ,  G06F15/8084 ,  G06F17/30312 ,  G06F17/30377 ,  G06F17/30477 ,  G06F17/30595 ,  G06F2003/0697 ,  G06F2212/1021 ,  G06F2212/1032 ,  G06F2212/2542 ,  G06F2212/313

    Abstract: Techniques are provided for using bitmaps to indicate which items, in a set of items, are invalid. The bitmaps include an “active” bitmap and one or more “temporal clones”. The active bitmap indicates which items in the set are currently valid. The temporal clones are outdated versions of the active bitmap that indicate which items in the set were invalid at previously points in time. Temporal clones may not be very different from each other. Therefore, temporal clones may be efficiently compressed. For example, a bitmap may be selected as a “base bitmap”, and one or more other bitmaps are encoded using delta encoding. Run length encoding may then be applied to further compress the bitmap information. These bitmaps may then be used to determine which items are valid relative to past-version requests.

    Abstract translation: 提供了使用位图来指示在一组项目中无效的哪些项目的技术。 位图包括“活动”位图和一个或多个“时间克隆”。 活动位图指示集合中的哪些项目当前有效。 时间克隆是活动位图的过时版本，指示集合中的哪些项在先前的时间点是无效的。 时间克隆可能没有太大的不同。 因此，可以有效地压缩时间克隆。 例如，可以将位图选择为“基本位图”，并且使用增量编码对一个或多个其他位图进行编码。 然后可以应用运行长度编码以进一步压缩位图信息。 然后可以使用这些位图来确定哪些项目相对于过去版本的请求是有效的。

    Versioning and non-disruptive servicing of in-memory units in a database
    19.
    发明授权
    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.

    Efficient determination of committed changes
    20.
    发明授权
    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.

Patent Agency Ranking