Buffered message queue architecture for database management systems with unlimited buffered message queue with limited shared memory

• US 7,185,033 B2
• Filed: 05/21/2003
• Issued: 02/27/2007
• Est. Priority Date: 08/01/2002
• Status: Active Grant

• 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
• Primary Examiner(s): Coby; Frantz
• Application Number:
  US10/443,175
• Publication Number:
  US 20040024794A1
• Time in Patent Office: 1,378 Days
• Field of Search: 707/102, 707/100, 707/101, 707/103.R, 707/104.1, 707/1, 707/203, 707/200, 707/206, 370/235, 709/206, 709/207
• US Class Current: 1/1
• CPC Class Codes: G06F 11/1471 involving logging of persistent data for recovery
• CPC Class Codes: G06F 11/1474 in transactions G06F16/20 takes precedence
• CPC Class Codes: G06F 16/21 Design, administration or maintenance of databases
• CPC Class Codes: G06F 2201/80 Database-specific techniques
• CPC Class Codes: G06F 9/546 Message passing systems or structures, e.g. queues
• CPC Class Codes: Y10S 707/99957 Garbage collection

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:

determining whether an amount of available space in a message queue that is disposed in a volatile memory of the database system is less than a specified amount;

if the amount of available space in the message queue is less than the specified amount, then

moving a message from the message queue in the volatile memory to a persistent message queue disposed on a non-volatile storage in the database system, and

generating and storing in the message queue, message header data that identifies that the message is stored in the persistent message queue.

2. The method as recited in claim 1, wherein the step of determining whether an amount of available space in the message queue is less than a specified amount is performed in response to receiving a request to store a new message in the message queue.

3. The method as recited in claim 1, wherein the step of generating and storing in the message queue message header data that identifies that the message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the message is stored in the persistent message queue and a relative ordering of the message with respect to one or more other messages in the message queue.

4. The method as recited in claim 1, wherein the message is selected from a plurality of messages stored in the message queue based upon how long the message has been stored in the message queue relative to how long the plurality of messages have been stored in the message queue.

7. The method as recited in claim 1, further comprising the computer-implemented steps of:

determining whether there is sufficient available space in the message queue to store the message header data; and

if there is not sufficient space in the message queue to store the message header data, then

moving a second message from the message queue to the persistent message queue,

storing the first message header data in the message queue, and

generating and storing in the message queue second message header data that identifies that the second message is stored in the persistent message queue.

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

receiving a request to store a first message in a message queue in a volatile memory of the database system;

in response to receiving the request to store the first message in the message queue, determining whether the message queue has a sufficient amount of available space to store the first message;

if the message queue does not have a sufficient amount of available space to store the first message, then

storing the first message in a persistent message queue disposed on a nonvolatile storage in the database system, and

generating and storing in the message queue first message header data that identifies that the first message is stored in the persistent message queue.

6. The method as recited in claim 5, wherein the step of generating and storing in the message queue message header data that identifies that the first message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the first message is stored in the persistent message queue and specifies a relative ordering of the first message with respect to one or more other messages in the message queue.

8. A computer-readable storage 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:

determining whether an amount of available space in a message queue that is disposed in a volatile memory of the database system is less than a specified amount;

if the amount of available space in the message queue is less than the specified amount, then

moving a message from the message queue in the volatile memory to a persistent message queue disposed on a non-volatile storage in the database system, and

generating and storing in the message queue, message header data that identifies that the message is stored in the persistent message queue.

9. The computer-readable storage medium as recited in claim 8, wherein the step of determining whether an amount of available space in the message queue is less than a specified amount is performed in response to receiving a request to store a new message in the message queue.

10. The computer-readable storage medium as recited in claim 8, wherein the step of generating and storing in the message queue message header data that identifies that the message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the message is stored in the persistent message queue and a relative ordering of the message with respect to one or more other messages in the message queue.

11. The computer-readable storage medium as recited in claim 8, wherein the message is selected from a plurality of messages stored in the message queue based upon how long the message has been stored in the message queue relative to how long the plurality of messages have been stored in the message queue.

14. The computer-readable storage medium as recited in claim 8, 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 steps of:

determining whether there is sufficient available space in the message queue to store the message header data; and

if there is not sufficient space in the message queue to store the message header data, then

moving a second message from the message queue to the persistent message queue,

storing the first message header data in the message queue, and

generating and storing in the message queue second message header data that identifies that the second message is stored in the persistent message queue.

12. A computer-readable storage 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 a request to store a first message in a message queue in a volatile memory of the database system;

in response to receiving the request to store the first message in the message queue, determining whether the message queue has a sufficient amount of available space to store the first message;

if the message queue does not have a sufficient amount of available space to store the first message, then

storing the first message in a persistent message queue disposed on a nonvolatile storage in the database system, and

generating and storing in the message queue first message header data that identifies that the first message is stored in the persistent message queue.

13. The computer-readable storage medium as recited in claim 12, wherein the step of generating and storing in the message queue message header data that identifies that the first message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the first message is stored in the persistent message queue and specifies a relative ordering of the first message with respect to one or more other messages in the message queue.

15. An apparatus for managing messages in a database system, the apparatus comprising a memory 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:

determining whether an amount of available space in a message queue that is disposed in a volatile memory of the database system is less than a specified amount;

if the amount of available space in the message queue is less than the specified amount, then

moving a message from the message queue in the volatile memory to a persistent message queue disposed on a non-volatile storage in the database system, and

generating and storing in the message queue, message header data that identifies that the message is stored in the persistent message queue.

16. The apparatus as recited in claim 15, wherein the step of determining whether an amount of available space in the message queue is less than a specified amount is performed in response to receiving a request to store a new message in the message queue.

17. The apparatus as recited in claim 15, wherein the step of generating and storing in the message queue message header data that identifies that the message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the message is stored in the persistent message queue and a relative ordering of the message with respect to one or more other messages in the message queue.

18. The apparatus as recited in claim 15, wherein the message is selected from a plurality of messages stored in the message queue based upon how long the message has been stored in the message queue relative to how long the plurality of messages have been stored in the message queue.

21. The apparatus as recited in claim 15, 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 steps of:

determining whether there is sufficient available space in the message queue to store the message header data; and

if there is not sufficient space in the message queue to store the message header data, then

moving a second message from the message queue to the persistent message queue,

storing the first message header data in the message queue, and

generating and storing in the message queue second message header data that identifies that the second message is stored in the persistent message queue.

19. An apparatus for managing messages in a database system, the apparatus comprising a memory 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 a request to store a first message in a message queue in a volatile memory of the database system;

in response to receiving the request to store the first message in the message queue, determining whether the message queue has a sufficient amount of available space to store the first message;

if the message queue does not have a sufficient amount of available space to store the first message, then

storing the first message in a persistent message queue disposed on a nonvolatile storage in the database system, and

generating and storing in the message queue first message header data that identifies that the first message is stored in the persistent message queue.

20. The apparatus as recited in claim 19, wherein the step of generating and storing in the message queue message header data that identifies that the first message is stored in the persistent message queue includes generating and storing in the message queue message header data that both identifies that the first message is stored in the persistent message queue and specifies a relative ordering of the first message with respect to one or more other messages in the message queue.