A method and system for enterprise data processing

Abstract

The application provides an enterprise data processing method and system, the method comprising: configuring octree storage nodes in a specified storage space, the octree storage nodes comprising main storage nodes and sub storage nodes; establishing hierarchical enterprise directory data, and splitting according to an octree splitting method according to the hierarchical enterprise directory data; configuring an identification of each octree storage node, establishing a mapping relationship between split directory data and node identification, and obtaining to-be-stored data under each directory data; querying an octree split storage node storage location according to the split directory data and node identification of the self, and storing the to-be-stored data into a storage space of the corresponding node.

Description

Technical Field

[0001] This invention relates to the field of enterprise data management technology, and in particular to an enterprise data processing method and system. Background Technology

[0002] Currently, as enterprise data volume gradually increases, storage space also gradually expands. Existing enterprise data processing methods still rely on configuring a large number of cloud storage services to achieve incremental data storage. However, existing incremental data storage is relatively scattered, resulting in low storage space utilization. Furthermore, the data processing efficiency of existing technologies is not ideal, leading to high costs for data storage for enterprises and hindering the development of data-driven enterprises. Summary of the Invention

[0003] One of the objectives of this invention is to provide an enterprise data processing method and system. The method and system utilize the octree algorithm to configure octree nodes in the storage nodes, and simultaneously acquire the enterprise's directory data, divide the directory data into hierarchical octree structure data, and store the corresponding enterprise directory data into the corresponding octree nodes according to the octree partitioning principle, thereby improving the efficiency of enterprise data processing.

[0004] Another objective of this invention is to provide an enterprise data processing method and system. The method and system store directory data into the corresponding octree nodes according to the octree partitioning principle, determine whether the node is filled, and if it is not filled, it can be further partitioned into child nodes of different storage space sizes according to the hierarchical directory structure, and the data filling status of the child nodes is determined as a partitioning condition until the node is a filled node or an empty node that does not need to be filled.

[0005] Another objective of this invention is to provide an enterprise data processing method and system. When an octree node is segmented, the method and system mark each octree node and establish a mapping relationship between the marked octree nodes and the corresponding hierarchical directory information. When there is data to be inserted, the method obtains the directory position of the data to be inserted in the enterprise data. At this time, the data is inserted into the corresponding child node according to the mapping relationship between the directory information and the octree node markings, thereby achieving efficient processing of enterprise data.

[0006] To achieve at least one of the above-mentioned objectives, the present invention further provides an enterprise data processing method, the method comprising:

[0007] Configure octree storage nodes in a specified storage space, wherein the octree storage nodes include primary storage nodes and child storage nodes;

[0008] Establish a hierarchical enterprise directory data, and then segment the hierarchical enterprise directory data using an octree partitioning method;

[0009] Configure the identifier for each octree storage node, establish a mapping relationship between the partitioned directory data and the node identifier, and obtain the data to be stored under each directory.

[0010] The storage location of the octree partitioned storage node is obtained by querying its own partitioned directory data and node identifier, and the data to be stored is stored in the storage space of the corresponding node.

[0011] According to a preferred embodiment of the present invention, the octree storage structure construction method includes: obtaining specified storage space location information in the storage space of the memory; establishing a first sub-storage node of the octree according to the specified storage space location information; marking the first sub-storage node of the octree and returning the marking information of different nodes and the pointers of the segmented storage; the marking information and pointers of the nodes of the octree are used for the storage of directory data after being returned.

[0012] According to another preferred embodiment of the present invention, the storage method of the directory data includes: after obtaining the current directory data, dividing the directory data into 8 subdirectory data according to the octree partitioning rules, and configuring an octree first partition sub-storage node marker and a corresponding storage pointer for each subdirectory data, wherein the directory data has corresponding data to be stored, and storing the data to be stored in the specified octree first partition sub-storage node according to the octree first partition sub-storage node marker and storage pointer configured for the target data where the data to be stored is located.

[0013] According to another preferred embodiment of the present invention, the octree storage node storage method includes: after storing the data to be stored into the first sub-storage node of the octree, determining whether the current storage node is full; if it is full, checking whether the next first sub-storage node of the octree is full; if it is not full, storing the current data to be stored into the next first sub-storage node of the octree, and returning the marker and pointer of the next first sub-storage node of the octree, and automatically updating the mapping table of the node markers and pointers of the corresponding directory data.

