Data Tree Field Identification Using FAN and NRK Keys
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data management technologies face challenges in accurately identifying and modifying fields in a data tree structure, particularly when the data is rendered on a webpage, leading to potential data corruption due to incomplete or outdated location information.
Innovation Solution
The use of a Field Address Number (FAN) and a New Row Key (NRK) system allows for efficient identification and modification of fields in a data tree structure, even when the field has not been rendered for display, by utilizing a field key lookup map to locate the correct address object and update the data accordingly.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the entire location information string is transmitted to update a field, then the field can be accurately updated, but the transmission efficiency decreases and data loss increases when parts of the string are missing
Solution Approach 1:
The patent segments the location information into two distinct components: a compact field key (FAN, NRK) that identifies the field, and a separate address string that provides detailed location information. This segmentation allows the system to transmit only the essential field key for identification while maintaining the option to transmit the full address string when needed for complete accuracy, thus resolving the contradiction between reliability and information loss.
Solution Approach 2:
The patent introduces a field key lookup map as an intermediary data structure that maps field keys to their corresponding address strings. This intermediary allows the system to efficiently locate and retrieve complete address information using only the compact field key, thereby maintaining data accuracy without requiring constant transmission of the entire location string.
2Reliability
If the location string is updated after sorting and reloading data, then data corruption is prevented, but the complexity of data management increases
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing the mapping between field keys and address strings in the field key lookup map before data sorting and reloading operations. This preliminary preparation ensures that even when data positions change during sorting, the field keys remain valid identifiers that can be quickly resolved to correct addresses, preventing data corruption without requiring complex real-time updates during the sorting process.
Solution Approach 2:
The system implements a feedback mechanism where the field key lookup map is dynamically updated and maintained in sync with the data tree structure. When data is sorted or reloaded, the lookup map is regenerated to reflect new positions, providing continuous feedback that ensures field keys always map to correct locations, thereby maintaining data integrity while managing complexity through automated synchronization.
3Loss of information
If a compact field key system is implemented, then transmission efficiency improves, but the difficulty of detecting and measuring field locations increases
Solution Approach 1:
The field key lookup map serves as an intermediary that bridges the compact field key system and the detailed address information. When field location identification is needed, the system uses the field key to query the lookup map, which returns the complete address string. This intermediary mechanism maintains transmission efficiency by using compact keys while eliminating the difficulty of detecting field locations by providing a straightforward lookup process.
Data Source
AI summary
Methods, apparatuses, and computer program products are provided for an address system to identify a field and/or a row in a data structure. A method may include receiving a request to modify a field of data, wherein the field of data is identified by a received field key. A method may also include determining whether the field of data was rendered for display. A method may also include modifying the field in a tree structure in an instance in which the field of data was rendered for display, wherein the received field key is configured locate an address object that is related to the field. A method may also include modifying the field of data in a tree structure in an instance in which the field of data was not rendered for display by locating the received field key in a field key lookup map, wherein the field key lookup map is configured to locate the address object.