Methods and systems involving browser nodes

• US 9,021,401 B2
• Filed: 09/21/2009
• Issued: 04/28/2015
• Est. Priority Date: 09/21/2009
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Cocuzza, Anthony M., Grant, Shayne, Liu, Pu
• Primary Examiner(s): HAILU, TADESSE
• Application Number:
  US12/563,322
• Publication Number:
  US 20110072398A1
• Time in Patent Office: 2,045 Days
• Field of Search: 707/800, 707/815, 715853-855, 711/3, 711/100
• US Class Current: 715/853
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/95 Retrieval from the web

Abstract

A method comprises creating a first node, determining whether an indicator associated with a head node is present, and designating the first node as a head node, defining and associating a head node identifier with the first node, define a link from the first node to the first node, and create and save an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present.

Claims

1. A method comprising:

creating a first node with a processor;

determining whether an indicator associated with a head node is present; and

designating the first node as a head node by defining and associating a head node identifier with the first node, defining a link from the first node to the first node, wherein the link defines a data flow path from the first node to the first node, and creating and saving, in a memory device, an indicator associated with the head node responsive to determining that the indicator associated with a head node is not present, wherein the link from the first node to the first node is saved in a linked list table of a memory, wherein the linked list table includes the link that defines the data flow path from the first node to the first node.

2. The method of claim 1, wherein the method further comprises responsive to determining that the indicator associated with a head node is present:

retrieving a handle of the head node, changing a link of a node linked to the head node to link to the first node, defining a link from the first node to the head node, and defining and saving an identifier of the first node.

3. The method of claim 2, wherein the method further comprises:

requesting state data from the head node; and

updating state data in the first node.

4. The method of claim 1, wherein the first node is a browser window.

5. The method of claim 1, wherein the indicator is a cookie.

6. The method of claim 1, wherein the link from the first node to the first node is a pointer operative to define the data flow path.

7. A computer program product for linking nodes in a browser, the computer program product comprising a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing the method of claim 1.

8. A method comprising:

closing a first node with a processor;

removing the first node from a linked list table stored in a memory device;

determining whether the closed node is a head node;

determining whether the head node is the last sequential node in the linked list table responsive to determining that the closed node is the head node; and

designating a second node as the head node responsive to determining that the closed node is the head node;

defining and associating a head node identifier with the second node responsive to determining that the closed node is the head node and that the head node is not the last sequential node in the linked list table, the defining including defining a link from the second node to the second node, the link defining a data flow path from the first node to the first node, wherein the linked list table includes the link that defines the data flow path from the second node to the second node.

9. The method of claim 8, wherein the method further comprises:

identifying a second node linked to the first node in the linked list table; and

changing a link associated with the second node to link the second node to a next sequential node in the linked list table responsive to determining that the closed node is not the head node.

10. The method of claim 8, wherein the method further comprises deleting an indicator associated with the head node responsive to determining that the closed node is the head node and that the head node is not the last sequential node in the linked list table.

11. The method of claim 10, wherein the method further comprises sending a handle of the second node to linked nodes.

12. The method of claim 11, wherein the method further comprises saving state data in the second node.

13. A computer program product for linking nodes in a browser, the computer program product comprising a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing the method of claim 8.