Code Object Dependency Identification via Automated Data Structure
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In systems utilizing a large number of jobs, manually identifying successor jobs is time-consuming and prone to errors, requiring multiple queries and consuming significant processor resources.
Innovation Solution
A server device automatically generates a dependency data structure that identifies predecessor and successor jobs, attributes, and metadata, reducing the need for manual queries and conserving resources by scanning the code set to associate successor jobs with predecessor jobs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If manual identification of successor jobs is performed, then accuracy in identifying dependencies can be maintained, but time consumption and processor resource usage increase significantly
Solution Approach 1:
The patent creates a data structure that copies and represents the dependency relationships between jobs. Instead of manually querying the code set repeatedly, the system generates a replicated data structure that mirrors the job dependencies, allowing fast access and analysis without returning to the original code set.
Solution Approach 2:
The patent performs preliminary analysis by scanning the code set once to identify all dependency relationships between jobs. This preliminary action creates a ready-to-use data structure that captures predecessor-successor relationships, eliminating the need for repeated manual queries and reducing both time and resource consumption for subsequent dependency analysis.
2Loss of information
If multiple queries are performed to identify successor jobs, then comprehensive dependency information can be obtained, but processor resources are consumed significantly
Solution Approach 1:
The patent merges multiple dependency queries into a single comprehensive scan of the code set. By combining all dependency relationship extractions into one processing pass, the system obtains complete dependency information while minimizing processor resource consumption that would otherwise be spent on multiple separate queries.
Solution Approach 2:
The system performs a preliminary comprehensive scan of the code set to extract all dependency relationships in one operation. This preliminary action captures complete dependency information including all predecessor-successor relationships, eliminating the need for subsequent queries and reducing overall processor resource usage.
3Measurement precision
If manual analysis of large code sets is performed, then detailed dependency relationships can be identified, but the process becomes time-consuming and error-prone
Solution Approach 1:
The patent replaces manual mechanical analysis with an automated computational system. The processor systematically scans the code set and extracts dependency relationships using programmed logic, eliminating human error and significantly increasing the speed of dependency identification while maintaining or improving detection accuracy through consistent rule-based analysis.
Solution Approach 2:
The system performs preliminary automated scanning and analysis of the code set to identify all dependency relationships before any manual review or decision-making is required. This preliminary computational action establishes an accurate foundation of dependency data that speeds up the overall process while maintaining high detection accuracy through systematic processing.
Data Source
AI summary
A device may receive a code set that includes a set of objects. The set of objects may include one or more successor objects and one or more predecessor objects corresponding to the one or more successor objects. The device may populate a data structure based on the code set. The data structure may identify each object of the set of objects. The device may identify relationships between the one or more successor objects and the one or more predecessor objects. The device may add, to the data structure and in association with the one or more predecessor objects, dependency information that identifies the relationships between the one or more successor objects and the one or more predecessor objects. The dependency information may identify the one or more successor objects. The device may perform an action based on the dependency information.


