Code Scanning Jump Rule Matching via Domain Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing code scanning technologies face inefficiencies and accuracy issues when scanning identification codes generated by third parties, as they require extensive mapping and cyclic traversal, leading to increased workload and long matching times.
Innovation Solution
A data processing method and system that pre-classify identification codes based on resource paths, using a regular library to determine a target regular and then query a jump address from a rule library, reducing the number of configured regulars and improving matching efficiency and accuracy.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If scanning mapping with cyclic traversal is used to match code values with jump addresses, then comprehensive matching coverage is achieved, but matching time becomes relatively long
Solution Approach 1:
The patent pre-processes code values by extracting domain names and organizing them into a trie data structure before actual scanning operations. This preliminary organization allows the system to quickly locate potential jump addresses without performing full cyclic traversal during runtime, significantly reducing matching time while maintaining comprehensive coverage through the structured index.
Solution Approach 2:
The patent segments the code value into meaningful components (domain name, path, parameters) and uses the domain name as the primary indexing key in the trie structure. This segmentation transforms the monolithic matching problem into hierarchical lookups, where the system first matches domain names and then narrows down to specific jump addresses, avoiding exhaustive cyclic traversal of all possible matches.
2Measurement precision
If comprehensive mapping relationships are stored for all identification codes, then matching accuracy is improved, but data processing workload increases
Solution Approach 1:
The patent extracts only the domain name portion from complete code values to serve as indexing keys in the trie structure. This extraction approach maintains matching accuracy by preserving the unique identifier (domain name) while discarding redundant information (path and parameters), thereby reducing the data processing workload without sacrificing the ability to accurately identify jump addresses.
Solution Approach 2:
The system performs preliminary extraction and organization of domain names from all possible code values during system initialization or code generation phases. This pre-processing creates an optimized index structure that reduces the complexity of runtime matching operations, as the system only needs to perform efficient trie lookups rather than processing complete mapping relationships for all codes.
Data Source
AI summary
One or more embodiments of the present specification relate to a data processing method, apparatus, device, and system for code scanning jumps. An example method includes receiving scan data resulting from a client application having been used to scan an identification code, in which the identification code and the client application have been created under different platforms. A domain name is obtained from the scan data, and a target regular expression corresponding to the domain name is obtained from a regular expression library. A jump rule string corresponding to the identification code is determined based on the target regular expression and a resource path of the domain name of the identification code, and a jump address corresponding to the jump rule string is queried from a rule library that includes mapping relationships between jump rule strings and jump addresses.