Kapil L Surlaker

US Patent:

7181482, Feb 20, 2007

Filed:

May 21, 2003

Appl. No.:

10/443206

Inventors:

Namit Jain - Emeryville CA, US
Neerja Bhatt - Mountain View CA, US
Kapil Surlaker - Mountain View CA, US
Krishnan Meiyyappan - Fremont CA, US
Sanjay Kaluskar - Mountain View CA, US
Shailendra Mishra - Fremont CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707206, 707200, 707 1

Abstract:

A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.

US Patent:

7185033, Feb 27, 2007

Filed:

May 21, 2003

Appl. No.:

10/443175

Inventors:

Namit Jain - Emeryville CA, US
Neerja Bhatt - Mountain View CA, US
Kapil Surlaker - Mountain View CA, US
Krishnan Meiyyappan - Fremont CA, US
Shailendra Mishra - Fremont CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707206, 707200

Abstract:

A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.

US Patent:

7185034, Feb 27, 2007

Filed:

May 21, 2003

Appl. No.:

10/443323

Inventors:

Namit Jain - Emeryville CA, US
Neerja Bhatt - Mountain View CA, US
Kapil Surlaker - Mountain View CA, US
Krishnan Meiyyappan - Fremont CA, US
Shailendra Mishra - Fremont CA, US
Bhagat Nainani - Fremont CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707206, 707200

Abstract:

A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.

US Patent:

7203706, Apr 10, 2007

Filed:

May 21, 2003

Appl. No.:

10/443207

Inventors:

Namit Jain - Emeryville CA, US
Neerja Bhatt - Mountain View CA, US
Kapil Surlaker - Mountain View CA, US
Krishnan Meiyyappan - Fremont CA, US
Shailendra Mishra - Fremont CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

7071041, 707100, 707101, 707102, 707103 R, 709206, 709207

Abstract:

A buffered message queue architecture for managing messages in a database management system is disclosed. A “buffered message queue” refers to a message queue implemented in a volatile memory, such as a RAM. The volatile memory may be a shared volatile memory that is accessible by a plurality of processes. The buffered message queue architecture supports a publish and subscribe communication mechanism, where the message producers and message consumers may be decoupled from and independent of each other. The buffered message queue architecture provides all the functionality of a persistent publish-subscriber messaging system, without ever having to store the messages in persistent storage. The buffered message queue architecture provides better performance and scalability since no persistent operations are needed and no UNDO/REDO logs need to be maintained. Messages published to the buffered message queue are delivered to all eligible subscribers at least once, even in the event of failures, as long as the application is “repeatable.

US Patent:

7386615, Jun 10, 2008

Filed:

May 10, 2002

Appl. No.:

10/144246

Inventors:

Kapil Surlaker - Mountain View CA, US
Sreenivas Gollapudi - Cupertino CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Debashis Saha - Foster City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 15/173

US Classification:

709226, 709222, 709228, 714 2, 714 4, 714 48, 714100

Abstract:

A system and method is disclosed that allows resources to be shared among multiple entities, but which can appropriately release system resources after the failure or shutdown of the calling entity. In one approach, a monitoring entity is available to check for session failures. If a session failure is detected, the session is identified in a shared list that is accessible to other related entities. The related entities can be configured to piggyback a message to an appropriate node to kill, shutdown, or release resources associated with the failed session. Alternatively, a related entity can be specifically initiated to send a message to the appropriate node to kill, shutdown, or release the resources.

US Patent:

7389284, Jun 17, 2008

Filed:

May 10, 2002

Appl. No.:

10/144382

Inventors:

Kapil Surlaker - Mountain View CA, US
Sreenivas Gollapudi - Cupertino CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Debashis Saha - Foster City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 17/30

US Classification:

707 3, 707 4, 709202, 709203, 709247

Abstract:

A method and mechanism for reducing the expense of data transmissions and storage between a first node and a second for a remote-mapped query or a query involving a distributed join operation is disclosed. Data prefetching can be utilized to predictably retrieve information. Data redundancy management can be employed to reduce the expense of transmitting and storing redundant data.

US Patent:

7487405, Feb 3, 2009

Filed:

May 10, 2002

Appl. No.:

10/144330

Inventors:

Kapil Surlaker - Mountain View CA, US
Sreenivas Gollapudi - Cupertino CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Debashis Saha - Foster City CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 11/00

US Classification:

714 49, 714 15, 714 47

Abstract:

A method and mechanism for dynamically changing the logical path of a state machine to avoid conflicts or problems is provided. A toggle state is employed for a state machine that allows dynamic changes in the computation path of a state machine. By analyzing the expected response state of a remote state machine, toggle states can be inserted in the path of a local state machine to avoid conflicts. This approach can be advantageously employed to reduce or prevent half-duplex violations for communications between applications on multiple computing nodes.

US Patent:

7610351, Oct 27, 2009

Filed:

May 10, 2002

Appl. No.:

10/144083

Inventors:

Sreenivas Gollapudi - Cupertino CA, US
Lakshminarayanan Chidambaran - Fremont CA, US
Debashis Saha - Foster City CA, US
Kapil Surlaker - Mountain View CA, US

Assignee:

Oracle International Corporation - Redwood Shores CA

International Classification:

G06F 15/167

US Classification:

709217, 707 10, 707 3, 707 2

Abstract:

A method and mechanism for implementing pipelined prefetching in a computer system is disclosed. Data prefetching is utilized to predictably retrieve information between multiple levels of nodes in the computer system, in which a first server may receive prefetched data from a second server, the second server receives prefetched data from a third server, with the chain of prefetching extending as long as needed/desired to effect efficient data transfers between the nodes.