Data management method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention discloses a data management method and device, electronic equipment and a storage medium. The data management method provided by the embodiment of the invention is applied to a Linux kernel module, and comprises the following steps: receiving a data operation request; obtaining a target identifier and a target operation based on the data operation request; the Linux kernel module determines a target node corresponding to the target identifier, the Linux kernel module comprises a lookup table, the lookup table records a corresponding relation between the target identifier and the target node, and the lookup table comprises a corresponding relation between data and a process; and executing the target operation on the target node. According to the data management method and device, the electronic equipment and the storage medium disclosed by the embodiment of the invention, the systematic data and the process using the systematic data can be uniformly managed through the Linux kernel module.

Description

Technical Field

[0001] The present invention relates to the field of computer technology, and in particular to a data management method, device, electronic device and storage medium. Background Art

[0002] In the Android system, a function usually needs to be implemented in multiple layers, such as the application layer (APP), framework layer, native library layer (C / C++ library), hardware abstraction layer (HAL), Linux kernel layer, etc. Therefore, some system data will be used by multiple layers, so there will be some difficulties in managing this data. For example, the management of data modification and notification is chaotic. When a process modifies the data, it needs to notify other processes that use the data. For another example, the life cycle of these data is the same as that of the system. If the application process that creates and manages the data ends, but the life cycle of the data has not ended at this time, the data may be in an unmanaged state, which may lead to problems such as data loss.

[0003] In view of this, it is necessary to provide a data management method to solve the problem of difficulty in managing system data and processes using system data in the Android system. Summary of the invention

[0004] The embodiments of the present application provide a data management method and device, an electronic device and a storage medium, which can solve the problem of difficulty in managing system data and processes using system data in an Android system.

[0005] In a first aspect, an embodiment of the present application provides a data management method applied to a Linux kernel module, characterized in that it includes: receiving a data operation request; obtaining a target identifier and a target operation based on the data operation request; determining a target node corresponding to the target identifier, wherein the Linux kernel module includes a lookup table, the lookup table records the correspondence between the target identifier and the target node, the lookup table includes the correspondence between data and processes; and executing the target operation on the target node.

[0006] In some implementations, the Linux kernel module receives the data operation request through a character device.

[0007] In some implementations, the target identifier includes a target data identifier; the target node includes a target data node; and the lookup table includes a first lookup table, the first lookup table records the correspondence between the target data identifier and the target data node, and the target data node includes data content.

[0008] In some implementations, the target data node further includes at least one process identifier associated with the target data node, and the method further includes notifying the process associated with the target data node of the target operation.

[0009] In some implementations, notifying a process associated with the target data node of the target operation includes: waking up a listening thread of the process associated with the target data node; and sending the message to the listening thread.

[0010] In some implementations, the target operation includes at least one of modification, addition, and deletion.

[0011] In some implementations, the target identifier includes a target process identifier; the target node includes a target process node; and the lookup table includes a second lookup table, the second lookup table records the correspondence between the target process identifier and the target process node, the target process node includes process information and at least one data identifier associated with the target process node.

[0012] In some implementations, the target operation includes querying data information associated with the target process.

[0013] In a second aspect, an embodiment of the present application provides a data management device, which is applied to an Android device, and the device includes: a receiving module, which is used to receive a data operation request; an acquisition module, which is used to acquire a target identifier and a target operation based on the data operation request; a determination module, which is used to determine the target node corresponding to the target identifier, wherein the Linux kernel module includes a lookup table, which records the correspondence between the target identifier and the target node, and the lookup table includes the correspondence between data and processes; and an operation module, which is used to perform the target operation on the target node.

[0014] In a third aspect, an embodiment of the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the operations in the method described in the first aspect when executing the computer program.

[0015] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, characterized in that a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the operations in the method described in the first aspect are implemented.

[0016] In summary, the embodiments of the present application disclose a data management method, device, electronic device and storage medium. The data management method provided by the embodiments of the present application is applied to the Linux kernel module, including: receiving a data operation request; based on the data operation request, obtaining a target identifier and a target operation; determining the target node corresponding to the target identifier, wherein the Linux kernel module includes a lookup table, the lookup table records the correspondence between the target identifier and the target node, and the lookup table includes the correspondence between data and processes; and performing the target operation on the target node. The data management method, device, electronic device and storage medium disclosed in the embodiments of the present application can uniformly manage systematic data and processes that use systematic data through the Linux kernel module. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the technical solutions in the embodiments of this specification, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0018] Figure 1 A schematic diagram showing a flow chart of a data management method provided by some embodiments of the present application;

