Tag-Mediated Data Structures for Format-Change Adaptation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing application programs require laborious and time-consuming reprogramming to accommodate changes in data structures from different data sources, especially when modifications occur, which is opaque to business users and complicates claim processing in mission-critical systems.
Innovation Solution
The creation and application of tags to data structures, allowing business users to define categorizations that can be evaluated during processing, thereby minimizing or eliminating the need for reprogramming, as the tags accommodate format changes in the data structures.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If application programs are hardcoded to process data structures from multiple data sources, then the application can handle diverse data formats, but reprogramming is required when data structures are modified
Solution Approach 1:
The patent introduces a data structure mediator layer between data sources and the application program. This mediator translates and adapts data structures from various sources into a standardized internal format, allowing the application to handle diverse data formats without requiring reprogramming when source data structures change. The mediator absorbs the complexity of data format variations while presenting a stable interface to the application logic.
2Adaptability or versatility
If reprogramming is performed to accommodate data structure changes, then the application can process updated data formats, but the process is laborious and time-consuming
Solution Approach 1:
The patent implements preliminary action by pre-defining standardized data structure templates and schemas that the application expects. Data from external sources is transformed into these predetermined templates before reaching the application logic. When data formats change, only the transformation layer needs updating, not the core application logic, significantly reducing reprogramming time and effort.
3Reliability
If reprogramming is performed for data structure modifications, then processing can continue with updated formats, but the process is opaque to business users
Solution Approach 1:
The data structure mediator acts as an opaque translation layer that business users do not need to understand or interact with directly. Users continue to work with their original data formats through the mediator, which automatically handles format transformations in the background. This maintains processing continuity while keeping the reprogramming process transparent to users, as they experience no change in interface or operation.
4Adaptability or versatility
If application programs are reprogrammed for data structure changes, then updated data can be processed, but mission-critical systems with many dependencies become more complex
Solution Approach 1:
The patent segments the system into distinct layers: data source layer, mediator translation layer, and application logic layer. Each layer has well-defined interfaces and responsibilities. The mediator handles data format adaptation independently, while the application logic remains unchanged and focused on business rules. This segmentation isolates complexity to the mediator layer, preventing it from propagating through the entire system and affecting other dependencies.
Data Source
AI summary
This disclosure enables (1) creation of various tags and (2) tagging of various data structures identified above with such tags. Therefore, once tagged, these data structures can be processed by various application programs, without reprograming of these application programs or with minimal reprogramming of these application programs, because these tags accommodate or account for potential changes to these data structures (e.g., in format) that are made before these data structure are received for processing, as explained above. For example, some of such tags may be business user defined categorizations of data structures that can be evaluated during processing of some of such data structures and subsequently used as inputs to a standardized logic, thereby eliminating of reprogramming of these application programs or minimizing reprogramming of these application programs.