Transaction Memory Management for Data Consistency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current computer systems face inefficiencies in managing transactions among multiple users, leading to long waiting times and data inconsistencies due to the need for deep copies of data, which consume system resources and prolong development cycles.
Innovation Solution
A method and system where changes to data are moved to a transaction memory, allowing read access from either the transaction memory or the basis memory based on user requests, while locking write access to prevent conflicts and minimize data replication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If deep copies are generated for each user initiating a transaction, then data consistency and user isolation are improved, but system resource consumption and transaction waiting time increase
Solution Approach 1:
The patent uses selective copying by creating deep copies only for users who need to work with modified data during a transaction. The system identifies which users are affected by a transaction and generates copies only for them, rather than creating copies for all users. This reduces the number of copies created and the associated system resource consumption while maintaining data consistency for affected users.
Solution Approach 2:
The patent segments the user base into two groups: those affected by the transaction (who receive deep copies) and those not affected (who continue to access the original data). This segmentation allows concurrent access for unaffected users while maintaining data consistency for affected users, thereby reducing overall transaction waiting time while preserving reliability.
2Reliability
If deep copies are generated for each user initiating a transaction, then user isolation during transactions is improved, but system resource consumption increases
Solution Approach 1:
The system implements intelligent copying by creating deep copies only for users who need isolated access during a transaction, rather than creating copies for all users. The patent identifies affected users and generates copies selectively, reducing the quantity of data copied and the system resources consumed while maintaining necessary user isolation.
Solution Approach 2:
The patent applies local quality by providing deep copies only to specific users who need isolation (those affected by the transaction) while allowing other users to access the original data without copies. This localized application of the copying mechanism reduces overall system resource consumption while maintaining user isolation where it is actually needed.
3Reliability
If only one transaction is allowed at a time on a set of data, then data consistency is improved, but transaction throughput and productivity decrease
Solution Approach 1:
The patent uses deep copies to enable multiple concurrent transactions by providing isolated data views to users who need to work with modified data. By creating copies only for affected users, the system allows multiple transactions to proceed simultaneously while maintaining data consistency, thereby increasing transaction throughput without sacrificing reliability.
Solution Approach 2:
The patent introduces deep copies as an intermediary layer between the original data and users who need to work with modified data during transactions. This intermediary allows multiple transactions to access and modify data concurrently without interfering with each other or the original data, thus improving transaction throughput while maintaining data consistency through the isolation provided by the copies.
Data Source
AI summary
A method and system for managing transactions is provided. A transaction is initiated on a first data by a first entity with the first data being comprised in a basis memory. A change in the first data is moved as a second data to a transaction memory. The second data is read from the transaction memory if a request for reading the first data is received from the first entity. The first data is read from the basis memory if the request for reading the first data is received from a second entity. The write access of the second entity to the first data is locked.


