DATABASE SYSTEM AND EVENTING INFRASTRUCTURE

• US 20090158298A1
• Filed: 12/12/2007
• Published: 06/18/2009
• Est. Priority Date: 12/12/2007
• Status: Abandoned Application

• Current Assignee: Oracle International Corporation (Oracle Corporation)
• Original Assignee: Oracle International Corporation (Oracle Corporation)
• Inventors: Saxena, Abhishek, Stamos, James W., Bhatt, Neerja
• Application Number:
  US11/954,739
• Publication Number:
  US 20090158298A1
• Time in Patent Office: Days
• US Class Current: 719/318
• CPC Class Codes: G06F 11/3476 Data logging G06F11/14, G06F11/2205 take precedence
• CPC Class Codes: G06F 11/3495 for systems
• CPC Class Codes: G06F 16/2358 Change logging, detection, and notification replication G06F16/27
• CPC Class Codes: G06F 2201/86 Event-based monitoring
• CPC Class Codes: G06F 9/542 Event management; Broadcasting; Multicasting; Notifications

Abstract

A system for managing event monitors within a database is provided. The system can adjust the amount of notifications generated by those event monitors, so as to achieve an effective balance between probability of notification loss and available notification bandwidth, as well as provide a better quality of service to database users.

Claims

1. A computer-implemented method for communicating notifications between a plurality of instances executing on a multi_instance system, comprising:

a registrant registering to receive notifications related to a plurality of specific events, where said notifications are generated by a plurality of processes executing on said multi-instance system;

wherein said plurality of processes communicate with each other via a global channel;

in response to receiving said registration, assigning a coordinator process among said plurality of processes to send said notifications to said registrant; and

said coordinator process sending said notifications to said registrant.

2. The method of claim 1, further comprising:

said plurality of processes further comprises a plurality of slave processes; and

said slave processes sending grouping notifications to said coordinator process.

3. The method of claim 2, further comprising:

said slave processes being located on a different instance than said coordinator process.

4. The method of claim 2, further comprising:

each slave process of the plurality of slave processes updating data associated with a specific registration; and

designating a single slave process as a coordinator process.

5. The method of claim 1, further comprising:

publishing data related to progress of said notifications as specified by a user.

6. The method of claim 1, further comprising

publishing data related to progress of said notifications when a pre-specified time ‘

t’

elapses, where ‘

f’

is a fraction, 0<

f<

1, which is a multiplicative factor of the grouping time interval, and where ‘

m’

is the minimum supportable periodic refresh time of the system, so that the pre-specified time ‘

t’

is t=max (f*grouping time interval, m).

7. The method of claim 2, further comprising:

if one of said plurality of instances fails, designating a new coordinator process from a slave processing within one of the remaining non-failed instances.

8. The method of claim 1, further comprising:

load-balancing a plurality of said registrations to be located evenly among all of said instances.

15. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1.

16. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2.

17. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3.

18. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4.

19. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5.

20. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6.

21. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7.

22. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8.

9. A computer-implemented method for communicating notifications between a plurality of instances executing on a multi-instance system, comprising:

a plurality of processes executing on said multi_instance system generating notifications;

in response to receiving a registration from a registrant, assigning a coordinator process among said plurality of processes to send said notifications to said registrant; and

said coordinator process sending said notifications to said registrant.

10. The method of claim 9, further comprising:

said plurality of processes further comprises a plurality of slave processes; and

said slave processes sending grouping notifications to said coordinator process.

11. The method of claim 10, further comprising:

each slave process of the plurality of slave processes updating data associated with a specific registration; and

designating a single slave process as a coordinator process.

12. The method of claim 9, further comprising:

wherein said plurality of processes communicate with each other via a global channel.

13. The method of claim 9, further comprising:

publishing data related to progress of said notifications as specified by a user.

14. The method of claim 9, further comprising

publishing data related to progress of said notifications when a pre-specified time ‘

t’

elapses, where ‘

f’

is a fraction, 0<

f<

1, which is a multiplicative factor of the grouping time interval, and where ‘

m’

is the minimum supportable periodic refresh time of the system, so that the pre-specified time ‘

t’

is t=max (f*grouping time interval, m).

23. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 9.

24. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 11.

25. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 13.

26. A database apparatus comprising:

a plurality of instances of the database wherein each of the plurality of instances comprises an event monitor, wherein each event monitor has a coordinator and a plurality of slave processes;

a grouping registration facility which manages a plurality of registration requests from registrants wishing to register for grouping notifications; and

a timing module which publishes partial grouping data related to each of the plurality of registrations when a pre-specified time ‘

t’

elapses, where ‘

f’

is a fraction, 0<

f<

1, which is a multiplicative factor of the grouping time interval, and where ‘

m’

is the minimum supportable periodic refresh time, so that the pre-specified time ‘

t’

is t=max (f*grouping time interval, m).