PROCESSING TREE STRUCTURE HAVING BREADCRUMB ROOT NODE

PROCESSING TREE STRUCTURE HAVING BREADCRUMB ROOT NODE

In response to receiving a request for visiting a first web task associated with a website, a first task node is generated at a breadcrumb root node in a tree structure. In response to sequentially receiving requests for multiple subtasks of the first web task, multiple subtask nodes of the first ta...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liu, Jian, Sun, Yang, Meliksetian, Dikran S, Wang, Zhi J
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In response to receiving a request for visiting a first web task associated with a website, a first task node is generated at a breadcrumb root node in a tree structure. 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, which includes dynamically reconfiguring the multiple subtask nodes of the first task node in response to the user's visitation of one or more subtask nodes of the multiple subtask nodes.