Dynamic Breadcrumb Tree Structure for Web Navigation Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing breadcrumb trail systems face limitations in dynamically adapting to changing web page structures and supporting dynamic page functions, particularly due to restrictions in static coding and cookie storage capabilities, which hinder effective navigation and user experience.
Innovation Solution
A breadcrumb method and system that generates a tree structure with a breadcrumb root node and task nodes, allowing for dynamic association and connection of subtask nodes based on user requests, using session storage to maintain page status and support business logic policies, thereby enhancing navigation and preventing repetitive operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If static coding method is used to execute breadcrumb trail, then implementation is simple, but it cannot adapt to dynamic browse behaviors and web content changes
Solution Approach 1:
The patent implements a dynamic breadcrumb trail system that automatically updates based on user navigation behavior. The system generates breadcrumb trails dynamically as users browse through web pages, allowing the trail to adapt to changing browse behaviors and web content without requiring manual recoding. This resolves the contradiction by making the system dynamic rather than static.
Solution Approach 2:
The breadcrumb trail system automatically generates and updates itself based on user navigation patterns without requiring manual intervention. The system self-adapts to web content changes by detecting user browsing behavior and automatically adjusting the breadcrumb trail structure, eliminating the need for developers to manually update static code for every change.
2Reliability
If cookie-based user-end breadcrumb trail is used, then user status can be maintained, but browser compatibility and storage capacity are restricted
Solution Approach 1:
The patent introduces a server-side session management mechanism as an intermediary between the user and the breadcrumb trail system. Instead of relying directly on browser cookies, the system uses server-side sessions to store and manage user status information, which resolves browser compatibility issues while maintaining reliable user status tracking.
Solution Approach 2:
The system creates a server-side copy of user status information that is independent of browser cookie limitations. By maintaining user state on the server rather than relying solely on client-side cookies, the system overcomes browser compatibility restrictions and storage capacity limits while preserving user status information.
3Ease of operation
If breadcrumb trail includes all web pages in browse history, then complete navigation is provided, but repetitive operations cannot be prevented
Solution Approach 1:
The patent implements a feedback mechanism that monitors user navigation and provides information about previously completed operations. The system analyzes the breadcrumb trail to detect when a user attempts to perform a repetitive operation and provides feedback to prevent the operation, thus maintaining business logic compliance while preserving complete navigation capability.
Solution Approach 2:
The system performs preliminary analysis of the breadcrumb trail to identify operations that have already been completed before allowing new operations. By checking the navigation history in advance, the system can prevent repetitive operations from being executed while still providing users with complete navigation options through the breadcrumb trail.
Data Source
AI summary
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.