Table Storage Support Scheme for Efficient Data Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing table storage schemes face inefficiencies in updating large tables due to the need for multiple copies of the table, leading to high memory usage and prolonged access times during copying operations, especially for nested transactions.
Innovation Solution
The proposed table storage support scheme divides the table into portions, allowing for the update of individual pages without generating copies of non-updated pages, using smaller data structures to track updates and reserve logical memory space for multiple versions, reducing physical memory usage and update time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple copies of the table are generated to support update transactions, then transaction reliability is improved, but memory space consumption increases
Solution Approach 1:
The patent divides the table into multiple portions (e.g., pages) and maintains separate versions of only the updated portions rather than copying the entire table. This segmentation allows the system to store multiple table versions for transaction reliability while minimizing memory consumption by only duplicating changed portions.
Solution Approach 2:
The patent extracts only the modified portions of the table from the complete table structure and stores these as separate versions. By taking out only the necessary updated portions rather than the entire table, the system achieves transaction reliability without the memory overhead of full table copies.
2Reliability
If the entire table is copied to generate an updateable table, then update operation reliability is improved, but update time increases
Solution Approach 1:
The patent segments the table into portions and copies only the necessary portions for updates rather than copying the entire table. This reduces the time required for table copying operations while maintaining reliability through proper version management of the segmented portions.
Solution Approach 2:
The patent applies partial action by copying only the portions of the table that need to be updated, rather than performing a complete table copy. This partial copying approach reduces update time while still providing the necessary reliability for transaction processing.
3Adaptability or versatility
If physical memory blocks are reserved for multiple table versions, then version storage capability is improved, but device complexity increases
Solution Approach 1:
The patent segments the table into portions and uses a logical memory address space with pointers to track versions of these portions. This segmentation approach provides version storage capability while reducing complexity by using a simplified pointer-based system rather than complex physical memory block management.
Solution Approach 2:
The patent introduces a data structure that acts as an intermediary between the table portions and the memory allocation system. This intermediary uses pointers to track and manage versions of table portions, simplifying the overall memory management complexity while maintaining version storage capability.
4Quantity of substance
If a data structure is used to track updated portions, then memory usage is reduced, but data structure management complexity increases
Solution Approach 1:
The patent creates a simplified data structure that copies only the essential information needed to track updated portions, rather than maintaining full table copies. This copying approach reduces memory usage while the structured format of the data structure makes management more systematic and less complex.
Data Source
AI summary
A data storage device may be configured to update a table used by a host device, such as a table stored at the data storage device. For, example, the data storage device may generate and store an updated version of a portion of the table. A storage location of the updated version of the portion may be tracked using a data structure that corresponds to a second version of the table. The second version of the table may be discarded or made accessible to the host device responsive to an indicator detected by the data storage device.