Interrelated Data Access via Configuration Language
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current computer systems lack an efficient method to interrelate multiple large source data files of varying types and provide ordered access, often requiring complex programming and multiple runtime executions due to limitations in existing technologies like RPG and SQL, which are designed for two-file interrelations and struggle with more complex data relationships.
Innovation Solution
A computer-implemented method and system using an interrelated data integration application with an interlinear sort component and an interrelated data access component, which processes multiple source data files according to a graphical representation of their relationships defined in a configuration language, allowing for 'upon', 'before', and 'after' record sequence processing, and generating a composite data file in the desired order.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional RPG or SQL methods are used to interrelate data files, then two-file interrelation is supported, but complex multi-file relationships cannot be efficiently handled
Solution Approach 1:
The patent introduces a configuration language as an intermediary layer between the user and the data processing system. This configuration language allows users to define complex multi-file relationships in a simplified, declarative manner, while the system automatically translates these configurations into the necessary processing steps, eliminating the need for complex programming
Solution Approach 2:
The patent replaces the mechanical approach of manually programming complex file relationships with an automated configuration-based system. Instead of requiring programmers to write complex code to handle multiple files, the system uses configuration files that automatically generate the necessary processing logic, substituting mechanical programming with automated configuration interpretation
2Productivity
If multiple runtime executions are performed to process complex data relationships, then data can be processed, but processing time increases
Solution Approach 1:
The patent performs preliminary action by parsing and validating the configuration file before actual data processing occurs. The system pre-compiles the configuration into an execution plan that optimizes the processing sequence, allowing the actual data processing to proceed more efficiently without requiring multiple runtime executions
Solution Approach 2:
The patent enables continuous processing by creating a single unified execution plan that handles all files in the correct sequence. Instead of stopping and restarting for different files, the system maintains continuous processing flow through optimized file sequencing, reducing idle time between operations
3Adaptability or versatility
If detailed programming is required to define file relationships, then processing can be customized, but ease of operation decreases
Solution Approach 1:
The patent changes the parameters of interaction from detailed programming commands to high-level configuration statements. Users can define file relationships using simple, intuitive parameters in the configuration language, and the system automatically handles the complex translation to executable code, maintaining customization capability while dramatically improving ease of operation
Data Source
AI summary
A computer implemented method and system for interrelating and providing ordered access to source data files (SDFs) is provided. Each SDF contains one or more records. A parsing component compiles a configuration language (CL) and generates file descriptors usable by an interlinear sort component (ISC) and an interrelated data access component (IDAC). The CL defines adopt and order key fields, a lineage relationship between the SDFs, and one or more predetermined subprograms. The subprograms process an instance of a record from a SDF and a start point and an end point of a sequence or a subsequence of related records from the SDF. The ISC sorts each SDF into the order defined in the CL and attaches a parent position number (PPN) to each child file record. The IDAC uses the PPN to access the sorted SDFs in the order defined by the CL and execute the defined subprograms.


