公开(公告)号：US11657037B2

公开(公告)日：2023-05-23

申请号：US15253780

申请日：2016-08-31

Applicant: Oracle International Corporation

Inventor： Vasudha Krishnaswamy ,  Yunrui Li ,  Vivekanandhan Raja ,  Tirthankar Lahiri ,  Mahesh B. Girkar ,  Sukhada Pendse ,  Kartik Kulkarni ,  Jing Zheng ,  Shruti Gautam ,  Henry Chau

IPC: G06F16/23 ,  G06F16/25 ,  G06F16/27

CPC classification number: G06F16/2379 ,  G06F16/2322 ,  G06F16/2365 ,  G06F16/258 ,  G06F16/27 ,  G06F16/275

Abstract: Techniques related to query execution against an in-memory standby database are disclosed. A first database includes PF data stored on persistent storage in a persistent format. The first database is accessible to a first database server that converts the PF data to a mirror format to produce MF data that is stored within volatile memory. The first database server receives, from a second database server, one or more change records indicating one or more transactions performed against a second database. The one or more change records are applied to the PF data, and a reference timestamp is advanced from a first to a second timestamp. The first database server invalidates any MF data that is changed by a subset of the one or more transactions that committed between the first and second timestamps.

公开(公告)号：US20230050727A1

公开(公告)日：2023-02-16

申请号：US17974152

申请日：2022-10-26

Applicant: Oracle International Corporation

Inventor： Jesse Kamp ,  Allison L. Holloway ,  Meichun Hsu ,  Hideaki Kimura ,  Boris Klots ,  Vasudha Krishnaswamy ,  Kartik Kulkarni ,  Teck Hua Lee ,  Yunrui Li ,  Aurosish Mishra ,  Ajit Mylavarapu ,  Sukhada Pendse ,  Garret F. Swart ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Juan R. Loaiza

IPC: G06F16/22 ,  G06F16/27 ,  G06F16/21 ,  G06F16/174 ,  G06F16/18 ,  G06F16/23 ,  G06F16/11

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.

公开(公告)号：US10303788B2

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

申请号：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

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.

公开(公告)号：US10474653B2

公开(公告)日：2019-11-12

申请号：US15281718

申请日：2016-09-30

Applicant: Oracle International Corporation

Inventor： Niloy Mukherjee ,  Jesse Kamp ,  Tirthankar Lahiri ,  Maria Colgan ,  Vivekanandhan Raja ,  Vasudha Krishnaswamy ,  Aditi Gupta ,  Kartik Kulkarni

IPC: G06F16/22 ,  G06F3/06 ,  G06F16/27 ,  G06F16/2455

Abstract: Techniques are described herein for distributing distinct portions of a database object across volatile memories of selected nodes of a plurality of nodes in a clustered database system. The techniques involve storing a unit-to-service mapping that associates a unit (a database object or portion thereof) to one or more database services. The one or more database services are mapped to one or more nodes. The nodes to which a service is mapped may include nodes in disjoint database systems, so long as those database systems have access to a replica of the unit. The database object is treated as in-memory enabled by nodes that are associated with the service, and are treated as not in-memory enabled by nodes that are not associated with the service.

公开(公告)号：US10002148B2

公开(公告)日：2018-06-19

申请号：US14806411

申请日：2015-07-22

Applicant: Oracle International Corporation

Inventor： Niloy Mukherjee ,  Mohamed Zait ,  Juan Loaiza ,  Vineet Marwah ,  Tirthankar Lahiri ,  Jiaqi Yan ,  Kartik Kulkarni

IPC: G06F17/30 ,  G06F3/06

CPC classification number: G06F16/2282 ,  G06F3/0604 ,  G06F3/0644 ,  G06F3/0679 ,  G06F16/2456 ,  G06F16/278

Abstract: Techniques are described herein for distributing data from one or more partitioned tables across the volatile memories of a cluster. In memory copies of data from partitioned tables are grouped based on the data falling within the same partition criteria. These groups are used for assigning data from corresponding partitions to the same node when distributing data from partitioned tables across the volatile memories of a multi-node cluster. When a query requires a join between rows of partitioned tables, the work for the join query is divided into work granules that correspond to partition-wise join operations. Those partition-wise join operations are assigned to nodes by a query coordinator based on the partition-to-node mapping located in the node of the query coordinator.

