Buffered message queue architecture for database management systems with transactional enqueue support

• US 20040024771A1
• Filed: 05/21/2003
• Published: 02/05/2004
• Est. Priority Date: 08/01/2002
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Meiyyappan, Krishnan, Mishra, Shailendra, Surlaker, Kapil, Jain, Namit, Bhatt, Neerja
• Application Number:
  US10/443,174
• Publication Number:
  US 20040024771A1
• Time in Patent Office: Days
• US Class Current: 707/100
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 2209/548 Queue
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications

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.” The buffered message queue architecture also includes management mechanisms for performing buffered message queue cleanup and also for providing unlimited size buffered message queues when limited amounts of shared memory are available. The architecture also includes “zero copy” buffered message queues and provides for transaction-based enqueue of messages.

Claims

1. A method for managing messages in a database system, the method comprising the computer-implemented steps of:

receiving one or more requests to enqueue a plurality of messages into a message queue disposed in a volatile memory in the database system, wherein each message from the plurality of messages is associated with a transaction;

in response to receiving the one or more requests, storing the plurality of messages in a portion of the volatile memory that is separate from the message queue; and

if the transaction commits, then moving the plurality of messages from the portion of the volatile memory to the message queue.

2. The method as recited in claim 1, further comprising the computer-implemented step of if the transaction does not commit, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

3. The method as recited in claim 2, further comprising the computer-implemented step of if the transaction does not commit Within a specified time, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

4. The method as recited in claim 1, wherein the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes deleting the plurality of messages from the portion of the volatile memory.

5. The method as recited in claim 1, wherein:

the step of storing the plurality of messages in a portion of the volatile memory that is separate from the message queue includes storing, in a specified order, the plurality of messages in the portion of the volatile memory that is separate from the message queue, and

the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes storing the plurality of messages in the message queue in the specified order.

6. A computer-readable medium for managing messages in a database system, the computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of:

receiving one or more requests to enqueue a plurality of messages into a message queue disposed in a volatile memory in the database system, wherein each message from the plurality of messages is associated with a transaction;

in response to receiving the one or more requests, storing the plurality of messages in a portion of the volatile memory that is separate from the message queue; and

if the transaction commits, then moving the plurality of messages from the portion of the volatile memory to the message queue.

7. The computer-readable medium as recited in claim 6, further comprising one or more additional instructions which, when executed by the one or more processors, cause the one or more processors to perform the step of if the transaction does not commit, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

8. The computer-readable medium as recited in claim 7, further comprising one or more additional instructions which, when executed by the one or more processors, cause the one or more processors to perform the step of if the transaction does not commit within a specified time, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

9. The computer-readable medium as recited in claim 6, wherein the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes deleting the plurality of messages from the portion of the volatile memory.

10. The computer-readable medium as recited in claim 6, wherein:

the step of storing the plurality of messages in a portion of the volatile memory that is separate from the message queue includes storing, in a specified order, the plurality of messages in the portion of the volatile memory that is separate from the message queue, and

the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes storing the plurality of messages in the message queue in the specified order.

11. An apparatus for managing messages in a database system, the apparatus comprising a memory one or more sequences of instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of:

receiving one or more requests to enqueue a plurality of messages into a message queue disposed in a volatile memory in the database system, wherein each message from the plurality of messages is associated with a transaction;

in response to receiving the one or more requests, storing the plurality of messages in a portion of the volatile memory that is separate from the message queue; and

if the transaction commits, then moving the plurality of messages from the portion of the volatile memory to the message queue.

12. The apparatus as recited in claim 11, wherein the memory further includes one or more additional instructions which, when executed by the one or more processors, cause the one or more processors to perform the step of if the transaction does not commit, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

13. The apparatus as recited in claim 12, wherein the memory further includes one or more additional instructions which, when executed by the one or more processors, cause the one or more processors to perform the step of if the transaction does not commit within a specified time, then deleting the plurality of messages from the portion of the volatile memory without moving the plurality of messages from the portion of the volatile memory to the message queue.

14. The apparatus as recited in claim 11, wherein the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes deleting the plurality of messages from the portion of the volatile memory.

15. The apparatus as recited in claim 11, wherein:

the step of storing the plurality of messages in a portion of the volatile memory that is separate from the message queue includes storing, in a specified order, the plurality of messages in the portion of the volatile memory that is separate from the message queue, and

the step of moving the plurality of messages from the portion of the volatile memory to the message queue includes storing the plurality of messages in the message queue in the specified order.