Idempotence Service Transaction Data Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing idempotence services face performance and throughput issues when maintaining idempotence of transactions, particularly in non-relational database systems where cleanup processes are resource-intensive and inefficient, especially when dealing with large data stores and varying idempotence windows.
Innovation Solution
Implementing a mechanism that uses multiple idempotence tables to archive and cleanup transaction data within a specified idempotence window, allowing for efficient reuse of idempotence keys and reducing the burden on system resources by mirroring transaction data between tables and periodically deleting older tables.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single large idempotence table is used to store all transaction data, then data completeness is maintained, but system resources are heavily consumed and throughput decreases
Solution Approach 1:
The patent divides a single large idempotence table into multiple smaller tables (first idempotence table and second idempotence table). Each table stores a portion of the transaction data, allowing parallel processing and reducing the resource burden on any single table while maintaining complete data coverage across all tables.
2Reliability
If transaction data is retained indefinitely for idempotence verification, then duplicate transaction prevention is ensured, but storage resources are excessively consumed
Solution Approach 1:
The patent implements periodic cleanup by deleting the first idempotence table after its data has been copied to the second table. This periodic deletion releases storage resources while maintaining idempotence verification capability through the second table, which retains the necessary transaction data.
Solution Approach 2:
The patent discards old transaction data from the first idempotence table after it has been successfully copied to the second table, and recovers the storage resources by deleting the first table. This ensures that storage resources are continuously recovered and reused while maintaining the necessary data for idempotence verification.
3Quantity of substance
If cleanup processes are performed frequently to free resources, then storage efficiency is improved, but system performance and throughput are negatively impacted
Solution Approach 1:
The patent performs the data copying operation from the first table to the second table as a preliminary action before deleting the first table. This ensures that all necessary data is safely transferred and verified before resource release, maintaining data integrity while enabling efficient cleanup without performance penalties.
4Adaptability or versatility
If the idempotence window is made flexible to accommodate varying transaction requirements, then system adaptability is improved, but complexity of managing multiple tables increases
Solution Approach 1:
The patent implements dynamic table management where the system can switch between using the first idempotence table and the second idempotence table based on the current idempotence window requirements. This dynamic switching allows the system to adapt to varying transaction requirements while maintaining manageable complexity through a systematic table rotation approach.
Data Source
AI summary
Disclosed are various implementations of systems that facilitate idempotence of transactions that are generated by a client application executed by a client device. Systems and methods described herein also facilitate cleanup of transaction data that is outside an idempotence window provided by an idempotence service.