Mapping Tables Decouple Data Store Synchronization Dependencies
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for synchronizing data store tables are inefficient due to the need to update multiple tables when a single element changes, leading to synchronization bottlenecks and unnecessary duplication, especially when versioning is involved.
Innovation Solution
The introduction of mapping tables to manage dependencies between data store tables, allowing updates to be propagated efficiently by linking new entries in these tables rather than modifying each table individually, thereby reducing processing overhead and enhancing flexibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If pointers or links are placed in one data store table to point to another data store table for integration, then information integration and valuable insights are provided, but synchronization bottlenecks occur when updates propagate through multiple tables
Solution Approach 1:
The patent introduces mapping tables as intermediary structures that decouple the direct pointer relationships between data store tables. Instead of tables directly pointing to each other, mapping tables serve as intermediaries that store the linkage information. When updates occur, they propagate through these mapping tables rather than traversing the entire chain of linked tables, significantly reducing synchronization time and bottlenecks while maintaining the integrated information structure.
2Reliability
If each table in the chain is visited and updated when a single element changes, then synchronization is maintained, but processing overhead and time consumption increase significantly
Solution Approach 1:
The patent segments the synchronization process by separating the data storage function (in data store tables) from the linkage management function (in mapping tables). This segmentation allows updates to be propagated only to the necessary mapping tables rather than visiting every table in the chain. The mapping tables act as a filtered distribution layer, delivering updates only where needed, thereby reducing update propagation time while maintaining synchronization accuracy.
3Adaptability or versatility
If versioning of information is maintained within each independent table, then historical data is preserved, but the complexity of managing updates across multiple versions increases
Solution Approach 1:
The mapping tables serve as intermediaries that manage versioning relationships between tables. Instead of each table independently tracking versions of linked records, the mapping tables centralize the version management functionality. When a record is updated, the mapping table can track the version change and selectively update only those tables that need to know about the version change, reducing the complexity of managing updates across multiple versions while preserving the ability to maintain historical data.
Data Source
AI summary
Techniques are presented for synchronizing data store tables. Elements of first tables are linked together to form dependent chains. The dependencies are not housed with the elements in the first tables; rather, the dependencies are housed in multiple second tables. Each second table maps one of the elements from one of the first tables to another of the elements in another of the first tables.