公开(公告)号：US11354252B2

公开(公告)日：2022-06-07

申请号：US16144926

申请日：2018-09-27

Applicant: Oracle International Corporation

Inventor： Hariharan Lakshmanan ,  Dhruvil Shah ,  Prashant Gaharwar ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Saraswathy Narayan

IPC: G06F12/12 ,  G06F16/24 ,  G06F12/126 ,  G06F16/22 ,  G06F16/2455 ,  G06F16/172

Abstract: Techniques related to automatic cache management are disclosed. In some embodiments, one or more non-transitory storage media store instructions which, when executed by one or more computing devices, cause performance of an automatic cache management method when a determination is made to store a first set of data in a cache. The method involves determining whether an amount of available space in the cache is less than a predetermined threshold. When the amount of available space in the cache is less than the predetermined threshold, a determination is made as to whether a second set of data has a lower ranking than the first set of data by at least a predetermined amount. When the second set of data has a lower ranking than the first set of data by at least the predetermined amount, the second set of data is evicted. Thereafter, the first set of data is cached.

公开(公告)号：US20220114164A1

公开(公告)日：2022-04-14

申请号：US17136568

申请日：2020-12-29

Applicant: Oracle International Corporation

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

IPC: G06F16/23 ,  G06F16/27 ,  G06F16/21

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.

公开(公告)号：US20210216473A1

公开(公告)日：2021-07-15

申请号：US17214564

申请日：2021-03-26

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Hideaki Kimura ,  Garret F. Swart ,  Spyros Blanas ,  Tirthankar Lahiri ,  Juan R. Loaiza ,  Jesse Kamp ,  Avneesh Pant

IPC: G06F12/1081 ,  G06F16/23

Abstract: Techniques are described for offloading remote direct memory operations (RDMOs) to “execution candidates”. The execution candidates may be any hardware capable of performing the offloaded operation. Thus, the execution candidates may be network interface controllers, specialized co-processors, FPGAs, etc. The execution candidates may be on a machine that is remote from the processor that is offloading the operation, or may be on the same machine as the processor that is offloading the operation. Details for certain specific RDMOs, which are particularly useful in online transaction processing (OLTP) and hybrid transactional/analytical (HTAP) workloads, are provided.

公开(公告)号：US20210049123A1

公开(公告)日：2021-02-18

申请号：US17071169

申请日：2020-10-15

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Garret F. Swart ,  Jesse Kamp ,  Avneesh Pant ,  Hideaki Kimura

IPC: G06F15/167 ,  G06F9/455 ,  G06F9/54 ,  G06F15/173

Abstract: Techniques are provided to allow more sophisticated operations to be performed remotely by machines that are not fully functional. Operations that can be performed reliably by a machine that has experienced a hardware and/or software error are referred to herein as Remote Direct Memory Operations or “RDMOs”. Unlike RDMAs, which typically involve trivially simple operations such as the retrieval of a single value from the memory of a remote machine, RDMOs may be arbitrarily complex. The techniques described herein can help applications run without interruption when there are software faults or glitches on a remote system with which they interact.

公开(公告)号：US20210026799A1

公开(公告)日：2021-01-28

申请号：US17071174

申请日：2020-10-15

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Garret F. Swart ,  Jesse Kamp ,  Avneesh Pant ,  Hideaki Kimura

IPC: G06F15/167 ,  G06F9/455 ,  G06F9/54 ,  G06F15/173

Abstract: Techniques are provided to allow more sophisticated operations to be performed remotely by machines that are not fully functional. Operations that can be performed reliably by a machine that has experienced a hardware and/or software error are referred to herein as Remote Direct Memory Operations or “RDMOs”. Unlike RDMAs, which typically involve trivially simple operations such as the retrieval of a single value from the memory of a remote machine, RDMOs may be arbitrarily complex. The techniques described herein can help applications run without interruption when there are software faults or glitches on a remote system with which they interact.

公开(公告)号：US20210026798A1

公开(公告)日：2021-01-28

申请号：US17071164

申请日：2020-10-15

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Tirthankar Lahiri ,  Juan R. Loaiza ,  Garret F. Swart ,  Jesse Kamp ,  Avneesh Pant ,  Hideaki Kimura

IPC: G06F15/167 ,  G06F9/455 ,  G06F9/54 ,  G06F15/173

Abstract: Techniques are provided to allow more sophisticated operations to be performed remotely by machines that are not fully functional. Operations that can be performed reliably by a machine that has experienced a hardware and/or software error are referred to herein as Remote Direct Memory Operations or “RDMOs”. Unlike RDMAs, which typically involve trivially simple operations such as the retrieval of a single value from the memory of a remote machine, RDMOs may be arbitrarily complex. The techniques described herein can help applications run without interruption when there are software faults or glitches on a remote system with which they interact.

公开(公告)号：US10678791B2

公开(公告)日：2020-06-09

申请号：US15602009

申请日：2017-05-22

Applicant: Oracle International Corporation

Inventor： Shasank K. Chavan ,  Dina Thomas ,  Ajit Mylavarapu ,  Prashant Gaharwar ,  Tirthankar Lahiri ,  Jesse Kamp

IPC: G06F16/2453 ,  G06F16/22 ,  G06F16/9535 ,  G06F16/2455 ,  G06F7/24

Abstract: Techniques are described for encoding join columns that belong to the same domain with a common dictionary. The tables are encoded with dictionary indexes that make the comparison operation of a join query a quick equality check of two integers and there is no need to compute any hashes during execution. Additionally, the techniques described herein minimize the bloom filter creation and evaluation cost as well because the dictionary indexes serve as hash values into the bloom filter. If the bloom filter is as large as the range of dictionary indexes, then the filter is no longer a probabilistic structure and can be used to filter rows in the probe phase with full certainty without any significant overhead.

公开(公告)号：US10678788B2

公开(公告)日：2020-06-09

申请号：US15331599

申请日：2016-10-21

Applicant: Oracle International Corporation

Inventor： Roger D. Macnicol ,  Viral Shah ,  Xia Hua ,  Jesse Kamp ,  Shasank K. Chavan ,  Maria Colgan ,  Tirthankar Lahiri ,  Adrian Tsz Him Ng ,  Krishnan Meiyyappan ,  Amit Ganesh ,  Juan R. Loaiza ,  Kothanda Umamageswaran ,  Yiran Qin

IPC: G06F16/2453 ,  G06F16/22 ,  G06F3/06 ,  G06F12/0811 ,  G06F12/0897

Abstract: Techniques are provided for storing in in-memory unit (IMU) in a lower-storage tier and copying the IMU to DRAM when needed for query processing. Techniques are also provided for copying IMUs to lower tiers of storage when evicted from the cache of higher tiers of storage. Techniques are provided for implementing functionality of IMUs within a storage system, to enable database servers to push tasks, such as filtering, to the storage system where the storage system may access IMUs within its own memory to perform the tasks. Metadata associated with a set of data may be used to indicate whether an IMU for the data should be created by the database server machine or within the storage system.

公开(公告)号：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.

公开(公告)号：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.