[0019] Figure 2 A schematic diagram showing a flow chart of a data management method provided by some embodiments of the present application;

[0020] Figure 3 A schematic diagram showing a flow chart of a data management method provided by some embodiments of the present application;

[0021] Figure 4 A schematic diagram showing the structure of a data management device provided in some embodiments of the present application is shown;

[0022] Figure 5 An example diagram of data management provided by some embodiments of the present application is shown;

[0023] Figure 6 A schematic diagram of a first lookup table provided in some embodiments of the present application is shown;

[0024] Figure 7 A schematic diagram of a second lookup table provided in some embodiments of the present application is shown;

[0025] Figure 8 An example diagram showing message notifications provided by some embodiments of the present application; and

[0026] Fig. 9A schematic diagram of the structure of an electronic device provided in some embodiments of the present application is shown. DETAILED DESCRIPTION

[0027] The following will be combined with the drawings in this application to clearly and completely describe the technical solutions in this application. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments in the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0028] The embodiments of the present application provide a data management method and device, an electronic device and a storage medium. Specifically, the embodiments of the present application provide data management suitable for electronic devices. The electronic devices include, but are not limited to, mobile devices, network devices, medical devices, Internet of Things devices, etc. In some embodiments, the mobile device may be a personal computer, a smart phone, a tablet computer, a game console, etc. In some embodiments, the network device may be a server, a router, a switch, a firewall and other network infrastructure devices. In some embodiments, the medical device may be a monitor, an MRI scanner, a ventilator and other detection or treatment instruments. In some embodiments, the Internet of Things devices may include smart home devices, smart wearable devices, robots, smart assembly lines and other devices in various fields of home, industry, city and transportation.

[0029] The electronic device provided in the embodiment of the present application can be an electronic device based on the Android system. The Android system contains multiple system levels, for example, Linux kernel, recovery, native, HAL, framework, APP, etc. When the Android system implements some functions, there are some systematic data that are used by all levels in the system, for example, system configuration files, user settings, permission management information, etc. Since the same data may be used by multiple levels, when the data is modified, it is necessary to promptly notify other processes that need to use the data. For this reason, the process that modifies the data needs to notify other processes by itself. If each process or each level in the process needs to maintain the notification method by itself, the difficulty of notification and the probability of error are increased to a certain extent. Similarly, if a process needs to query which data it is concerned about, the difficulty of query is increased due to the decentralized management of data. In view of this, the embodiment of the present application provides a data management method that can uniformly manage systematic data and processes that use these data.

[0030] The data management method is described in detail below. It should be noted that the order of description of the following embodiments is not intended to limit the priority order of the embodiments.

[0031] Figure 1A flow chart of a data management method provided by some embodiments of the present application is shown. Although a logical order is shown in the flow chart, in some cases, the operations shown or described may be performed in an order different from that shown in the accompanying drawings. Specifically, the data management method is applied to a Linux kernel module. The specific process of the data management method is as follows:

[0032] S101: Receive a data operation request.

[0033] Among them, the data requested for operation in the data operation request may be systematic data. As mentioned above, systematic data may be data that multiple system levels will use when implementing a certain function. For example, system configuration files, user settings, permission management information, etc. A systematic data may be a single data, or may be composed of multiple data. Systematic data may be stored in the storage space of the device in the form of a file, or may be stored in the storage space in a certain data structure. This application does not limit the specific form of the data.

[0034] The data operation request may be initiated by a process in the user space of the system. The Linux kernel module may receive the data operation request through a specific interface. For example, the process that initiates the data operation request may use C or C++ code in a native code library through JNI (Java Native Interface) to implement an interface call to the Linux kernel module. For example, the process that initiates the data operation request may interact with the Linux kernel module through the hardware abstraction layer (HAL) of the device.

[0035] In some implementations, the Linux kernel module receives the data operation request through a character device. The Linux kernel module can receive the data operation request by creating a character device. A character device is a special file type, and a process can communicate with the Linux kernel module through a file system interface.

