Generalized Reconciliation in Distributed Database Transactions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed database systems face complexity in maintaining consistency due to concurrent transactions, often resulting in unacceptable response times and requiring specific reconciliation procedures for each irresolvable event, which is inefficient and error-prone.
Innovation Solution
A database management system (DBMS) that generalizes consistency control by detecting inconsistencies among uncommitted transactions and generating a semantic preserving transform to reconcile them, eliminating the need for individual coding of reconciliation procedures for each event.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If specific reconciliation procedures are individually coded for each possible irresolvable event, then the system can handle concurrency conflicts, but the device complexity and error-proneness increase significantly
Solution Approach 1:
The patent applies universality by creating a single generalized reconciliation procedure that can handle multiple types of irresolvable events (read-read conflicts, read-write conflicts, write-write conflicts) rather than requiring separate procedures for each event type. The procedure uses a unified approach with three phases (detect inconsistency, generate semantic preserving transform, apply transform) that works across all conflict scenarios, thereby reducing device complexity while maintaining reliable conflict handling.
2Reliability
If transactions are executed in serial order to maintain consistency, then consistency is preserved, but the productivity and response time deteriorate
Solution Approach 1:
The patent applies preliminary action by detecting inconsistencies among transactions before they are committed to the database. The system identifies conflicts during the validation phase and generates semantic preserving transforms in advance, allowing concurrent transactions to proceed without waiting for serial execution. This preliminary detection and resolution enables the system to maintain consistency while achieving high transaction throughput, as transactions don't need to be serialized.
Solution Approach 2:
The patent implements feedback by continuously monitoring the database state and detecting inconsistencies among concurrent transactions. The system uses feedback from consistency checks to generate appropriate semantic preserving transforms that resolve conflicts without aborting transactions. This feedback mechanism allows the system to maintain data consistency while enabling concurrent transaction execution, thereby improving productivity compared to serial processing.
3Productivity
If optimistic concurrency control is used to allow concurrent transactions, then productivity improves, but the reliability decreases due to transaction abortion when inconsistencies are detected
Solution Approach 1:
The patent applies the blessing in disguise principle by converting the harmful effect of detected inconsistencies into a beneficial resolution process. Instead of simply aborting transactions when conflicts are detected (which would reduce reliability), the system generates semantic preserving transforms that resolve the inconsistencies and allow transactions to commit successfully. The harm of conflict detection becomes the trigger for an intelligent resolution process that maintains both productivity and reliability.
Data Source
AI summary
Embodiments of the present disclosure include systems and methods for generalized consistency control of database transactions in a distributed database. In distributed database systems a specific reconciliation procedure is typically needed and coded for each possible irresolvable event. The systems and methods described herein enable a general characterization of multiple types of irresolvable events and thus eliminate and/or reduce the need to write individual code for every specific event.