MECHANISM FOR DATA AGGREGATION IN A TRACING FRAMEWORK

• US 20080263044A1
• Filed: 07/01/2008
• Published: 10/23/2008
• Est. Priority Date: 10/31/2003
• Status: Active Grant

• Current Assignee: Oracle America, Inc. (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Cantrill, Bryan M.
• Granted Patent: US 8,005,794 B2
• Time in Patent Office: Days
• US Class Current: 707/8
• CPC Class Codes: G06F 11/3466 Performance evaluation by tracing or monitoring
• CPC Class Codes: G06F 11/348 Circuit details, i.e. tracer hardware
• CPC Class Codes: G06F 11/3612 by runtime analysis performance monitoring G06F11/3466
• CPC Class Codes: G06F 11/3636 by tracing the execution of the program

Abstract

A method is disclosed for obtaining data from a kernel, including obtaining data from the kernel, and storing the data in a data set an aggregation buffer using an aggregation function. A method is disclosed for storing data in a data set, wherein the data set includes a key component, an aggregation identifier component, and a value component, including obtaining an expression, a new value, and an aggregation identifier, generating a key using the expression and the aggregation identifier; and storing the data set in a buffer, wherein storing the data set comprises storing the key in the key component, storing the aggregation identifier in the aggregation identifier component, and updating a current value in the value component using the new value and an aggregation function.

Claims

1. A method for obtaining data from a kernel, comprising:

obtaining data from the kernel; and

storing the data in a data set in an aggregation buffer using an aggregation function.

3. The method of claim 1, wherein obtaining data comprises:

obtaining an expression, a new value, and an aggregation identifier, and generating a key using the expression and the aggregation identifier.

4. The method of claim 3, wherein storing the data set comprises:

storing the key in the key component, storing the aggregation identifier in the aggregation identifier component, and updating a current value in the value component using the new value and the aggregation function.

5. The method of claim 4, wherein storing the data set further comprises:

generating a hash key using the key;

searching for a hash bucket corresponding to the key using the hash key;

searching for a hash chain element in the hash bucket corresponding to the key;

updating the value component of the data set associated with the hash chain element if a hash chain element corresponding to the key is found, wherein the updating the value component comprises applying the aggregation function to the current value in the value component using the new value as input;

creating a new hash chain element if the hash chain element corresponding to the key is not found, wherein creating a new hash chain element comprises associating a new data set with the new hash chain element, storing the key in a key component of the new data set, storing the aggregation identifier in an aggregation identifier component of the new data set, and storing an initial value in a value component of the new data set; and

updating the value component associated with the new hash chain element, wherein the updating the value component associated with the new hash chain element comprises applying the aggregation function to the initial value using the new value as input.

2. The method of claim 2, wherein the data set comprises a key component, an aggregation identifier component, and a value component.

6. A method for storing data in a data set, wherein the data set comprises a key component, an aggregation identifier component, and a value component, comprising:

obtaining an expression, a new value, and an aggregation identifier;

generating a key using the expression and the aggregation identifier; and

storing the data set in a buffer, wherein storing the data set comprises storing the key in the key component, storing the aggregation identifier in the aggregation identifier component, and updating a current value in the value component using the new value and an aggregation function.

7. The method of claim 6, wherein storing the data set comprises:

generating a hash key using the key;

searching for a hash bucket corresponding to the key using the hash key;

searching for a hash chain element in the hash bucket corresponding to the key;

updating the value component of the data set associated with the hash chain element if a hash chain element corresponding to the key is found, wherein the updating the value component comprises applying the aggregation function to the current value in the value component using the new value as input;

creating a new hash chain element if the hash chain element corresponding to the key is not found, wherein creating a new hash chain element comprises associating a new data set with the new hash chain element, storing the key in a key component of the new data set, storing an aggregation identifier in the aggregation identifier component of the new data set, and storing an initial value in a value component of the new data set; and

updating the value component associated with the new hash chain element, wherein the updating the value component associated with the new hash chain element comprises applying the aggregation function to the initial value using the new value as input.

8. The method of claim 7, wherein the hash chain element is associated with the data set using a pointer.

9. The method of claim 7, wherein the new hash chain element is associated with the new data set using a pointer.

10. The method of claim 6, wherein the expression comprises an n-tuple.

11. The method of claim 6, wherein the aggregation identifier is generating by applying a function to a user-defined name for an aggregation.

12. A method for integrating data into a user-level table, comprising:

obtaining a data set from an aggregation buffer, wherein the data set comprises a key component, an aggregation identifier component, and a value component;

obtaining an aggregation identifier matching a value of the aggregation identifier in the aggregation identifier component of the data set to obtain a user-level table key;

hashing the user-level table key to obtain a generated hash key;

updating a value component of a user-level table entry if a user-level table entry a hash key matching the generated hash key is found, wherein updating the value component comprises applying an aggregation function corresponding to the aggregation identifier to the value component using the new value as input;

creating a new user-level table entry if a user-level table entry having a hash key matching the generated hash key is not found, wherein creating the new user-level table entry comprises storing the generated hash value, and an initial value in a value component of the new user-level table entry in the new user-level table entry; and

updating the value component in the new user-level table entry, wherein updating the value component in the new user-level table entry comprises applying the aggregation function corresponding to the aggregation identifier to the value component in the new user-level table entry using the value component of the data set as input.

13. The method of claim 12, wherein the user-level table is a hash table.

14. The method of claim 12, wherein obtaining the aggregation identifier matching the value of the aggregation identifier comprises search at least one selected from the group consisting of a user-level dictionary and a kernel level dictionary.

15-24. -24. (canceled)