[0036] S103: Based on the data operation request, obtain a target identifier and a target operation.

[0037] The data operation request may include a target identifier (hereinafter referred to as target ID) and a target operation. For example, when making a data operation request through a system call, the target ID and the target operation may be passed as parameters to the interface of the Linux kernel module.

[0038] Wherein, the target ID can be the basis for the Linux kernel module to determine the target operation object.For example, the target ID can be a value that uniquely identifies the object of the target operation.

[0039] The target operation may be one or more of reading, modifying, adding and deleting the target operation object.

[0040] S105: Determine the target node corresponding to the target ID.

[0041] As mentioned above, the target ID can determine the identifier of the target operation object. The object of the target operation can be a target node. In other words, there is a corresponding relationship between the target ID and the target node, and the target node can be determined according to the target ID.

[0042] Wherein, the Linux kernel module may include a lookup table. The lookup table may record the correspondence between the target ID and the target node. The Linux kernel module may find the information of the corresponding target node in the lookup table according to the target ID. The information of the target node may include the storage location of the target node, the content stored in the target node, etc.

[0043] The lookup table may include a correspondence between data and processes. For example, a target node may include data and process information. The lookup table may determine a corresponding target node based on a target ID, and then obtain data and / or process information from the target node. The correspondence between data and processes includes a correspondence between data and processes that use the data. For example, a Linux kernel module may determine which processes use the data based on the data. Alternatively, a Linux kernel module may determine which data is associated with the process based on the process.

[0044] In some implementations, the lookup table may be a hash table. After obtaining a hash value according to a target ID, the Linux kernel module finds a table item corresponding to the hash value. The same hash table item may correspond to one or more nodes. One or more nodes may be associated with the same hash table item in the form of a linked list. The one or more nodes include a target node, and the target node may be determined in the one or more nodes according to the target ID.

[0045] In other implementations, the lookup table may also be a search tree or a dictionary. The present application does not limit the specific implementation of the lookup table.

[0046] S107: Execute the target operation on the target node.

[0047] As mentioned above, the target operation may be one or more of reading, modifying, adding and deleting the target node. The operation on the target node may be an operation on the entire node or an operation on part of the content in the node.

[0048] The data management method provided in the embodiment of the present application provides a unified request interface through the Linux kernel module to receive the data operation request of the process. The Linux kernel module also includes a lookup table for recording the corresponding relationship between the target ID and the target node, and the corresponding relationship between the data and the process in the target node. Wherein, the data can be systematic data. The data management method provided in the embodiment of the present application receives requests through a unified request interface and records the relationship between data and processes through a unified lookup table, which can realize unified management of systematic data and processes using systematic data.

[0049] In some embodiments, the target ID may be a target data identifier (hereinafter referred to as: target data ID), and the target node may be a target data node. The target data node may include data content, and the data content may be systematic data. The target data ID may identify the target data node. The lookup table includes a first lookup table, and the first lookup table may record the correspondence between the target data ID and the target data node. The Linux kernel module may find the information of the corresponding target data node in the first lookup table according to the target data ID.

[0050] Figure 2 A flow chart of a data management method provided by some embodiments of the present application is shown. Although a logical order is shown in the flow chart, in some cases, the operations shown or described may be performed in an order different from that shown in the accompanying drawings. Specifically, the data management method is applied to a Linux kernel module. The specific process of the data management method is as follows:

[0051] S201: Receive a data operation request.

[0052] S203: Based on the data operation request, obtain the target data ID and the target operation.

[0053] As described above, the Linux kernel module can receive a data operation request and determine the target data ID and the target operation included in the data operation request. For the target data node corresponding to the target data ID, the target operation may include at least one of a data modification request, a data addition request, a data deletion request, and a data read request.

[0054] S205: Determine the target data node corresponding to the target data ID.

[0055] The first lookup table may record the correspondence between the target data ID and the target data node. The Linux kernel module may find the corresponding target data node in the first lookup table according to the target data ID.

[0056] S207: Execute the target operation on the target data node.

