-
公开(公告)号:US10007691B2
公开(公告)日:2018-06-26
申请号: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: G06F16/2282 , G06F16/2379 , G06F16/273
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.
-
公开(公告)号:US20180067853A1
公开(公告)日:2018-03-08
申请号:US15257754
申请日:2016-09-06
Applicant: Oracle International Corporation
Inventor: Niloy Mukherjee , Tirthankar Lahiri , Juan R. Loaiza , Jesse Kamp , Prashant Gaharwar , Hariharan Lakshmanan , Dhruvil Shah
CPC classification number: G06F12/08 , G06F3/0604 , G06F3/0638 , G06F3/0647 , G06F3/067 , G06F17/30289 , G06F17/30312 , G06F2212/1016
Abstract: Techniques related to efficient data storage and retrieval using a heterogeneous main memory are disclosed. A database includes a set of persistent format (PF) data that is stored on persistent storage in a persistent format. The database is maintained on the persistent storage and is accessible to a database server. The database server converts the set of PF data to sets of mirror format (MF) data and stores the MF data in a hierarchy of random-access memories (RAMs). Each RAM in the hierarchy has an associated latency that is different from a latency associated with any other RAM in the hierarchy. Storing the sets of MF data in the hierarchy of RAMs includes (1) selecting, based on one or more criteria, a respective RAM in the hierarchy to store each set of MF data and (2) storing said each set of MF data in the respective RAM.
-
公开(公告)号:US20180060378A1
公开(公告)日:2018-03-01
申请号:US15253630
申请日: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
CPC classification number: G06F17/30371 , G06F17/30353 , G06F17/30368 , G06F17/30377 , G06F17/3056 , G06F17/30581
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.
-
公开(公告)号:US20180060377A1
公开(公告)日:2018-03-01
申请号: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
CPC classification number: G06F17/30371 , G06F17/30368 , G06F17/30377 , G06F17/3056
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.
-
公开(公告)号:US20140059020A1
公开(公告)日:2014-02-27
申请号:US14072739
申请日:2013-11-05
Applicant: Oracle International Corporation
Inventor: Wei-Ming Hu , Juan R. Loaiza , Yunrui Li , Vinay H. Srihari
IPC: G06F17/30
CPC classification number: G06F17/30156 , G06F12/0866 , G06F17/30159 , G06F17/30592 , G06F2212/465
Abstract: A method and system for replicating database data is provided. One or more standby database replicas can be used for servicing read-only queries, and the amount of storage required is scalable in the size of the primary database storage. One technique is described for combining physical database replication to multiple physical databases residing within a common storage system that performs de-duplication. Having multiple physical databases allows for many read-only queries to be processed, and the de-duplicating storage system provides scalability in the size of the primary database storage. Another technique uses one or more diskless standby database systems that share a read-only copy of physical standby database files. Notification messages provide consistency between each diskless system's in-memory cache and the state of the shared database files. Use of a transaction sequence number ensures that each database system only accesses versions of data blocks that are consistent with a transaction checkpoint.
Abstract translation: 提供了一种用于复制数据库数据的方法和系统。 一个或多个备用数据库副本可用于维护只读查询,并且所需的存储量可在主数据库存储的大小上扩展。 描述了一种将物理数据库复制与驻留在执行重复数据删除的公共存储系统中的多个物理数据库进行组合的技术。 拥有多个物理数据库可以处理许多只读查询,并且重复存储系统提供主数据库存储大小的可扩展性。 另一种技术使用一个或多个共享物理备用数据库文件的只读副本的无盘备用数据库系统。 通知消息提供每个无盘系统的内存缓存与共享数据库文件的状态之间的一致性。 使用事务序列号确保每个数据库系统只能访问与事务检查点一致的数据块版本。
-
公开(公告)号:US12287777B2
公开(公告)日:2025-04-29
申请号:US17966730
申请日:2022-10-14
Applicant: Oracle International Corporation
Inventor: Zhen Hua Liu , Juan R. Loaiza , Sundeep Abraham , Shubha Bose , Hui Joe Chang , Shashank Gugnani , Beda Christoph Hammerschmidt , Tirthankar Lahiri , Ying Lu , Douglas James McMahon , Aurosish Mishra , Ajit Mylavarapu , Sukhada Pendse , Ananth Raghavan
IPC: G06F16/00 , G06F16/23 , G06F16/2455
Abstract: JSON Duality Views are object views that return JDV objects. JDV objects are virtual because they are not stored in a database as JSON objects. Rather, JDV objects are stored in shredded form across tables and table attributes (e.g. columns) and returned by a DBMS in response to database commands that request a JDV object from a JSON Duality View. Through JSON Duality Views, changes to the state of a JDV object may be specified at the level of a JDV object. JDV objects are updated in a database using optimistic lock.
-
公开(公告)号:US20250094294A1
公开(公告)日:2025-03-20
申请号:US18884628
申请日:2024-09-13
Applicant: Oracle International Corporation
Inventor: Natesh Kedlaya , Sukhada Pendse , Ajit Mylavarapu , Tirthankar Lahiri , Carol Lyndall Colrain , Xiaoli Qi , Juan R. Loaiza
Abstract: Techniques are described for Transaction Guard to impose at-most-once execution by generating and using the database's native transaction identifier, DB XID. In an implementation, DB XID is unique within a (pluggable) database instance (with local undo) and uniquely identifies a transaction in the database. The Transaction Guard that is extended to use native transaction information determines the commit outcome using the native transaction identifier of the transaction instead of relying on the persistence of the Logical Transaction Identifier (LTXID) in a separate table. Using the native transaction identifier, the Transaction Guard significantly improves performance by eliminating the extra write(s) incurred during commit operations.
-
公开(公告)号:US20240273087A1
公开(公告)日:2024-08-15
申请号:US18633209
申请日:2024-04-11
Applicant: Oracle International Corporation
Inventor: Ajit Mylavarapu , Vasudha Krishnaswamy , Sukhada Pendse , Solmaz Kolahi , Ankita Kumar , Garret F. Swart , Tirthankar Lahiri , Juan R. Loaiza
CPC classification number: G06F16/2379 , G06F16/285
Abstract: One or more engine instances are executed on each host to form an engine cluster. A plurality of control instances are executed on a first set of hosts to form a control cluster and comprise a control instance leader and one or more control instance followers. In response to a first host indicating a failure of a neighbor host, a pair-wise focused investigation is initiated to check peer-to-peer connections between the first host and the neighbor host. In response to one or more additional hosts indicating failures of neighbor hosts while the pair-wise focused investigation is being performed, a wide investigation is performed to check connections between the control cluster and the plurality of hosts. One or more hosts are added to an eviction list and an eviction protocol is performed to evict the one or more hosts from the engine cluster using the eviction list.
-
公开(公告)号:US11983170B2
公开(公告)日:2024-05-14
申请号:US18117810
申请日:2023-03-06
Applicant: Oracle International Corporation
Inventor: Ajit Mylavarapu , Vasudha Krishnaswamy , Sukhada Pendse , Solmaz Kolahi , Ankita Kumar , Garret F. Swart , Tirthankar Lahiri , Juan R. Loaiza
CPC classification number: G06F16/2379 , G06F16/285
Abstract: One or more engine instances are executed on each host to form an engine cluster. A plurality of control instances are executed on a first set of hosts to form a control cluster and comprise a control instance leader and one or more control instance followers. In response to a first host indicating a failure of a neighbor host, a pair-wise focused investigation is initiated to check peer-to-peer connections between the first host and the neighbor host. In response to one or more additional hosts indicating failures of neighbor hosts while the pair-wise focused investigation is being performed, a wide investigation is performed to check connections between the control cluster and the plurality of hosts. One or more hosts are added to an eviction list and an eviction protocol is performed to evict the one or more hosts from the engine cluster using the eviction list.
-
公开(公告)号:US11709784B2
公开(公告)日:2023-07-25
申请号: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: G06F13/00 , G06F12/1081 , G06F16/23 , G06F15/173
CPC classification number: G06F12/1081 , G06F15/17331 , G06F16/2379 , G06F2212/621
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.
-
-
-
-
-
-
-
-
-