Efficient data unit reuse method and system

1. 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.

2. The method of claim 1 , wherein:

the predetermined order comprises an increasing order or a decreasing order; and

block IDs of continuous data blocks comprise continuous block IDs or discontinuous block IDs.

3. The method of claim 1 , wherein:

reuse of a data unit comprises reuse of multiple data units, and the current data unit comprises a latest data unit in the multiple data units.

4. The method of claim 3 , wherein 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 further comprises:

acquiring a block ID of a last block written into a data unit immediately previous to the current data unit as an initial ID; and

based on the initial ID, successively reading each data block in the current data unit to search for the first specific data block whose block ID does not conform to the predetermined order.

5. The method of claim 1 , wherein the data block further comprises check data, and successively reading each data block in a current data unit further comprises: checking each data block based on the check data so as to determine whether the data block is a valid data block, and when the data block is an invalid data block, determining the data block as the first specific data block whose block ID does not conform to the predetermined order.

6. The method of claim 1 , wherein the data unit is at least one of a file, a log, or a database.

7. The method of claim 1 , wherein the data block is a fixed-length data block or a variable-length data block.

8. 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.

9. The apparatus of claim 8 , wherein:

the predetermined order comprises an increasing order or a decreasing order; and

block IDs of continuous data blocks comprise continuous block IDs or discontinuous block IDs.

10. The apparatus of claim 8 , wherein:

reuse of a data unit comprises reuse of multiple data units, and the current data unit comprises a latest data unit in the multiple data units.

11. The apparatus of claim 10 , wherein the processor being 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 comprises the processor being configured to:

acquire a block ID of a last block written into a data unit immediately previous to the current data unit as an initial ID; and

based on the initial ID, successively read each data block in the current data unit to search for the first specific data block whose block ID does not conform to the predetermined order.

12. The apparatus of claim 8 , wherein the data block also comprises check data, and the processor being configured to successively read each data block in a current data unit further comprises the processor being configured to: check each data block based on the check data so as to determine whether the data block is a valid data block, and when the data block is an invalid data block, determine the data block as the first specific data block whose block ID does not conform to the predetermined order.

13. The apparatus of claim 8 , wherein the data unit is at least one of a file, a log, or a database.

14. The apparatus of claim 8 , wherein the data block is a fixed-length data block or a variable-length data block.

15. 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.

16. The non-transitory computer-readable storage medium of claim 15 , wherein:

the predetermined order comprises an increasing order or a decreasing order; and

block IDs of continuous data blocks comprise continuous block IDs or discontinuous block IDs.

17. The non-transitory computer-readable storage medium of claim 15 , wherein:

reuse of a data unit comprises reuse of multiple data units, and the current data unit comprises a latest data unit in the multiple data units.

18. The non-transitory computer-readable storage medium of claim 17 , wherein 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 further comprises:

acquiring a block ID of a last block written into a data unit immediately previous to the current data unit as an initial ID; and

based on the initial ID, successively reading each data block in the current data unit to search for the first specific data block whose block ID does not conform to the predetermined order.

19. The non-transitory computer-readable storage medium of claim 15 , wherein the data block further comprises check data, and successively reading each data block in a current data unit further comprises: checking each data block based on the check data so as to determine whether the data block is a valid data block, and when the data block is an invalid data block, determining the data block as the first specific data block whose block ID does not conform to the predetermined order.

20. The non-transitory computer-readable storage medium of claim 15 , wherein the data unit is at least one of a file, a log, or a database.