[0057] For example, the target operation may be to modify the data of the target data node corresponding to the target data ID. The request for data modification may also include the modified target content. The Linux kernel module may find the target data node corresponding to the target data ID in the first lookup table based on the target data ID. Then, the data content contained in the target data node is modified to the target content. For example, the target operation may be to add a target data node with an ID of the target data ID. The request for data addition may also include the target content that is desired to be added. The Linux kernel module may find the position of the target node in the first lookup table based on the target data ID, and write the target content of the target data node at this position. For another example, the target operation may be to delete a target data node with an ID of the target data ID. The Linux kernel module may find the target node in the first lookup table based on the target data ID, and delete the target data node.

[0058] In some embodiments, after the target data node is modified, the process associated with the target data node data can be notified in a timely manner. The target data node can also include at least one process identifier (hereinafter referred to as process ID) associated with the target data node. The at least one process associated with the target data node can be a process using the target data node data.

[0059] The data management method in this embodiment may further include:

[0060] S209: Notify the process associated with the target data node of the target operation.

[0061] Since the target data node in the first lookup table may include data content and a process ID associated with the data, the Linux kernel module may send a notification of the target operation to these associated processes according to the process ID. For example, when certain data is modified, the Linux kernel module may notify the associated process of the modified data identifier (hereinafter referred to as data ID) and the specific content of the modification.

[0062] Specifically, operation S209 may include: waking up a listening thread of a process associated with the target data node; and sending a message to the listening thread.

[0063] If a process needs to listen to whether the data it is concerned about has changed, it can start a listening thread and wait for messages in the Linux kernel module. When the data has changed, the Linux kernel module can use the target operation and the result of the operation as a message to wake up the listening thread of the process associated with the target data node and send the message to the listening thread. In this way, the process can be notified of the data change.

[0064] In some implementations, the notification message may be sent through a FIFO (First-In, First-Out) of the listening process. The Linux kernel module pushes the message into the FIFO, and the listening process reads the message from the FIFO.

[0065] In summary, the data management method provided in some embodiments of the present application can perform target operations on target data nodes according to target data IDs, and can uniformly manage systematic data and processes associated with these data. Since data management is performed by the Linux kernel, data management can be achieved throughout the data life cycle. The Linux kernel module keeps the data management cycle consistent with the system life cycle.

[0066] In some embodiments, the target ID may be a target process identifier (hereinafter referred to as the target process ID). For example, the system may assign a unique identifier to the process as the process ID when the process is started. The target node may be a target process node. The lookup table includes a second lookup table, and the second lookup table may record the correspondence between the target process ID and the target process node. The Linux kernel module may find the information of the corresponding target process node in the second lookup table according to the target process ID. The target process node may include process information and at least one data ID associated with the target process node.

[0067] Figure 3 A flow chart of a data management method provided by some embodiments of the present application is shown. Although a logical order is shown in the flow chart, in some cases, the operations shown or described may be performed in an order different from that shown in the accompanying drawings. Specifically, the data management method is applied to a Linux kernel module. The specific process of the data management method is as follows:

[0068] S301: Receive a data operation request.

[0069] S303: Based on the data operation request, obtain the target process ID and the target operation.

[0070] As mentioned above, the Linux kernel module can receive a data operation request and determine a target process ID and a target operation included in the data operation request. For a target process node corresponding to the target process ID, the target operation includes querying data information associated with the target process.

[0071] S305: Determine the target process node corresponding to the target process ID.

[0072] The second lookup table may record the correspondence between the target process ID and the target process node. The Linux kernel module may find the corresponding target process node in the second lookup table according to the target process ID.

[0073] S307: Execute the target operation on the target process node.

[0074] For example, the target operation may be to perform a data query on the target process node corresponding to the target process ID. The Linux kernel module may query the target process node corresponding to the target process ID in the second lookup table based on the target process ID. The target process node may include process information and a data ID associated with the process. The Linux kernel module may return the queried data ID to the process that sent the data operation request.

[0075] In summary, the data management method provided in some embodiments of the present application can perform target operations on target process nodes according to target process IDs, and can uniformly manage processes that use systematic data and data associated with these processes.

[0076] Figure 4 The following is a schematic diagram of the structure of a data management device provided in some embodiments of the present application. The data management device can be applied to an Android device, and specifically can be as follows:

[0077] The receiving module 401 is used to receive a data operation request.

[0078] The acquisition module 403 is used to acquire the target ID and the target operation based on the data operation request.