[0014] According to another preferred embodiment of the present invention, the storage method of the octree storage node includes: after the data to be stored is stored in the corresponding first octree partition storage node, if the current first partition sub-storage node is not full, the current node is further partitioned into 8 second octree partition sub-storage nodes, and each second octree partition node is marked, and an empty node not stored in the current second partition sub-storage node is searched; the subdirectory data in the enterprise directory data is further divided into 8 sub-subdirectory data, and the data to be stored in the corresponding subdirectory data is searched according to the marking of the first partition sub-storage node where the second partition sub-storage node is located. If it exists, the data to be stored in the corresponding sub-subdirectory data is stored in the corresponding second partition sub-storage node, and the marking information and storage pointer of the second partition sub-storage node are returned, and the marking and storage pointer of the storage node mapped to the corresponding sub-subdirectory data are updated.

[0015] According to another preferred embodiment of the present invention, the method includes a storage query method for octree storage nodes: sequentially scanning each layer of partitioned storage nodes from the root node and determining the storage status of each layer of nodes. If the current storage status is empty or not full, all upper-layer partitioned storage nodes of that layer are marked as not full nodes until all lower-layer partitioned storage nodes are full, and the corresponding root node is marked as a full node.

[0016] According to another preferred embodiment of the present invention, a maintenance form for the octree's different levels of partitioned storage nodes is constructed. The maintenance form stores enterprise directory data of the corresponding level, as well as partitioned sub-storage node markers and corresponding pointers for the corresponding directory data. When corresponding data to be stored is inserted into the directory data of the corresponding level in the maintenance form, the partitioned sub-storage node markers and pointers for the corresponding level of directory data are automatically obtained, and the currently inserted data to be stored is stored in the storage location pointed to by the corresponding pointer.

[0017] According to another preferred embodiment of the present invention, the storage method of the octree storage node includes: obtaining the storage status of the current root node; if the current root node storage status is full, constructing a second octree storage node in the current or new storage space, and simultaneously obtaining the storage tag and storage level in the pre-established maintenance form corresponding to different levels of enterprise directory data, reconstructing the corresponding level of the sub-storage node in the second octree storage node, and reassigning the same or different tag as the full octree storage node, and uploading the second octree storage node tag and corresponding storage pointer to the maintenance form corresponding to the corresponding enterprise directory data.

[0018] To achieve at least one of the above-mentioned objectives, the present invention further provides an enterprise data processing system that executes the above-described enterprise data processing method.

[0019] The present invention further provides a computer-readable storage medium storing a computer program, which is executed by a processor to implement the above-described enterprise data processing method. Attached Figure Description

[0020] Figure 1 The diagram shown is a flowchart of an enterprise data processing method according to the present invention.

[0021] Figure 2 The diagram shown is a schematic diagram of storage node segmentation in an enterprise data processing method according to the present invention.

[0022] Figure 3 This diagram shows a maintenance form for an enterprise data processing method according to the present invention. Detailed Implementation

[0023] The following description is intended to disclose the present invention and enable those skilled in the art to implement it. The preferred embodiments described below are merely examples, and other obvious variations will occur to those skilled in the art. The basic principles of the invention defined in the following description can be applied to other embodiments, modifications, improvements, equivalents, and other technical solutions that do not depart from the spirit and scope of the invention.

[0024] It is understood that the term "a" should be understood as "at least one" or "one or more", that is, in one embodiment, the number of an element can be one, while in another embodiment, the number of the element can be multiple, and the term "a" should not be understood as a limitation on the number.

