Method and system for web page breadcrumb

Patent metadata

Field	Value
Publication number	US-9613151-B2
Application number	US-75566210-A
Country	US
Kind code	B2
Filing date	Apr 7, 2010
Priority date	May 15, 2009
Publication date	Apr 4, 2017
Grant date	Apr 4, 2017

Abstract

A breadcrumb method, system and computer program product for a website. In response to a request for visiting the website, a breadcrumb root node is generated in a tree structure. In response to receiving a request for visiting a first web task associated with the website, a first task node is generated in the tree structure at the breadcrumb root node. In response to sequentially receiving requests for multiple subtasks of the first web task, multiple subtask nodes of the first task node are sequentially established in the tree structure. The subtask nodes of the multiple subtask nodes of the first task node are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task. The multiple subtask nodes of the first task node are processed based a policy of the first web task.

First claim

What is claimed is:

1. A breadcrumb method for a website, said method comprising:
in response to a request for visiting the website, a processor of a computer system generating a breadcrumb root node in a tree structure;
after said generating the breadcrumb root node and in response to receiving a request for visiting a first web task associated with the website, said processor generating a first task node in the tree structure at the breadcrumb root node;
after said generating the first task node and in response to sequentially receiving requests for multiple subtasks of the first web task, said processor sequentially establishing in the tree structure multiple subtask nodes of the first task node, wherein the subtask nodes of the multiple subtask nodes of the first task node are respectively associated with the subtasks of the multiple subtasks of the first web task and are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task; and
after said sequentially establishing in the tree structure the multiple subtask nodes of the first task node, said processor processing the multiple subtask nodes of the first task node based a policy of the first web task.

2. The method of claim 1 , wherein said processing the multiple subtask nodes of the first task node based on the policy of the first web task comprises:
prohibiting the first web task from being performed repeatedly during a visit to the website; and
in response to the first web task having been completed, removing the multiple subtask nodes of the first task node.

3. The method of claim 1 , wherein said processing the multiple subtask nodes of the first task node based on the policy of the first web task comprises:
prohibiting the first web task from being performed repeatedly during a visit to the website;
in response to the first web task having been completed, setting both the first task node and the multiple subtask nodes of the first task node into a read-only mode; and
in response to said setting both the first task node and the multiple subtask nodes of the first task node into the read-only mode, setting a page associated with the first task node and pages associated with the multiple subtask nodes of the first task node into the read-only mode.

4. The method of claim 1 , wherein said processing the multiple subtask nodes of the first task node based on the policy of the first web task comprises:
prohibiting a first subtask of the multiple subtasks of the first web task from being performed repeatedly during a visit to the website; and
in response to the first web task having been completed, removing a first subtask node of the multiple subtask nodes of the first task node, wherein the first subtask node is associated with the first subtask.

5. The method of claim 1 , wherein the multiple subtask nodes of the first task node comprises a first subtask node, a third subtask node identical to the first subtask node, and a second subtask node between and connected to the first and third subtask nodes, and wherein said processing the multiple subtask nodes of the first task node based at least one policy of the first web task comprises:
prohibiting looping through the subtasks of the multiple subtasks of the first web task; and
in response to the third subtask node being identical to the first subtask node, setting the first subtask node as a current subtask node and removing the second and third subtask nodes.

6. The method of claim 1 , wherein the method further comprises:
after said generating the breadcrumb root node and in response to receiving a request for visiting a second web task associated with the website, said processor generating a second task node in the tree structure at the breadcrumb root node;
after said generating the second task node and in response to sequentially receiving requests for multiple subtasks of the second web task, said processor sequentially establishing in the tree structure multiple subtask nodes of the second task node, wherein the subtask nodes of the multiple subtask nodes of the second task node are respectively associated with the subtasks of the multiple subtasks of the second web task and are sequentially connected to the second task node according to a sequential order of the sequentially received requests for the multiple subtasks of the second web task;
after said sequentially establishing in the tree structure the multiple subtask nodes of the second task node, said processor processing the multiple subtask nodes of the second task node based a policy of the second web task; and
after said sequentially establishing in the tree structure the multiple subtask nodes of the first task node, said processor processing at least one subtask node of the multiple subtask nodes of the first task node based the policy of the second web task, wherein the first web task is correlated with the second web task.

7. The method of claim 6 , wherein said processing the at least one subtask node of the multiple subtask nodes of the first task node based on the policy of the second web task comprises:
filtering the at least one subtask node of the multiple subtask nodes of the first task node into a read-only mode.

8. A computer program product, comprising a computer readable hardware storage medium having a computer readable program code stored therein, said computer readable program code containing instructions configured to be executed by a processor of a computer system to implement a breadcrumb method for a website, said method comprising:
in response to a request for visiting the website, generating a breadcrumb root node in a tree structure;
after said generating the breadcrumb root node and in response to receiving a request for visiting a first web task associated with the website, generating a first task node in the tree structure at the breadcrumb root node;
after said generating the first task node and in response to sequentially receiving requests for multiple subtasks of the first web task, sequentially establishing in the tree structure multiple subtask nodes of the first task node, wherein the subtask nodes of the multiple subtask nodes of the first task node are respectively associated with the subtasks of the multiple subtasks of the first web task and are sequentially connected to the first task node according to a sequential order of the sequentially received requests for the multiple subtasks of the first web task; and
after said sequentially establishing in the tree structure the multiple subtask nodes of the first task node, processing the multiple subtask nodes of the first task node based a policy of the first web task.

9. The computer program product of claim 8 , wherein said processing the multiple subtask nodes of the first task node based on the policy of the first web task comprises:
prohibiting the first web task from being performed repeatedly during a visit to the website; and
in response to the first web task having been completed, removing the multiple subtask nodes of the first task node.

10. The computer program product of claim 8 , wherein said processing the multiple subtask nodes of the first task node based on the policy of the first web task comprises:
prohibiting the first web task from being performed repeatedly during a visit to the website;
in response to the first web task having been completed, setting both the first task node and the multiple subtask nodes of the first task node into a read-only mode; and
in response to said setting both the first task node and the multiple subtask nodes of the first task node into the read-only mode, setting a page ass

Assignees

• Liu Jian
• Meliksetian Dikran S
• Sun Yang
• Wang zhi jun
• IBM

Inventors

• Liu Jian
• Meliksetian Dikran S
• Sun Yang
• Wang zhi jun

Classifications

• H04L67/1095

  Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes · CPC title

• G06F16/24

  Querying · CPC title

• G06F16/951

  Indexing; Web crawling techniques · CPC title

• G06F16/954 Primary

  Navigation, e.g. using categorised browsing · CPC title

• G06F16/9027

  Trees · CPC title