Partial Page Approval Model for Database Transaction Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing database management systems face inefficiencies due to strict adherence to atomicity, which can lead to waiting for all changes to be approved even if some changes are not dependent on others, limiting application flexibility and causing delays in transaction processing.
Innovation Solution
A partial approval and partial commit model is introduced, where changes submitted through a user interface page are separated into multiple database transactions, allowing independent asynchronous management, with rules determining which changes require further review and which can be committed directly, enabling flexible transaction grouping and approval processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If strict atomicity is enforced for all database transactions, then data consistency is maintained, but transaction processing efficiency deteriorates due to unnecessary waiting and rollbacks
Solution Approach 1:
The patent segments a single database transaction into multiple independent sub-transactions based on dependency analysis. Changes that do not depend on each other are processed as separate sub-transactions, allowing them to be committed independently without waiting for other changes. This segmentation maintains data consistency for dependent changes while improving efficiency by eliminating unnecessary serialization barriers for independent changes.
Solution Approach 2:
The patent applies partial atomicity by committing only the subset of changes that are ready and independent, rather than waiting for all changes in a transaction to be approved. The system identifies and commits independent sub-transactions immediately while caching dependent changes until their prerequisites are satisfied, thus performing partial action rather than requiring complete transaction approval before any commit.
2Reliability
If all changes are required to be approved before commit, then data security is ensured, but application flexibility deteriorates due to inability to process independent changes
Solution Approach 1:
The patent implements dynamic transaction management where the approval and commit process adapts based on dependency relationships between changes. Independent sub-transactions are automatically identified and committed without manual approval, while dependent changes are cached and processed only when their prerequisites are met. This dynamic approach provides flexibility for independent changes while maintaining security controls for dependent changes.
Solution Approach 2:
The patent introduces a change dependency analysis mechanism that acts as an intermediary between the approval process and transaction commit. This intermediary analyzes dependencies, identifies independent sub-transactions, and determines which changes can be committed immediately versus which require caching and further approval. This intermediary layer enables flexible processing of independent changes while maintaining security oversight for dependent changes.
3Device complexity
If changes are processed synchronously as a single transaction, then simplicity is maintained, but processing speed deteriorates due to sequential execution
Solution Approach 1:
The patent segments synchronous transaction processing into multiple asynchronous sub-transactions based on dependency analysis. Independent changes are identified and processed as separate sub-transactions that can execute in parallel rather than sequentially. This segmentation maintains relative simplicity through automated dependency detection while dramatically improving processing speed by enabling concurrent execution of independent changes.
Solution Approach 2:
The patent implements periodic processing where the system continuously monitors and evaluates cached changes for readiness. When prerequisites are satisfied, cached changes are processed in periodic batches rather than waiting for complete manual approval. This periodic action maintains simplicity through automated scheduling while improving speed by processing changes as soon as they are ready rather than requiring synchronous completion of all changes.
Data Source
AI summary
Techniques are described herein for handling transactions where only a portion of submitted changes are committed. In some embodiments, a system receives, through a page of a user interface, a request to submit a plurality of changes to a set of data objects. The system identifies, based on the page of the user interface through which the request was submitted, a first subset of one or more changes that require further review and a second subset of one or more changes that do not require further review before being committed to the database. The first subset of one or more changes are cached for further review, and a respective approval transaction may be initiated. A commit transaction may be initiated directly for the second set of one or more changes to commit the changes to the database without further review.