Tree-Based Session Browse History for Web Navigation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current web browsers rely on stack-based browse history models, which limit user navigation by removing previous links when new ones are added, making it difficult to access previously visited pages efficiently.
Innovation Solution
Implementing a tree-based session browse history data structure that allows for efficient navigation by maintaining all visited links, including child nodes, and providing user interface elements like icons for sequential and random access navigation, with options to save and import browse histories.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If a stack-based browse history model is used, then the browser structure is simple and easy to implement, but previous links are removed when new ones are added, making it difficult to access historical branches
Solution Approach 1:
The patent transitions from a one-dimensional stack-based linear history to a multi-dimensional tree-based hierarchical structure. Each node in the tree represents a visited page and can have multiple child nodes representing different navigation paths. This dimensional change allows users to access any historical branch independently without losing other branches, resolving the contradiction between implementation simplicity and navigation flexibility.
2Adaptability or versatility
If a tree-based session browse history data structure is implemented, then all visited links including historical branches are maintained, but the device complexity increases
Solution Approach 1:
The patent segments the browse history into hierarchical nodes where each node represents a specific page visit and contains its own metadata. The tree structure divides the complex navigation history into manageable segments (parent nodes and child nodes) that can be independently managed, stored, and retrieved. This segmentation reduces the perceived complexity by organizing data in a structured, hierarchical manner that is easier to process than a monolithic flat structure.
3Ease of operation
If traditional navigation bars with back and forward buttons are used, then the interface is simple, but users cannot efficiently re-visit previously accessed links without re-entering URIs
Solution Approach 1:
The patent implements a tree-based browse history that pre-organizes all visited links in an accessible hierarchical structure. Instead of requiring users to re-enter URIs or navigate through linear history, the system maintains all historical branches in advance and allows direct access to any node through the tree structure. This preliminary organization of data eliminates the time loss associated with re-visiting links while keeping the interface simple through intuitive tree-based navigation displays.
Data Source
AI summary
Embodiments of the present invention enable navigation in a web browser to be supported by a session browse history. In embodiments, a session browse history may be an n-ary tree data structure. Embodiments of the present invention integrated into a browser enable a user to access a session browse history tree via browser UI displays such as a navigation bar, a main tool bar, or a combination thereof. In embodiments, a session browse history tree may be exported to persistent storage, and may be imported into and integrated with an active session browse history tree. In embodiments, a stored session browse history tree may be updated in response to handling a caught browser event such as a “browser refresh” event, and in response to processing a user-initiated “go to” request from the browser UI. In embodiments, a currently stored session browse history tree may be returned in response to a request received from the browser UI.