Hash Chain Migration via Subchain Segmentation and Concurrent Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for migrating programming objects with hash chains between different versions are inefficient, as they often require creating new copies or are not compatible, leading to challenges in updating and processing information across varying field names, values, data types, and logic.
Innovation Solution
A method and system for hash chain migration that involves subdividing the original hash chain into subchains, processing them concurrently, and generating a migration chain using container blocks and a priority queue to maintain order, allowing for seamless updates and access across different versions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional copying methods are used for object migration, then data integrity is maintained, but processing efficiency deteriorates due to the need to create new copies
Solution Approach 1:
The hash chain is divided into multiple sub-chains, allowing parallel processing of migration tasks. Each sub-chain can be processed independently by different threads, maintaining data integrity while significantly improving processing efficiency through concurrent operations.
Solution Approach 2:
The patent uses selective copying where only necessary portions of the hash chain are copied during migration. Instead of creating complete copies of the entire hash chain, the system copies and processes sub-chains in parallel, reducing the overhead of traditional copying methods while maintaining data integrity.
2Adaptability or versatility
If hash chains are migrated between different object versions, then compatibility is improved, but system complexity increases due to version management
Solution Approach 1:
The migration system dynamically adapts to different object versions by detecting version changes and automatically adjusting the migration process. The system can handle different field names, values, data types, and logic across versions without requiring manual intervention, making the version management process dynamic and flexible.
Solution Approach 2:
The hash chain migration system performs self-service by automatically detecting version updates and executing the migration process without external intervention. The system monitors for version changes, identifies affected sub-chains, and processes migrations autonomously, reducing the complexity burden on the overall system.
3Ease of operation
If sequential processing is used for hash chain migration, then simplicity is maintained, but migration speed deteriorates
Solution Approach 1:
By segmenting the hash chain into multiple sub-chains, the system enables parallel processing while maintaining the logical simplicity of sequential operations. Each sub-chain can be processed independently and concurrently, dramatically increasing migration speed while the overall process structure remains conceptually simple and easy to implement.
Solution Approach 2:
The patent transitions from a single-dimensional sequential processing model to a multi-dimensional parallel processing model. By introducing the dimension of parallel thread execution, the system maintains operational simplicity at the conceptual level while achieving significant speed improvements through concurrent sub-chain processing.
Data Source
Figure 1A
Figure 1B~1E
Figure 1F
AI summary
A method for hash chain migration includes detecting a version update of an object that includes a hash chain that stores fields of the object. Sub chains are identified from the hash chain. Migration sub chains are generated from the plurality of sub chains using a plurality of processes. Container blocks are generated from the plurality of migration sub chains. A migration chain is generated from the plurality of container blocks. The object is accessed using the migration chain.