Dualistic Sequence Data Integrity Delayed Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data processing systems face inefficiencies in updating shared data, particularly when multiple users are involved, as they often require locking the data for editing, leading to unnecessary resource usage and conflicts, especially when updates are made before the information is needed.
Innovation Solution
A dualistic sequence method is introduced, which includes an unambiguous global sequence and deviation information to track local changes, allowing updates to be postponed until necessary, thereby reducing computing load and maintaining data integrity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is locked for editing when a user retrieves a copy, then data integrity is maintained, but other users cannot access the data and computing resources are used inefficiently
Solution Approach 1:
The patent segments the data access process into two distinct modes: reading mode and updating mode. In reading mode, users can access data without locking, while in updating mode, locking is applied only when necessary. This segmentation allows multiple users to read simultaneously without interference, improving access efficiency while maintaining data integrity during updates through controlled locking mechanisms.
Solution Approach 2:
The patent implements dynamic locking where the lock state is not fixed but changes based on the user's actions. The system transitions from an unlocked state (allowing multiple readers) to a locked state (preventing writes) only when a user intends to update data. This dynamic approach optimizes resource utilization by applying locks minimally and only when necessary for data integrity.
2Reliability
If updates are performed immediately when data is modified, then data consistency is maintained, but computing resources are wasted on unnecessary updates
Solution Approach 1:
The patent implements preliminary actions by collecting and buffering data modifications locally before performing updates. Instead of immediately propagating every change to the shared memory, the system accumulates changes and performs batch updates only when necessary (e.g., when the user closes the document or explicitly saves). This preliminary buffering reduces unnecessary update operations and conserves computing resources while maintaining data consistency through controlled synchronization.
Solution Approach 2:
The patent changes the update frequency parameter from immediate (real-time) to delayed (on-demand or batch). By adjusting this parameter, the system can optimize between data consistency and resource consumption based on the specific use case. The update timing is no longer fixed but becomes a configurable parameter that can be adapted to balance consistency requirements against computational cost.
3Loss of information
If the entire file is updated and stored back to shared memory, then all modifications are propagated, but computing resources are inefficiently used by updating information that may change multiple times before being needed
Solution Approach 1:
The patent extracts only the essential modification information from the entire file and stores it separately in the shared memory, rather than updating the complete file. The system identifies and extracts specific changed elements (e.g., individual data fields or objects) and stores only these extracted modifications. This approach ensures that modification information is preserved and propagated while avoiding the computational overhead of updating and transferring entire files, thus improving resource efficiency.
Solution Approach 2:
The patent applies partial action by performing updates only on the specific portions of data that have actually changed, rather than updating the entire file. The system identifies the minimal set of modified elements and applies updates selectively to these partial components. This partial update strategy reduces the amount of data processing and storage operations required, improving computing resource efficiency while ensuring that all necessary modifications are still propagated to maintain information integrity.
Data Source
AI summary
To provide delayed updating of shared data, a concept of dualistic sequence information is introduced. In the concept, if during local modification of data, a modification to the data is published by another user, a local deviation is created, and when the modification is published, it is associated with an unambiguous sequence reference and the local deviation.