Efficient data unit reuse method and system
AssigneeAdvanced New Technologies Co., Ltd.
InventorsHao Liu, Mingqiang Zhuang, Zhenkun Yang
Life of this patent
Estimating the term…
Abstract
The present disclosure relates to a data unit reuse method, where data is stored in a data unit in the form of a data block and the data block has a block ID. The method includes: successively reading each data block in a current data unit to search for a first specific data block whose block ID does not conform to a predetermined order; determining whether at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit; when it exists, determining that the current data unit has been damaged, and when it does not exist, determining that a data block immediately previous to the specific data block is a data end.
Claims20
A data unit reuse method, wherein data is stored in a data unit in a form of a data block and the data block has a block ID, and the method comprises:
- successively reading each data block in a current data unit to search for a first specific data block whose block ID does not conform to a predetermined order;
- determining whether at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit;
- when at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determining that the current data unit has been damaged, and
- when no data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determining that a data block immediately previous to the specific data block is a data end.
A data unit reuse apparatus, wherein data is stored in a data unit in a form of a data block and the data block has a block ID, and the apparatus comprises:
- a memory;
- and
- a processor, coupled to the memory and configured to:
- successively read each data block in a current data unit to search for a first specific data block whose block ID does not conform to a predetermined order;
- determine whether at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit;
- when at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determine that the current data unit has been damaged, and
- when no data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determine that a data block immediately previous to the specific data block is a data end.
A non-transitory computer-readable storage medium having stored therein instructions that, when executed by a processor of a device, cause the device to perform a data unit reuse method, wherein data is stored in a data unit in a form of a data block and the data block has a block ID, and the method comprises:
- successively reading each data block in a current data unit to search for a first specific data block whose block ID does not conform to a predetermined order;
- determining whether at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit;
- when at least one data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determining that the current data unit has been damaged, and
- when no data block whose block ID conforms to the predetermined order exists after the specific data block in the current data unit, determining that a data block immediately previous to the specific data block is a data end.
Dependencies are inferred from the claim text.