| CPC G06F 21/64 (2013.01) [G06F 12/023 (2013.01); G06F 2212/1052 (2013.01)] | 20 Claims |

|
1. A data processing method, comprising:
obtaining a first child node in a compressed state from a memory in response to a read request for target data when the first child node is not detected in a processor, wherein the first child node is a child node that is in an integrity tree and that is related to the target data, wherein the integrity tree comprises a plurality of root nodes and a plurality of child nodes, wherein the plurality of child nodes are stored in the compressed state in the memory, and the plurality of root nodes are stored in a decompressed state in the processor; and
decompressing the first child node in the compressed state, and caching the decompressed first child node into the processor, wherein the first child node is used for integrity verification on the target data;
obtaining a to-be-removed second child node in the processor when it is detected that a quantity of child nodes in the processor reaches a preset value, wherein the to-be-removed second child node in the processor corresponds to a second child node in the memory; and
compressing the to-be-removed second child node when it is detected that the to-be-removed second child node is changed, and replacing the second child node in the memory with the compressed to-be-removed second child node.
|