[0025] Combination Figures 1-3This invention discloses an enterprise data processing method and system. The method mainly includes: firstly, determining a storage space, which can be a total storage space or a part of a total storage space. The storage space can come from a solid-state drive, memory, or cloud storage. After determining the storage space, an octree storage structure is further constructed within the storage space. The octree storage structure includes a master storage node and child storage nodes. The master storage node is also called the root node. Child storage nodes are set below the master storage node. Since the storage logic of the octree is to divide downward within the same storage space, that is, the same master storage space can be divided into different child storage spaces, in the octree storage structure, the master storage node is divided into 8 initial child storage nodes. The 8 initially divided child storage nodes are defined as the first partition child storage nodes of the octree. Since the depth of the child storage nodes of the octree can be set, this invention preferably configures the octree depth to 2, that is, based on the first partition child storage nodes, a second partition child storage node corresponding to the first partition child storage node can be configured again. In some other preferred embodiments of this invention, deeper octree storage nodes can be configured. After the initial partitioning of the octree storage nodes to obtain the first sub-storage nodes, each first sub-storage node is marked, and the pointer of the corresponding first sub-storage node is returned to the system control center. The system control center further constructs a directory of the enterprise's data to be stored. This directory can be an index directory of different data to be stored within the current enterprise, with corresponding data to be stored under each index directory. This data can be initially stored in a cache and then further stored in a designated storage space. This invention utilizes the octree-partitioned storage nodes to store data from the hierarchical directory, thereby achieving efficient and high-utilization storage of enterprise data and reducing the enterprise's data processing costs.

[0026] Specifically, such as Figure 2 The diagram shown illustrates the partitioning of the primary storage node. In this invention, the corresponding storage space is used as the primary storage node, and the primary storage node is divided into the aforementioned eight first partitioned sub-storage nodes. These eight first partitioned sub-storage nodes constitute the complete primary storage node. F0(x0) is defined as the unpartitioned primary node storage space, where x0 is the current node marker. Further definitions are provided. Let n be the storage space for the first sub-node after partitioning, where n is the number of nodes. The corresponding node is labeled. The value of n for the first sub-segment storage node is an integer ranging from 1 to 8. Further obtain the storage pointer P1 of the current first sub-storage node. n and the above node tags and the corresponding storage pointer P1 n As feedback information The system returns the feedback information to the system. The system described in this invention stores the above-mentioned feedback information. Save later. In one preferred embodiment of the present invention, the second segmented sub-storage node can be obtained by segmenting on the first segmented sub-storage node. Since the second sub-storage node is a finer partition based on the first sub-storage node, therefore The value of n in the range is any integer in [1-64], indicating that it can be divided into 64 second sub-storage nodes.

[0027] Furthermore, this invention designs a directory data structure for enterprise data at the enterprise level. This directory data can be set according to the enterprise's own data storage rules. For example, the enterprise directory data can be designed separately for each department, with each department forming a first-level directory. The directory name can be selected based on the current department's data planning. For instance, the first-level directory for the human resources department can include, but is not limited to, basic employee information. Further second-level directory data can be set under the aforementioned first-level directory, or data to be stored can be set under the corresponding first-level directory. For example, taking the human resources department as an example, if the first-level directory of the human resources department is basic employee information, then under this basic employee information are the corresponding employee's education, work experience, age, position, and rank, etc. This basic information is stored as data to be stored in the corresponding storage node. When the first-level directory of the human resources department is basic employee information, and the work experience under the corresponding first-level directory can be set as a second-level directory, for example, the second-level directory of work experience can be set according to a time directory to obtain second-level directory data based on work experience. In this case, the second-level directory can be stored in the corresponding storage node.

[0028] After completing the construction of the aforementioned enterprise directory data, the directory data serves as a data index. Furthermore, this invention divides the first-level directory data into eight parts. The division method can include, but is not limited to, dividing based on relatively equal data volume, directory type, or department, resulting in eight sub-directories. Where n is the number of subdirectories to be split, and the value of n ranges from [1-8]. Furthermore, the subdirectories split from the first-level directory data may contain second-level subdirectories; these second-level subdirectories are then further split into 8 sub-subdirectories. Where n is the number of subdirectories split into, and n is an integer ranging from 1 to 64. In this invention, the above directory data is preferably set to level 2. Those skilled in the art will understand that, based on the technical concept of this invention, more levels of directory data can be set, which will not be elaborated upon in this invention.

[0029] Furthermore, when the system traverses the storage nodes of the octree, it first traverses the current octree storage nodes from the root node, and determines that the root node of the current octree storage node is a not-full storage node, and then further traverses the aforementioned first sub-storage nodes. The storage status of each storage node, if the current first partition storage node Define a full storage node This indicates that the current storage node is in a full storage state. At this point, we can further traverse the next first-segment storage node. Continue until the first partitioned storage node corresponding to a non-full or empty storage state is found. Obtain the tag information and pointer of the currently non-full or empty first partitioned sub-storage node. Return to the system for storing the corresponding enterprise directory data.