公开(公告)号：US20170116252A1

公开(公告)日：2017-04-27

申请号：US15253780

申请日：2016-08-31

Applicant: Oracle International Corporation

Inventor： Vasudha Krishnaswamy ,  Yunrui Li ,  Vivekanandhan Raja ,  Tirthankar Lahiri ,  Mahesh B. Girkar ,  Sukhada Pendse ,  Kartik Kulkarni ,  Jing Zheng ,  Shruti Gautam ,  Henry Chau

IPC: G06F17/30

CPC classification number: G06F16/2379 ,  G06F16/275

Abstract: Techniques related to query execution against an in-memory standby database are disclosed. A first database includes PF data stored on persistent storage in a persistent format. The first database is accessible to a first database server that converts the PF data to a mirror format to produce MF data that is stored within volatile memory. The first database server receives, from a second database server, one or more change records indicating one or more transactions performed against a second database. The one or more change records are applied to the PF data, and a reference timestamp is advanced from a first to a second timestamp. The first database server invalidates any MF data that is changed by a subset of the one or more transactions that committed between the first and second timestamps.

公开(公告)号：US11971869B2

公开(公告)日：2024-04-30

申请号：US17974152

申请日：2022-10-26

Applicant: Oracle International Corporation

Inventor： Jesse Kamp ,  Allison L. Holloway ,  Meichun Hsu ,  Hideaki Kimura ,  Boris Klots ,  Vasudha Krishnaswamy ,  Kartik Kulkarni ,  Teck Hua Lee ,  Yunrui Li ,  Aurosish Mishra ,  Ajit Mylavarapu ,  Sukhada Pendse ,  Garret F. Swart ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Juan R. Loaiza

IPC: G06F16/22 ,  G06F16/11 ,  G06F16/174 ,  G06F16/18 ,  G06F16/21 ,  G06F16/23 ,  G06F16/27

CPC classification number: G06F16/2255 ,  G06F16/128 ,  G06F16/1756 ,  G06F16/1865 ,  G06F16/217 ,  G06F16/2322 ,  G06F16/27

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.

公开(公告)号：US11586641B2

公开(公告)日：2023-02-21

申请号：US16726059

申请日：2019-12-23

Applicant: ORACLE INTERNATIONAL CORPORATION

Inventor： Niloy Mukherjee ,  Kartik Kulkarni ,  Tirthankar Lahiri ,  Vineet Marwah ,  Juan Loaiza

IPC: G06F16/2458 ,  H04L43/0817 ,  H04L41/0668 ,  H04L41/12

Abstract: Techniques are described herein for executing queries on distinct portions of a database object that has been separate into chunks and distributed across the volatile memories of a plurality of nodes in a clustered database system. The techniques involve redistributing the in-memory database object portions on changes to the clustered database system. Each node may maintain a mapping indicating which nodes in the clustered database system store which chunks, and timestamps indicating when each mapping entry was created or updated. A query coordinator may use the timestamps to select a database server instance with local in memory access to data required by a portion of a query to process that portion of the query.

公开(公告)号：US20220114153A1

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

申请号：US17070277

申请日：2020-10-14

Applicant: Oracle International Corporation

Inventor： Jesse Kamp ,  Allison L. Holloway ,  Meichun Hsu ,  Hideaki Kimura ,  Boris Klots ,  Vasudha Krishnaswamy ,  Kartik Kulkarni ,  Teck Hua Lee ,  Yunrui Li ,  Aurosish Mishra ,  Ajit Mylavarapu ,  Sukhada Pendse ,  Garret F. Swart ,  Shasank K. Chavan ,  Tirthankar Lahiri ,  Juan R. Loaiza

IPC: G06F16/22 ,  G06F16/21 ,  G06F16/23 ,  G06F16/27 ,  G06F16/11 ,  G06F16/18 ,  G06F16/174

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.

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