Hash-Based Browsing Sequence Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing solutions for identifying sequential browsing operations are inefficient, as they either validate only pre-defined sequences or require re-exploration of websites, leading to high costs in terms of time and processing resources, especially when validating automated test responses against original data.
Innovation Solution
A computer-implemented process that receives session data, creates reduced pages with hash values for each page, compares these values across sessions, and merges equivalent pages to identify common sequences without resending requests to a server, allowing for efficient identification of sequential browsing operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If entire collected data is used as a sequence for validation, then completeness of test validation is improved, but processing time and resource consumption increase significantly
Solution Approach 1:
The patent extracts only the essential elements needed for validation by creating reduced pages that contain only the structural information necessary for comparison. This extraction process removes unnecessary data while retaining the core information needed to identify sequential browsing operations, thereby reducing processing time and resource consumption while maintaining validation completeness.
Solution Approach 2:
The patent transforms the validation approach by changing parameters from comparing entire collected data sequences to comparing hash values of reduced pages. This parameter change from full-data comparison to hash-based comparison significantly reduces processing time and resource consumption while maintaining the ability to accurately identify sequential browsing operations.
2Extent of automation
If re-exploration of website is performed to identify request dependencies, then automated crawling capability is improved, but time cost and processing resource consumption increase
Solution Approach 1:
The patent performs preliminary action by collecting and storing page data during the initial browsing session. This preliminary data collection eliminates the need for re-exploration of the website during validation, as all necessary information is already available in the collected session data. The system processes this pre-collected data to identify sequential browsing operations without requiring additional website visits.
3Measurement precision
If requests are resent in various combinations for validation, then test response validation accuracy is improved, but processing resource consumption and time cost increase
Solution Approach 1:
The patent creates copies of page data in the form of reduced pages with hash values, which serve as lightweight representations of the original pages. These copies can be compared rapidly without requiring actual HTTP requests to be resent. The hash value comparison provides sufficient validation accuracy while dramatically improving processing efficiency compared to resending requests in various combinations.
Data Source
AI summary
Identifying sequential browsing operations includes receiving session data associated with a plurality of sessions, creating a reduced page for each page in a series of pages associated with a first session in the plurality of sessions, and creating a hash value associated with each reduced page for each page in the series of pages associated with the first session of the plurality of sessions. Responsive to a determination that the hash value of the first session is equivalent to the hash value of the second session, an associated page is identified as an equivalent page and the equivalent pages are merged to create a common sequence without a need to resend requests associated with the session data to a server.