[0079] The determination module 405 is used to determine the target node corresponding to the target ID, wherein the Linux kernel module includes a lookup table, the lookup table records the correspondence between the target ID and the target node, and the lookup table includes the correspondence between data and processes.

[0080] The operation module 407 is used to perform a target operation on the target node.

[0081] In some embodiments, the acquisition module 403 may include a first acquisition unit for acquiring a target data ID and a target operation. The determination module 405 may include a first determination unit for determining a target data node corresponding to the target data ID. The lookup table includes a first lookup table, which records the correspondence between the target data ID and the target data node, and the target data node includes data content.

[0082] In some embodiments, the data management device 400 may further include a notification module. The notification module is used to notify the process associated with the target data node of the target operation.

[0083] In some embodiments, the acquisition module 403 may include a second acquisition unit for acquiring a target process ID and a target operation. The determination module 405 may include a second determination unit for determining a target process node corresponding to the target process ID. The lookup table includes a second lookup table, which records the correspondence between the target process ID and the target process node, and the target process node includes process information and at least one data ID associated with the target process node.

[0084] In some embodiments of the present application, the receiving module 401 may first receive a data management request, and then the obtaining module 403 may obtain a target ID and a target operation based on the data operation request, and then the determining module 405 may determine a target node corresponding to the target ID, and finally the operating module 407 may perform a target operation on the target node. Among them, the target ID and the target node The data management device 400 provided in some embodiments of the present application can uniformly manage system data and processes using system data through a Linux kernel module.

[0085] Figure 5 An example diagram of data management provided by some embodiments of the present application is shown. Figure 5 As shown in the figure, each layer in the system can use the Linux kernel module to manage data. For example, the Framework, APP, jni, native, hal, recovery and other layers can initiate data operation requests through the character device of the Linux kernel module. For example, the data operation request can be a data modification request, a data addition request, a data deletion request, a data read request, etc.

[0086] Taking data modification as an example, the Linux kernel module can use the msg thread to receive and execute data modification requests. Figure 5 The ID hash table in is the first lookup table, and the PID hash table is the second lookup table. Figure 6 A schematic diagram of a first lookup table provided in some embodiments of the present application is shown. Figure 7 A schematic diagram of a second lookup table provided in some embodiments of the present application is shown.

[0087] The msg thread determines the target data ID based on the received data modification request, and then calculates the hash value based on the target data ID. Figure 6 Find the corresponding hash table entry in the ID hash table shown. Figure 6In the example, 64 hash table items are used, and each hlist_head corresponds to a hash table item. Each hash table item can point to a linked list, and the node ID NODE in the linked list is a data node. The data node contains the data content and the process node information associated with the data node. After the msg thread finds the target data node corresponding to the target data ID in the ID hash table, it can perform modification operations on the target data node. Similarly, the Linux kernel module can also execute other data operation requests through the msg thread, such as data addition requests and data deletion requests.

[0088] Taking data reading as an example, continue to refer to Figure 5 , the Linux kernel module can receive data read requests through character devices and obtain the target process ID according to the data read request. Then, the hash value is calculated according to the target process ID. Figure 7 The corresponding hash table entry is found in the PID hash table shown, and then the corresponding target process node is found in the linked list of process nodes. Each process node contains process information and data node information that the process is concerned about. The Linux kernel module can return the data ID that the process is concerned about, or further obtain the information of the target data node based on the data ID.

[0089] Figure 8 An example diagram of message notification provided by some embodiments of the present application is shown. After modifying the data, the msg thread determines whether the modification has been completed, that is, whether the data of the target data node has changed. When it is determined that the modification is completed, the information of the data modification is sent to the FIFO of the process bound to the modified data. The process bound to the system data can use the poll process to listen to the data.

[0090] In addition, the present application also provides an electronic device, Fig. 9 The following is a schematic diagram of the structure of an electronic device provided by some embodiments of the present application, specifically:

[0091] The electronic device 500 may include one or more processors 501 of processing cores, one or more computer-readable storage media memories 502 and other components. Those skilled in the art will appreciate that Fig. 9 The structure of the electronic device 500 shown in the figure does not constitute a limitation on the electronic device, and may include more or fewer components than shown in the figure, or combine certain components, or arrange the components differently.

