Data recovery method and system of Android system, storage medium, and electronic device

Abstract

The invention discloses a data recovery method and system of an Android system, a storage medium, and an electronic device, which relate to the technical field of Android system development. The invention sets a continuous memory space for storing discrete data pointers, and the discrete data pointers are stored in the memory space in a continuous manner. The memory space is expanded into a firstbuffer space, a second buffer space and a third buffer space which are increased in space in turn, and an initial buffer space is set in a register. Firstly, the reading and writing speed of the register is significantly faster than the memory, so that the data pointers are quickly buffered and recycled in the initial buffer space. Secondly, not all the buffered data is traversed for data collection, but only the data corresponding to the unnecessary data pointers in the initial buffer space and the first buffer space is collected, and the data collection amount is far less than that of a traditional scheme, so that the data management and collection are effectively realized, and the data collection efficiency is greatly improved.

Description

technical field [0001] The present invention relates to the technical field of Android system development, in particular to a method for recovering Android system data, a storage medium, electronic equipment and a system. Background technique [0002] In the Android development process, the execution of the program needs to be driven by data, and the data management in the traditional development process is handed over to the system for recycling and processing. If the data handed over to the system for recycling and processing is not handled properly, the recycling may not be timely or slow, which may cause the memory to remain high for a long time in some cases, and may cause memory out-of-bounds exceptions in severe cases. [0003] The recovery algorithm design of the traditional solution is relatively simple, that is, simply traverse the entire pointer container space, and then find the corresponding data according to the traversed pointer information, determine whether ...

AI Technical Summary

Problems solved by technology

This strategy will be slower, and every time you need to traverse all data caches, it will reduce recycling efficiency

[0004] At the same time, data recycling requires a regular recycling mechanism. The traditional recycling mechanism implements periodic recycling through timers. This recycling strategy only recycles data continuously when the memory usage is not very high. Reduce system performance, greatly consume system resource overhead, increase power consumption overhead, etc.

Images