[0030] It is worth mentioning that, in one preferred embodiment of the present invention, in order to standardize storage and improve storage space utilization, the present invention can, after the first sub-segment storage node of the octree storage node is constructed, obtain the returned tag information and pointer of the first sub-segment storage node from the enterprise side. The tagging information and corresponding storage pointer of the first segmented sub-storage node are assigned to the pre-segmented enterprise subdirectory data, and the tagging information of the first segmented sub-storage node is... A mapping relationship is established between the data in the corresponding segmented enterprise subdirectories. At this point, each segmented enterprise subdirectory data will receive the tag information and pointer of one of the first segmented sub-storage nodes. Define enterprise subdirectory data as This indicates the mapping relationship. If the data to be stored in the current enterprise's segmented subdirectory is obtained, it is stored in the corresponding first segmented sub-storage node; and a mapping relationship is further established between the enterprise's segmented secondary subdirectory data and the second segmented sub-storage node. The aforementioned mapping relationship defines the storage method for data to be stored under the enterprise directory data. Standardized storage also improves the enterprise's ability to search for stored data. If new data to be stored is added under the enterprise's corresponding directory data, the corresponding segmented sub-storage node's tag information and pointer are found based on the subdirectory data or secondary subdirectory data where the new data is located, and according to the mapping relationship of the corresponding subdirectory data or secondary subdirectory data. The data is then stored in a targeted manner based on the found tag information and pointer.

[0031] Of course, in another preferred embodiment of the present invention, in order to improve storage efficiency and storage space utilization, the present invention can establish a non-one-to-one mapping relationship between octree storage nodes and corresponding directory levels. In this embodiment, only the current state of the octree storage node is determined to obtain the current storage node identifier and pointer, and the node identifier and pointer information of the storage node whose state is empty or not full are returned to the system. The system automatically configures the node identifier and pointer to the data to be stored in the enterprise directory data, and after obtaining the corresponding storage node identifier and pointer of the data to be stored in the enterprise, the data to be stored is stored in the corresponding empty or not full octree storage node, and at the same time updates the storage node identifier and pointer information corresponding to the directory data in the above mapping table, thereby randomly storing different directory data and improving storage efficiency and storage utilization.

[0032] For further details, please refer to... Figure 3 The present invention provides a maintenance form, which is filled with storage node markers and corresponding enterprise directory data. The maintenance form can store enterprise directory data of corresponding levels, as well as segmented sub-storage node markers and corresponding pointers for the corresponding directory data. When corresponding data to be stored is inserted into the corresponding level directory data of the maintenance form, the segmented sub-storage node markers and pointers of the corresponding level directory data are automatically obtained, and the currently inserted data to be stored is stored in the storage location pointed to by the corresponding pointer.

[0033] In another preferred embodiment of the present invention, if the current octree is scanned and the master node is determined to be full, it is determined that the entire octree storage space is full. A second octree storage node is then constructed in the current or new storage space. Simultaneously, the storage markers and storage levels in the pre-established maintenance forms corresponding to different levels of enterprise directory data are obtained. The corresponding level of sub-storage nodes is then reconstructed in the second octree storage node, and a new marker (either the same or different) is assigned to each full octree storage node. The second octree storage node marker and its corresponding storage pointer are uploaded to the maintenance form corresponding to the enterprise directory data. Since the second octree storage node can be configured with the same storage structure as the full octree, at least one storage pointer can exist in the maintenance form to store the corresponding level of directory data in at least one specified storage location.

[0034] The processes described above with reference to the flowcharts in the embodiments disclosed in this invention can be implemented as computer software programs. The embodiments disclosed in this invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication component, and / or installed from a removable medium. When the computer program is executed by a central processing unit (CPU), it performs the functions defined in the methods of this application. It should be noted that the computer-readable medium described above in this application can be a computer-readable signal medium or a computer-readable storage medium, or any combination of the two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wire segments, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this application, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in connection with an instruction execution system, apparatus, or device. In this application, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals can take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless segments, wire segments, optical fibers, RF, etc., or any suitable combination thereof.

[0035] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0036] Those skilled in the art should understand that the embodiments of the present invention described above and shown in the accompanying drawings are merely examples and do not limit the present invention. The purpose of the present invention has been fully and effectively achieved. The functions and structural principles of the present invention have been shown and explained in the embodiments. Without departing from the stated principles, the implementation of the present invention may have any variations or modifications.

