Oracle International Corporation

Hewlett-packard Development Company, L.p.

Nitin Karkhanis

Mahesh Baburao Girkar

Jiangbin Luo

Michael Harvey

Juan R Loaiza

Yunrui Li

Karen Lee Noel

Giridhar Ravipati

Steve Lee

Hongjie Yang

Benedicto Garin

Jing Zheng

Sadhana Kyathappala

David Gagne

Steven McGee

Robert McGuirk

Qingguang Cui

Frank De Lange

Stephen John Vivian

Sean Joseph Connolly

Ian Stuart Neall

Gary Allison

Ian Neall

Frank Lange

Herein is high availability for online transaction processing with redundancy and redo for a federation of pluggable databases and container databases. In an embodiment of a federation of container database management systems that includes a first container database, first redo data of a first pluggable database in a second container database is obtained based on a database dictionary in the first container database. To the first pluggable database in the first container database, the first redo data of the first pluggable database in the second container database is applied. Based on the database dictionary in the first container database, second redo data of a second pluggable database in a third container database is obtained. To the second pluggable database in the first container database, without modifying content of the first pluggable database in the first container database, the second redo data of the second pluggable database in the third container database is applied.

Data guard at PDB (pluggable database) level

Herein is high availability for online transaction processing with redundancy and redo for a federation of pluggable databases and container databases. In a federation of container database management systems that includes a first container database, first redo data of a first pluggable database in a second container database is obtained based on a database dictionary in the first container database. To the first pluggable database in the first container database, the first redo data of the first pluggable database in the second container database is applied. Based on the database dictionary in the first container database, second redo data of a second pluggable database in a third container database is obtained. To the second pluggable database in the first container database, without modifying content of the first pluggable database in the first container database, the second redo data of the second pluggable database in the third container database is applied.

Disclosed are methods and apparatuses to provide a redo repeater that allows for no data loss protection without the performance impact to the primary database even when a significant geographical distance separates the primary and standby databases. The Repeater is a lightweight entity that receives redo from the primary database with the purpose of redistributing that redo throughout the primary/standby system configuration. The Repeater able to extend no data loss protection and switchover functionality to terminal standby databases even though the primary database does not need to have a direct connection with those destinations.

Method and system for implementing a redo repeater

A graphical user interface based method of configuring automatic failover from a primary database system to a standby database system that is coupled to the primary database system by a network. Also coupled to the network is an observer process that is independent of the database systems and that initiates the failover process. The observer periodically pings the database systems to determine whether a failover is necessary. The graphical user interface permits a user to specify the primary and secondary database systems, configure the observer, and specify conditions under which a failover may occur and to enable automatic failover. A failover context is created from the inputs to the GUI and stored in persistent storage belonging to the database systems. If the Observer's context is stale, the Observer fetches the database system's context.

System and method of configuring a database system with replicated data and automatic failover and recovery

A method for use in a computer. A user of the computer stores a table of selections in a permanent memory structure of the computer, each selection indicating a memory object and one of at least two memory management policies for the memory object. The selections may select from one or more choices: e.g., whether pages of the memory object are to be reserved, or faulted on demand; whether pages of the memory object are to be locked into physical memory of the computer, or to be demand paged from a fluid page pool; whether pages allocated for the memory object are to be zeroed; whether the memory object is to be mapped using shared page tables; or specifying whether memory for the memory object is to be allocated contiguous physical pages of memory. A symbolic name is assigned to each of the memory objects. A non-privileged process issues a request designating one of the memory objects by symbolic name, and allocating memory from a reserved pool of memory for use in the object. The physical pages of the memory objects are managed, each according to the corresponding stored selection.

Managing physical memory in a virtual memory computer

A method is disclosed for managing pages of a designated memory object according to selected memory management policies. A user of the computer stores a table of selections in a memory of the computer, each selection indicating a memory object and one of at least two memory management policies for the memory object. The selections may select from one or more choices: e.g., whether pages of the memory object are to be reserved, or faulted on demand; whether pages of the memory object are to be locked into the memory of the computer, or to be demand paged from a fluid page pool; whether pages allocated for the memory object are to be zeroed; whether the memory object is to be mapped using shared page tables; or specifying the number of levels of translation pages of a designated memory object to be shared or whether memory for the memory object is to be allocated contiguous pages of memory. A symbolic name is assigned to each of the memory objects. A non-privileged process issues a request designating one of the memory objects by symbolic name, and allocating memory from a reserved pool of memory for use in the object. The pages of the memory objects are managed, each according to the corresponding stored selection. The managed page may be a translation page describing a virtual-to-physical address mapping for memory references to a program accessible page. The policy selection and an allocation size may be stored in the memory and may refer to management of the program-accessible page. The size of an allocation including the translation page may be computed from the stored size for the program-accessible allocation.

Method for managing pages of a designated memory object according to selected memory management policies

Growing community of inventors

Nashua, NH, United States of America

Nitin Karkhanis