Hash Code Calculation Using Markers for Partial Data Blocks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data block hash code calculation systems are inefficient when dealing with partially occupied data blocks, as they spend time processing unoccupied portions, leading to slowed performance.
Innovation Solution
A method and system that calculate hash codes by inserting a marker into unoccupied portions of data blocks during write operations and terminating the hash code calculation upon finding the marker during read operations, reducing unnecessary processing on unoccupied areas.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hash code calculation processes the entire data block including unoccupied portions, then data integrity checking is comprehensive, but processing time increases and performance decreases
Solution Approach 1:
The patent extracts only the occupied portion of the data block for hash code calculation by using markers to delimit valid data boundaries. This eliminates unnecessary processing of unoccupied portions while maintaining integrity checking for actual data, thus resolving the contradiction between comprehensive checking and processing efficiency.
Solution Approach 2:
Instead of performing full block processing, the patent applies partial action by calculating hash codes only over the occupied portion of data blocks. The markers enable the system to perform exactly the necessary amount of processing without excess, improving productivity while maintaining sufficient reliability for data integrity.
2Ease of manufacture
If hash code calculation processes all data blocks uniformly, then simplicity of implementation is maintained, but efficiency on partially occupied blocks deteriorates
Solution Approach 1:
The patent applies preliminary action by inserting markers during the write operation to mark the boundaries of occupied portions. This preparation enables efficient partial processing during read operations without complicating the overall implementation, as the marker placement follows straightforward rules and integrates naturally with existing write procedures.
Data Source
AI summary
A method for performing hash code calculations may calculate, during a write operation for a data block, a hash code for an occupied portion of the data block, insert, during the write operation, a marker into the data block, calculate, during a read operation for the data block, a hash code for the occupied portion of the data block, search, during the read operation, for the marker in the data block, and terminate the hash code calculation in response to finding the marker.