Claims

1. A method for processing enterprise data, characterized in that, The method includes: Configure octree storage nodes in a specified storage space, wherein the octree storage nodes include primary storage nodes and child storage nodes; Establish a hierarchical enterprise directory data, and then segment the hierarchical enterprise directory data using an octree partitioning method; Configure the identifier for each octree storage node, establish a mapping relationship between the partitioned directory data and the node identifier, and obtain the data to be stored under each directory. The storage location of the octree partitioned storage node is obtained by querying its own partitioned directory data and node identifier, and the data to be stored is stored in the storage space of the corresponding node. The octree storage node storage method includes: after storing the data to be stored in the first partitioned sub-storage node of the octree, determining whether the current storage node is full. If it is full, it checks whether the next first partitioned sub-storage node of the octree is full. If it is not full, it stores the current data to be stored in the next first partitioned sub-storage node of the octree, and returns the mark and pointer of the next first partitioned sub-storage node of the octree, and automatically updates the mapping table of the node mark and pointer of the corresponding directory data. After the data to be stored is stored in the corresponding first octree partition storage node, if the current first partition sub-storage node is not full, the current node is further partitioned into 8 second octree partition sub-storage nodes, and each second octree partition node is marked. An empty node not stored in the current second partition sub-storage node is searched. The subdirectory data in the enterprise directory data is further divided into 8 sub-subdirectory data. Based on the marking of the first partition sub-storage node where the second partition sub-storage node is located, it is searched whether there is any data to be stored in the corresponding subdirectory data. If so, the data to be stored in the corresponding sub-subdirectory data is stored in the corresponding second partition sub-storage node, and the marking information and storage pointer of the second partition sub-storage node are returned. The marking and storage pointer of the storage node mapped to the corresponding sub-subdirectory data are updated. A maintenance form for the storage nodes of different levels of the octree is constructed. The maintenance form stores the enterprise directory data of the corresponding level, as well as the sub-storage node markers and corresponding pointers of the corresponding directory data. When the corresponding data to be stored is inserted into the directory data of the corresponding level in the maintenance form, the sub-storage node markers and pointers of the corresponding directory data are automatically obtained, and the currently inserted data to be stored is stored in the storage location pointed to by the corresponding pointer. Obtain the storage status of the current root node. If the current root node is full, construct a second octree storage node in the current or new storage space. Simultaneously, obtain the storage tags and storage levels from the pre-established maintenance forms corresponding to different levels of enterprise directory data. Reconstruct the corresponding level of sub-storage nodes in the second octree storage node and reassign them with the same or different tags as the full octree storage node. Upload the second octree storage node tags and corresponding storage pointers to the maintenance forms corresponding to the enterprise directory data.

2. The enterprise data processing method according to claim 1, characterized in that, The octree storage structure construction method includes: obtaining specified storage space location information in the storage space of the memory; establishing a first sub-storage node of the octree according to the specified storage space location information; marking the first sub-storage node of the octree and returning the marking information of different nodes and pointers to the segmented storage; and using the returned marking information and pointers of the octree nodes for the storage of directory data.

3. The enterprise data processing method according to claim 1, characterized in that, The storage method of the directory data includes: after obtaining the current directory data, dividing the directory data into 8 subdirectories according to the octree partitioning rules, and configuring an octree first partition sub-storage node marker and a corresponding storage pointer for each subdirectory data, wherein the directory data has corresponding data to be stored, and storing the data to be stored in the specified octree first partition sub-storage node according to the octree first partition sub-storage node marker and storage pointer configured in the target data where the data to be stored is located.

4. The enterprise data processing method according to claim 1, characterized in that, The method includes a storage query method for octree storage nodes: sequentially scanning each layer of segmented storage nodes from the root node and determining the storage status of each layer of nodes. If the current storage status is empty or not full, all upper-layer segmented storage nodes of that layer are marked as not full nodes until all lower-layer segmented storage nodes are full, at which point the corresponding root node is marked as a full storage node.

5. An enterprise data processing system, characterized in that... The system executes an enterprise data processing method as described in any one of claims 1-4.

6. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that is executed by a processor to implement an enterprise data processing method according to any one of claims 1-4.

Images