IP Library Granted Patent US 8,706,759
Granted Patent B2
US 8,706,759 · App. 11/733,348 · Granted Apr 22, 2014

Method and system for displaying messages in context

Inventor: Tad A. Deffler (Boonton, NJ)
Assignee: CA, Inc.
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,706,759
App. No.
11/733,348
Granted
Apr 22, 2014
Kind
B2
Abstract

The present disclosure is directed to a method and system for displaying messages in context. In accordance with a particular embodiment of the present disclosure at least one transaction notification is received. At least one node for the at least one transaction notification is generated. The node is stored in a hierarchical tree data structure.

Claims (35)

1. A method for displaying messages in context, comprising:

generating a first node associated with a first transaction, the first transaction corresponding to an executable application;

receiving a first transaction notification for the first transaction;

storing the first transaction notification in the first node, the transaction notification comprising an output of the executable application;

generating a hierarchical tree data structure comprising at least the first node and at least a second node, the first node being a child node of the second node in the hierarchical tree data structure, the second node associated with a second transaction, the first transaction being a nested transaction initiated by the second transaction; and

establishing a current node data pointer, wherein the current node data pointer references a particular node in the hierarchical tree data structure, wherein the particular node is associated with an executing transaction.

2. The method of claim 1 , further comprising updating the current node data pointer to reference a child node in the hierarchical tree data structure.

3. The method of claim 1 , further comprising updating the current node data pointer to reference a parent node in the hierarchical tree data structure.

4. The method of claim 1 , wherein storing the at least one node in the hierarchical tree data structure comprises storing the at least one node under the node referenced by the current node data pointer.

5. The method of claim 1 , further comprising adding a transaction message to the at least one node.

6. The method of claim 1 , further comprising displaying the hierarchical tree data structure.

7. A system for displaying messages in context, comprising:

a storage device; and

a processor, the processor operable to execute a program of instructions operable to:

generate a first node associated with a first transaction, the first transaction corresponding to an executable application;

receive a first transaction notification for the first transaction;

store the first transaction notification in the first node, the transaction notification comprising an output of the executable application;

generate a hierarchical tree data structure comprising at least the first node and at least a second node, the first node being a child node of the second node in the hierarchical tree data structure, the second node associated with a second transaction, the first transaction being a nested transaction initiated by the second transaction; and

establish a current node data pointer, wherein the current node data pointer references a particular node in the hierarchical tree data structure, wherein the particular node is associated with an executing transaction.

8. The system of claim 7 , wherein the program of instructions is further operable to update the current node data pointer to reference a child node in the hierarchical tree data structure.

9. The system of claim 7 , wherein the program of instructions is further operable to update the current node data pointer to reference a parent node in the hierarchical tree data structure.

10. The system of claim 7 , wherein the program of instructions is further operable to store the at least one node under the node referenced by the current node data pointer.

11. The system of claim 7 , wherein the program of instructions is further operable to add a transaction message to the at least one node.

12. The system of claim 7 , wherein the program of instructions is further operable to display the hierarchical tree data structure.

13. Logic encoded in media, the logic being operable, when executed on a processor, to:

generate a first node associated with a first transaction, the first transaction corresponding to an executable application;

receive a first transaction notification for the first transaction;

store the first transaction notification in the first node, the transaction notification comprising an output of the executable application;

generate a hierarchical tree data structure comprising at least the first node and at least a second node, the first node being a child node of the second node in the hierarchical tree data structure, the second node associated with a second transaction, the first transaction being a nested transaction initiated by the second transaction;

establish a current node data pointer, wherein the current node data pointer references a particular node in the hierarchical tree data structure, wherein the particular node is associated with an executing transaction.

14. The logic of claim 13 , wherein the logic is further operable to update the current node data pointer to reference a child node in the hierarchical tree data structure.

15. The logic of claim 13 , wherein the logic is further operable to update the current node data pointer to reference a parent node in the hierarchical tree data structure.

16. The logic of claim 13 , wherein the logic is further operable to store the at least one node under the node referenced by the current node data pointer.

17. The logic of claim 13 , wherein the logic is further operable to add a transaction message to the at least one node.

18. The logic of claim 13 , wherein the logic is further operable to display the hierarchical tree data structure.

Assignments (2)
MERGER Recorded Jan 22, 2014
From: COMPUTER ASSOCIATES THINK, INC.
To: CA, INC.
Reel/Frame 032017/0986 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2007
From: DEFFLER, TAD A.
To: COMPUTER ASSOCIATES THINK, INC.
Reel/Frame 019141/0509 →
Continuity (2)
Provisional Application 60745076 · Apr 18, 2006
Related Publication 20070242624A1 · Oct 18, 2007