[0092] The processor 501 is the control center of the electronic device 500. It uses various interfaces and lines to connect various parts of the entire electronic device 500. By running or executing software programs and / or modules stored in the memory 502, and calling data stored in the memory 502, it executes various functions of the electronic device 500 and processes data, thereby monitoring the electronic device 500 as a whole. Optionally, the processor 501 may include one or more processing cores; preferably, the processor 501 may integrate an application processor and a modem processor, wherein the application processor mainly processes the operating system, user interface, and application programs, etc., and the modem processor mainly processes wireless communications. It is understandable that the above-mentioned modem processor may not be integrated into the processor 501.

[0093] The memory 502 can be used to store software programs and modules. The processor 501 executes various functional applications and data processing by running the software programs and modules stored in the memory 502. The memory 502 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function, etc.; the data storage area may store data created according to the use of the electronic device 500, etc. In addition, the memory 502 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. Accordingly, the memory 502 may also include a memory controller to provide the processor 501 with access to the memory 502.

[0094] Specifically in this embodiment, the processor 501 in the electronic device 500 will load the executable files corresponding to the processes of one or more applications into the memory 502 according to the following instructions, and the processor 501 will run the applications stored in the memory 502, thereby implementing the operations in any data management method provided in the embodiments of the present application.

[0095] The specific process of the electronic device 500 executing the data management method can be referred to Figure 1 , Figure 2 , Figure 3 The description in , this application will not be repeated here.

[0096] Those skilled in the art will appreciate that all or part of the operations in the various methods of the above embodiments may be accomplished through instructions, or through instruction-controlled related hardware. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0097] To this end, the present application provides a computer-readable storage medium, on which a computer program is stored. The computer program can be loaded by a processor to execute the operations in any data management method provided in the present application.

[0098] The specific implementation of the above operations can be found in the previous embodiments, which will not be described in detail here.

[0099] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0100] Since the instructions stored in the computer-readable storage medium can execute the operations in any data management method provided in the present application, the beneficial effects that can be achieved by any data management method provided in the present application can be achieved. Please refer to the previous embodiments for details and will not be repeated here.

[0101] The data management method and device, electronic device and storage medium provided by the present application are introduced in detail above. Specific examples are used in this article to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core idea. At the same time, for technical personnel in this field, according to the idea of ​​the present invention, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present invention.

Claims

1. A data management method, applied to a Linux kernel module, characterized in that: include: receiving data operation requests; Based on the data operation request, obtaining a target identifier and a target operation; Determine a target node corresponding to the target identifier, wherein the Linux kernel module includes a lookup table, the lookup table records a correspondence between the target identifier and the target node, and the lookup table includes a correspondence between data and processes; as well as The target operation is performed on the target node.

2. The method according to claim 1, characterized in that The Linux kernel module receives the data operation request through a character device.

3. The method according to claim 1, characterized in that The target identifier includes a target data identifier; The target node includes a target data node; and The lookup table includes a first lookup table, which records the corresponding relationship between the target data identifier and the target data node, and the target data node includes data content.

4. The method according to claim 3, characterized in that in, The target data node also includes at least one process identifier associated with the target data node; The method further comprises: A process associated with the target data node is notified of the target operation.

5. The method according to claim 4, characterized in that The process of notifying the target operation associated with the target data node includes: Waking up a listening thread of a process associated with the target data node; and The message is sent to the listening thread.

6. The method according to claim 3, characterized in that The target operation includes at least one of modification, addition, and deletion.

7. The method according to claim 1, characterized in that The target identifier includes a target process identifier; The target node includes a target process node; and The lookup table includes a second lookup table, which records the corresponding relationship between the target process identifier and the target process node, and the target process node includes process information and at least one data identifier associated with the target process node.

8. A data management device, characterized in that: Applied to an Android device, the device comprises: A receiving module, used for receiving a data operation request; An acquisition module, used for acquiring a target identifier and a target operation based on the data operation request; a determination module, configured to determine a target node corresponding to the target identifier, wherein the Linux kernel module includes a lookup table, the lookup table records a correspondence between the target identifier and the target node, and the lookup table includes a correspondence between data and processes; and An operation module is used to perform the target operation on the target node.

9. An electronic device, characterized in that: The method comprises a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the operations in the method according to any one of claims 1 to 7 when executing the computer program.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the operations in the method according to any one of claims 1 to 7 are implemented.

Images