A data processing method, device, apparatus, and storage medium

Abstract

The present disclosure provides a data processing method, device, equipment and storage medium, which can process tree structure data with a tree structure, the tree structure including at least one leaf layer, the leaf layer including at least one leaf node, the data corresponding to the leaf node being a key-value pair mapping structure including a key name and a key value of the key, by receiving a processing request for the tree structure data in the system; based on the processing request, determining a tree structure operation mode for the tree structure data; based on the tree structure operation mode, performing operation processing on the tree structure data. By representing data with a unified tree structure, data logic can be simplified, data and business logic of data can be designed separately, simple and effective data management and data calculation can be achieved, and for developers, it is beneficial for developers to quickly build calculation logic through the tree structure, which helps to reduce workload and reduce complexity of calculation logic.

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of computer, and in particular, to a data processing method and device, equipment and storage medium. BACKGROUND

[0002] After the industrialization era and the informationization era, people have completely entered the informationization era. With the continuous development of computer technology, especially the great progress in the fields of Internet of Things, artificial intelligence, blockchain, cloud platform, big data, etc., the amount of data increases exponentially. How to manage and process the increasing data stably, effectively, conveniently, quickly and accurately has gradually become a difficult problem to be solved, especially in the field of artificial intelligence (such as perceptual intelligence, intelligent computing and decision-making intelligence, etc.). The requirements for the rapidity, accuracy and convenience of data processing are particularly prominent.

[0003] Whether it is artificial intelligence or other intelligent fields, the data used is mostly regular tensor data, which does not well support the complex information situation in the real world, and a large amount of data preprocessing is needed. In order to realize the use of data, it is necessary to set up complex algorithm logic. Algorithm logic and data form are seriously coupled in specific implementation, resulting in high complexity of algorithm design and programming for data, and complicated logic. When using data, the amount of data processing is large, the processing time is long, and the resource consumption is high. SUMMARY

[0004] The present disclosure provides at least a data processing method, device, equipment and storage medium.

[0005] The present disclosure provides a data processing method, applied to a data processing system, the system stores tree structure data with a tree structure, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the data corresponding to the leaf node is key-value pair mapping structure data, the key-value pair mapping structure includes key name of key and key value of key, and the method includes:

[0006] Receiving a processing request for the tree structure data in the system;

[0007] Based on the processing request, determining a tree structure operation mode for the tree structure data;

[0008] Based on the tree structure operation mode, performing operation processing on the tree structure data.

[0009] Thus, by representing data in a unified tree structure, data logic can be simplified, data and business logic of data can be designed separately, simple and effective data management and data calculation can be achieved, and for developers, it is beneficial for developers to quickly build calculation logic through the tree structure, and it is helpful to reduce workload and reduce complexity of calculation logic.

[0010] In an alternative embodiment, the method further comprises:

[0011] receiving business data uploaded by a first business system;

[0012] performing tree structure processing on the business data to obtain tree structure business data corresponding to the business data;

[0013] storing the tree structure business data in the system.

[0014] In an alternative embodiment, the method further comprises:

[0015] obtaining an operation function in a second business system;

[0016] performing tree structure processing on the operation function, so that the processed operation function can support tree structure operation, and transforming variables in the operation function into tree structure variable data represented by the tree structure.

[0017] Further, for data and functions in various intelligent fields, encapsulation into a form supporting tree structure can achieve extension of data range and type, and for encapsulated data and functions, conventional calculation logic can be quickly built to make them operate on the tree structure.

[0018] In an alternative embodiment, the method further comprises:

[0019] obtaining a target value of a target parameter in the system;

[0020] detecting a data type of the target business parameter, the data type including a tree structure data object represented by a tree structure and a conventional numerical object;

[0021] If the data type of the target business parameter is a conventional numerical object, inputting the target value into a business function corresponding to the target business parameter for processing to obtain a processed result value.

[0022] In an alternative embodiment, after detecting the data type of the target business parameter, the method further comprises:

[0023] If the data type of the target service parameter is a tree structure data object, a result tree structure data corresponding to the target service parameter is determined, values on nodes under the tree structure of the result tree structure data are acquired one by one, and the acquired values and the target value are input into a service function corresponding to the result tree structure data to obtain a result value corresponding to the result tree structure data.

[0024] In this way, for the numerical value of the parameter, different data types can be processed respectively, and for the tree structure data object, the nodes can be processed one by one according to the tree structure, which is simple and fast, and does not need to consider complex calculation logic.

[0025] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode includes:

[0026] The key values under a first leaf node of the tree structure of the tree structure data are subjected to operation processing in the tree structure operation mode, and the tree structure operation mode includes one or more of query, assignment and deletion on the child nodes or numerical values of the key values under the first leaf node.

[0027] In this way, the content of the key value pair under the leaf node can be processed through the tree structure, and the processing is fast and convenient.

[0028] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode includes:

[0029] The tree structure data is subjected to one or more of the following operation processing:

[0030] It is detected whether the second leaf node under the tree structure includes a key corresponding to a query key name, the number of key value pairs under the third leaf node under the tree structure is acquired, and the key value pairs under the fourth leaf node under the tree structure are traversed.

[0031] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode includes:

[0032] The tree structure of the tree structure data is subjected to functional operation corresponding to the tree structure operation mode, and the functional operation includes one or more of mapping operation, filtering operation, induction operation, compilation operation and copying operation.

[0033] The mapping operation includes calculation of the key values on one or more leaf nodes in the tree structure and target numerical values.

[0034] The screening operation comprises deleting a leaf node in the tree structure that does not satisfy a target screening condition;

[0035] The induction operation comprises performing layer-by-layer induction calculation on one or more leaf nodes in at least two leaf layers of the tree structure based on a hierarchical relationship of the leaf nodes in the tree structure and an induction function corresponding to the tree structure operation mode;

[0036] The compiling operation comprises compiling and displaying the tree structure and / or a key value under at least one leaf node in the tree structure in a corresponding data format for a user to view;

[0037] The copying operation comprises copying the tree structure and / or a leaf node in the tree structure according to a preset copying mode.

[0038] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode comprises:

[0039] sinking a data structure on a fifth leaf node in the tree structure to a child node of the fifth leaf node; and / or

[0040] extracting a common data structure on at least one child node of a sixth leaf node in the tree structure and ascending the common data structure to the sixth leaf node.

[0041] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode comprises:

[0042] exporting the tree structure and information of the tree structure in a preset file format to obtain a corresponding data file; and / or

[0043] receiving the data file of the tree structure that is imported and generating the tree structure based on the data file;

[0044] The information of the tree structure comprises one or more of type information, structure information and data information under each node of the tree structure.

[0045] In an optional implementation, the operation processing of the tree structure data based on the tree structure operation mode comprises:

[0046] exporting the tree structure as a visual image to show a data relationship in the tree structure.

[0047] The embodiment of the present disclosure further provides a data processing device, which is applied to a data processing system, the system stores tree structure data with a tree structure, the tree structure comprises at least one leaf layer, the leaf layer comprises at least one leaf node, the data corresponding to the leaf node is data in a key-value pair mapping structure, the key-value pair mapping structure comprises a key name of a key and a key value of the key, and the device comprises:

[0048] A request receiving module is configured to receive a processing request for the tree structure data in the system.

[0049] An operation mode determining module is configured to determine a tree structure operation mode for the tree structure data based on the processing request.

[0050] A first operation processing module is configured to perform operation processing on the tree structure data based on the tree structure operation mode.

[0051] In an optional implementation, the device further comprises a first structuring module, and the first structuring module is configured to:

[0052] receive business data uploaded by a first business system;

[0053] perform tree structuring processing on the business data to obtain tree structure business data corresponding to the business data;

[0054] store the tree structure business data in the system.

[0055] In an optional implementation, the device further comprises a second structuring module, and the second structuring module is configured to:

[0056] obtain an operation function in a second business system;

[0057] perform tree structuring processing on the operation function, so that the processed operation function can support tree structure operation, and transform a variable in the operation function into tree structure variable data represented by the tree structure.

[0058] In an optional implementation, the device further comprises a second operation processing module, and the second operation processing module is configured to:

[0059] obtain a target value of a target parameter in the system;

[0060] detect a data type of the target business parameter, the data type comprising a tree structure data object represented by a tree structure and a conventional numerical value object;

[0061] If the data type of the target service parameter is a regular numerical object, the target value is input into a service function corresponding to the target service parameter for processing to obtain a processed result value.

[0062] In an alternative implementation, the second operation processing module is further configured to:

[0063] If the data type of the target service parameter is a tree structure data object, a result tree structure data corresponding to the target service parameter is determined, values on nodes under the tree structure of the result tree structure data are acquired one by one, and the acquired values and the target value are input into a service function corresponding to the result tree structure data to obtain a result value corresponding to the result tree structure data.

[0064] In an alternative implementation, the first operation processing module is specifically configured to:

[0065] The key values under a first leaf node in the tree structure of the tree structure data are subjected to operation processing in the tree structure operation mode, the tree structure operation mode including one or more of query, assignment and deletion on child nodes or numerical values corresponding to the key values under the first leaf node.

[0066] In an alternative implementation, the first operation processing module is specifically configured to:

[0067] The tree structure data is subjected to one or more of the following operation processing:

[0068] It is detected whether the second leaf node in the tree structure includes a key corresponding to a query key name, the number of key-value pairs under a third leaf node in the tree structure is acquired, and the key-value pairs under a fourth leaf node in the tree structure are traversed.

[0069] In an alternative implementation, the first operation processing module is specifically configured to:

[0070] The tree structure of the tree structure data is subjected to functional operation corresponding to the tree structure operation mode, the functional operation including one or more of mapping operation, filtering operation, induction operation, compilation operation and copying operation;

[0071] The mapping operation includes calculation of key values on one or more leaf nodes in the tree structure with a target numerical value.

[0072] The filtering operation includes deletion of leaf nodes in the tree structure that do not satisfy a target filtering condition.

[0073] The induction operation comprises performing layer-by-layer induction calculation on one or more leaf nodes in at least two leaf layers of the tree structure based on a hierarchical relationship of the leaf nodes and an induction function corresponding to the operation mode of the tree structure.

[0074] The compiling operation comprises compiling and displaying the tree structure and / or the key values under the leaf nodes in the tree structure in a corresponding data format for a user to view.

[0075] The copying operation comprises copying the tree structure and / or the leaf nodes in the tree structure according to a preset copying mode.

[0076] In an optional implementation, the first operation processing module is specifically configured to:

[0077] sink a data structure on a fifth leaf node in the tree structure to a child node of the fifth leaf node; and / or

[0078] extract a common data structure on at least one child node of a sixth leaf node in the tree structure and ascend the common data structure to the sixth leaf node.

[0079] In an optional implementation, the first operation processing module is specifically configured to:

[0080] export the tree structure and information of the tree structure in a preset file format to obtain a corresponding data file; and / or

[0081] receive the data file of the tree structure imported and generate the tree structure based on the data file;

[0082] The information of the tree structure comprises one or more of type information, structure information and data information under each node of the tree structure.

[0083] In an optional implementation, the first operation processing module is specifically configured to:

[0084] export the tree structure as a visual image to show a data relationship in the tree structure.

[0085] The present disclosure also provides a computer device, comprising a processor, a memory and a bus, the memory stores machine readable instructions executable by the processor, when the computer device is running, the processor and the memory communicate through the bus, and the machine readable instructions are executed by the processor to perform the steps of the data processing method.

[0086] The data processing method provided by the embodiments of the present disclosure can process tree structure data with a tree structure in a data processing system, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the data corresponding to the leaf node is data in a key-value pair mapping structure, the key-value pair mapping structure includes a key name of a key and a key value of the key, and the processing can be performed by receiving a processing request for the tree structure data in the system, determining a tree structure operation mode for the tree structure data based on the processing request, and performing operation processing on the tree structure data based on the tree structure operation mode.

[0087] The data processing method, device, equipment and storage medium provided by the embodiments of the present disclosure can process tree structure data with a tree structure in a data processing system, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the data corresponding to the leaf node is data in a key-value pair mapping structure, the key-value pair mapping structure includes a key name of a key and a key value of the key, and the processing can be performed by receiving a processing request for the tree structure data in the system, determining a tree structure operation mode for the tree structure data based on the processing request, and performing operation processing on the tree structure data based on the tree structure operation mode.

[0088] In this way, the data can be represented by a unified tree structure, the data logic can be simplified, the data and the business logic of the data can be designed separately, simple and effective data management and data calculation can be achieved, and for a developer, the developer can quickly build a calculation logic through the tree structure, which helps to reduce the workload and reduce the complexity of the calculation logic.

[0089] Further, for data and functions in various intelligent fields, encapsulation is performed in a form supporting a tree structure, data range and type extension can be achieved, and a regular calculation logic can be quickly built for the encapsulated data and functions, so that the encapsulated data and functions are operated on the tree structure.

[0090] Further, a plurality of basic operations and extension operations can be performed on the tree structure data according to the tree structure, which brings a more edited data processing mode to a user, simplifies the data processing mode, and reduces the difficulty of data processing.

[0091] In order to make the above-mentioned purposes, features and advantages of the present disclosure more obvious and easy to understand, the following preferred embodiments are described in detail below, and the accompanying drawings are described as follows. BRIEF DESCRIPTION OF DRAWINGS

[0092] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the following will briefly introduce the drawings needed to be used in the embodiments. The drawings herein are incorporated into the specification and form a part of the specification, which illustrate the embodiments consistent with the present disclosure, and are used to explain the technical solutions of the present disclosure together with the specification. It should be understood that the following drawings only show some embodiments of the present disclosure, and therefore should not be regarded as a limitation on the scope, and other related drawings can also be obtained by those skilled in the art without paying creative labor on the basis of the drawings.

[0093] Figure 1 A schematic diagram of an application scenario of a data processing system provided by an embodiment of the present disclosure is shown in FIG. 1.

[0094] Figure 2 A flowchart of a data processing method provided by an embodiment of the present disclosure is shown in FIG. 2.

[0095] Figure 3 A schematic diagram of a tree structure of tree structure data in an embodiment of the present disclosure is shown in FIG. 3.

[0096] Figure 4 A schematic diagram of a data processing apparatus provided by an embodiment of the present disclosure is shown in FIG. 4.

[0097] Figure 5 A schematic diagram of a data processing apparatus provided by an embodiment of the present disclosure is shown in FIG. 5.

[0098] Figure 6 A schematic diagram of a computer device provided by an embodiment of the present disclosure is shown in FIG. 6. DETAILED DESCRIPTION

[0099] In order to make the objectives, technical solutions and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be described below in connection with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all the embodiments. The components of the embodiments of the present disclosure described and shown in the drawings herein can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present disclosure provided in the drawings is not intended to limit the scope of the claimed present disclosure, but only represents selected embodiments of the present disclosure. Based on the embodiments of the present disclosure, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the present disclosure.

[0100] It is found through research that, whether it is artificial intelligence (such as perceptual intelligence, intelligent computing and decision-making intelligence, etc.) or other intelligent fields, the data used is mostly regular tensor data, which does not have good support for complex information situations in the real world, and a large amount of data preprocessing is required. In order to realize the use of data, complex algorithm logic needs to be set, and there is serious coupling between algorithm logic and data form in specific implementation, resulting in high complexity of algorithm design and programming for data, and complicated logic. Moreover, when using data, the amount of data processing is large, the processing time is long, and the resource consumption is high.

[0101] Based on the above research, the present disclosure provides a data processing method, which can process tree structure data with a tree structure in a data processing system, the tree structure including at least one leaf layer, the leaf layer including at least one leaf node, the data corresponding to the leaf node being key-value pair mapping structure data, the key-value pair mapping structure including key names and key values of keys, and the processing being able to receive a processing request for the tree structure data in the system; determining a tree structure operation mode for the tree structure data based on the processing request; and performing operation processing on the tree structure data based on the tree structure operation mode.

[0102] In this way, by representing data with a unified tree structure, data logic can be simplified, data and business logic of data can be designed separately, simple and effective data management and data calculation can be achieved, and for developers, it is beneficial for developers to quickly build calculation logic through the tree structure, which helps to reduce workload and reduce complexity of calculation logic.

[0103] The above-mentioned defects are the results of the inventors' practice and careful research, and therefore, the discovery process of the above-mentioned problems and the solutions proposed by the present disclosure to solve the above-mentioned problems should be the contributions of the inventors to the present disclosure.

[0104] It should be noted that similar reference numerals and letters refer to similar items in the following drawings, and therefore, once an item is defined in one drawing, it does not need to be further defined and explained in subsequent drawings.

[0105] Please refer to Figure 1 , Figure 1 The application scenario of the data processing system provided by the embodiments of the present disclosure is shown in the figure. The data processing system 100 can provide processing capability for general tree structure data, wherein tree structure data with a tree structure is stored, the tree structure including at least one leaf layer, the leaf layer including at least one leaf node, the data corresponding to the leaf node being key-value pair mapping structure data, and the key-value pair mapping structure including key names and key values of keys.

[0106] In some cases, the tree structure and / or a certain leaf node in the tree structure (which is itself a tree structure data having a tree structure) can also be an empty tree structure (only root node) or an empty sub-tree structure (no corresponding child leaf nodes when the leaf node is a parent node of a sub-tree structure) without leaf layers (for the leaf node, relative to the child leaf layers of the leaf node) and leaf nodes (for the leaf node, relative to the child leaf nodes of the leaf node), i.e., there is no value or sub-tree structure mounted under the root node and / or the leaf node, resulting in an empty root node and / or the leaf node without corresponding child nodes.

[0107] As shown in Figure 1 The data processing system includes a business layer, a data layer, and an access layer. The access layer is mainly used to realize data interaction with the outside, and can encapsulate some general functions in the program and received data through a tree decoration function (such as a function corresponding to a decorator pattern) to form a new function adapted to a tree structure, so as to expand more data and value operation functions (general functions) to the operation on the tree structure layer, adapt the data requirements of the data processing system 100. The business layer is mainly used to realize business requirements and receive business access, such as receiving user operations to realize human-computer interaction. The business layer internally includes a pointer to a data object stored in the data layer. The business layer can use the native method of a Python object. The basic behaviors supported by the business layer are basically the same as those of the data layer. For example, through the business layer, the user's query requirements can be known. Correspondingly, the data layer can realize the user's query on the data. The data layer is mainly responsible for the storage, maintenance, and processing of tree structure data represented by a tree structure. In the data layer, some basic operations of tree structure data can be supported, such as key query, key assignment, key deletion, key determination, key counting, and key traversal. In addition, some extended tree structure operations can be supported through an operation script tool, such as mapping operation, screening operation, induction operation, structure sinking operation, structure floating operation, copy operation, and tree structure graphical operation.

[0108] Among them, the operation of the tree structure data can include operations inside the tree structure, such as between the leaf layers and the leaf nodes of each layer inside the tree structure, and can also include operations outside the tree structure, such as function operations between tree structures of different tree structure data.

[0109] Further, based on the above principle of encapsulating data and general functions into a tree structure by tree decoration functions, the data class can be encapsulated into a tree structure, and a tree structure class is obtained, so that the data under the tree structure class has a tree structure, and adapts to the management of the data processing system 100. The tree structure class is based on the tree structure of the original class, and the tree structure class needs to define a constructor function, which can be consistent with the constructor function of the original class, and only needs to ensure ease of use. In addition, the methods of some tree structure classes can be specially defined, such as the induction of the summation method, that is, the return value of the summation function after tree decoration is the sum of the return values of the summation functions of each object on the tree. For other methods, the default tree decoration function is used for encapsulation.

[0110] Further, based on the above principle of encapsulating data and general functions into a tree structure by tree decoration functions, the data module can also be encapsulated into a tree structure to generate a tree structure module that adapts to the management of the data processing system 100. The tree module is based on the function and class structure of the original module, and some functions and classes in the module can be specially defined. For other functions and classes, the default method can be used for tree decoration.

[0111] Please refer to Figure 2 , Figure 2 The flowchart of a data processing method provided by the embodiments of the present disclosure. The data processing method used by the embodiments of the present disclosure can be applied to the data processing system 100 as shown in Figure 1 The data processing system 100 stores tree structure data with a tree structure, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the data corresponding to the leaf node is a key-value mapping structure data, and the key-value mapping structure includes a key name and a key value. As shown in Figure 2 The method comprises the following steps:

[0112] S201: Receive a processing request for the tree structure data in the system.

[0113] In this step, when a user needs to process, maintain and use the tree structure data stored in the data processing system, a processing request for the tree structure data can be sent. Correspondingly, if the processing request is accepted, it can be considered that the tree structure data needs to be processed.

[0114] The user can be a person who maintains and manages the tree structure data stored in the data processing system, or a business system who uses and processes the tree structure data stored in the data processing system.

[0115] S202: Determine a tree structure operation mode for the tree structure data based on the processing request.

[0116] In this step, after receiving the processing request, the processing request can be parsed, matched, etc. For example, the processing information in the processing request is parsed, or the processing request is matched with a plurality of operation modes for the tree structure that the data processing system can provide, etc., so as to determine the tree structure operation mode for the tree structure data.

[0117] The plurality of operation modes can include the plurality of basic operation modes and the plurality of extended operation modes described above.

[0118] S203: Perform operation processing on the tree structure data based on the tree structure operation mode.

[0119] In this step, after determining the tree structure operation mode, operation processing can be performed on the tree structure data according to the tree structure operation mode.

[0120] The present step will be described in combination with some specific operation modes.

[0121] Specifically, in one possible implementation, performing operation processing on the tree structure data based on the tree structure operation mode can be performing operation processing on the key values under a first leaf node in the tree structure of the tree structure data according to the tree structure operation mode.

[0122] The tree structure operation mode includes one or more of query, assignment and deletion on the child nodes or values of the key values under the first leaf node.

[0123] In the specific processing process, if it is determined that the tree structure operation mode is a key query in the basic operation, the child nodes or values of the key values under the first leaf node to be queried in the tree structure can be queried, i.e. the values corresponding to the key values of the first leaf node, and / or the values corresponding to the key values of one or more child nodes of the first leaf node are queried. Correspondingly, the input parameter included in the processing request can be the key name of the leaf node to be queried. If the first leaf node contains the key corresponding to the input key name, the value object or child node object belonging to the key can be returned, otherwise an exception is thrown.

[0124] If it is determined that the tree structure operation mode is key assignment in the above basic operation, the value of the child node or the value corresponding to the key value under the first leaf node in the tree structure can be assigned, i.e., the value corresponding to the key value of the first leaf node is set. Correspondingly, the input parameters included in the processing request can include the key name of the first leaf node to be assigned and the value to be assigned (the data type of the value to be assigned can be the value of a conventional value object or a child node in a tree structure data object).

[0125] If it is determined that the tree structure operation mode is key deletion in the above basic operation, the value of the child node or the value corresponding to the key value under the first leaf node in the tree structure can be deleted, i.e., the value corresponding to the key value of the first leaf node and / or the value corresponding to the key value of one or more child nodes of the first leaf node are deleted. Correspondingly, the input parameters included in the processing request can be the key name to be deleted. If the first leaf node contains the input key name corresponding to the key, the key and the child node of the key can be deleted, otherwise an exception is thrown.

[0126] Specifically, in some possible embodiments, based on the tree structure operation mode, the tree structure data can be operated and processed in one or more of the following operation and processing:

[0127] Detecting whether the second leaf node in the tree structure includes a key corresponding to a query key name; obtaining the number of key-value pairs under the third leaf node in the tree structure; and traversing the key-value pairs under the fourth leaf node in the tree structure.

[0128] In the specific processing process, if it is determined that the tree structure operation mode is key determination in the above basic operation, the keys under the second leaf node and the keys under one or more child nodes of the second leaf node in the tree structure can be detected to detect whether the input query key name corresponds to a key. Correspondingly, the input parameters included in the processing request can be the key name of the key to be detected. If the second leaf node and one or more child nodes thereof contain the key to be detected, true is returned, otherwise false is returned.

[0129] If it is determined that the tree structure operation mode is key counting in the above basic operation, the number of key-value pairs under the third leaf node can be detected and the detected number is returned. The leaf node in the tree structure can include a plurality of key-value pairs.

[0130] If it is determined that the tree structure operation mode is key traversal in the above basic operation, the iterator object of all directly connected direct key-value pairs under the fourth leaf node can be traversed.

[0131] Specifically, in some possible implementation, based on the tree structure operation mode, the operation processing on the tree structure data can be a functional operation corresponding to the tree structure operation mode on the tree structure of the tree structure data, and the functional operation includes one or more of a mapping operation, a filtering operation, an induction operation, a compilation operation, and a copy operation.

[0132] The mapping operation includes calculating a key value on one or more leaf nodes in the tree structure with a target value, that is, mapping the key value on one or more leaf nodes through a mapping function (for example, multiplying 2).

[0133] The filtering operation includes deleting a leaf node in the tree structure that does not satisfy a target filtering condition.

[0134] The induction operation includes performing layer-by-layer induction calculation on one or more leaf nodes in at least two leaf layers of the tree structure based on a hierarchical relationship of the leaf nodes of the tree structure and an induction function corresponding to the tree structure operation mode, to obtain a final induction value.

[0135] When the data processing system is provided with a functional tool, the tree structure data can be subjected to functional operation, that is, the mapping operation, the filtering operation, and the induction operation on the tree structure data can be supported.

[0136] The compilation operation includes compiling and displaying the tree structure and / or the key value under at least one leaf node in the tree structure in a corresponding data format, for example, exporting the tree structure and / or the key value under at least one leaf node in the tree structure in a json format for a user to view.

[0137] The copy operation includes copying the tree structure and / or the leaf node in the tree structure according to a preset copy mode. The preset copy mode can be a copy function customized by a user.

[0138] When the data processing system is provided with a business logic tool, the tree structure data can be subjected to basic business logic operation, that is, the compilation operation and the copy operation on the tree structure data can be supported.

[0139] Specifically, in some possible implementation, based on the tree structure operation mode, the operation processing on the tree structure data can be sinking a data structure on a fifth leaf node in the tree structure to a child node of the fifth leaf node.

[0140] In the data structure sinking to the child node of the fifth leaf node, the data structure can be sunk to the child node of the fifth leaf node and the child node of the child node of the fifth leaf node. Further, the fifth leaf node can be a parent node in the tree structure or a certain leaf node.

[0141] Preferably, the data structure of the parent node in the tree structure can be sunk to each leaf node, that is, only when the fifth leaf node is a parent node, the data structure can be sunk to each child node under the fifth leaf node.

[0142] For example, refer to Figure 3 , Figure 3 is a schematic diagram of the tree structure of the tree structure data in the embodiment of the present disclosure. As shown in Figure 3 , taking the tree structure of the tree structure data including four leaf layers as an example, for sinking the data structure, the data structure of the parent node A can be sunk to each leaf node from the parent node A, or sunk to a certain layer of leaf layer, for example, sunk to the B layer of leaf layer (including B1, B3, B3), or sunk to the C layer of leaf layer (including C1, C2, C3).

[0143] Specifically, in some possible implementation manners, based on the tree structure operation mode, the operation processing on the tree structure data can be extracting the common data structure on at least one child node of the sixth leaf node in the tree structure and ascending to the sixth leaf node.

[0144] In the ascending of the common data structure to the sixth leaf node, the common data structure of the multiple child nodes belonging to the same layer in the multiple child nodes under the sixth leaf node can be ascended.

[0145] For example, as shown in the tree structure in Figure 3 , when the D1 node and the D2 node have the common data structure, the common data structure can be ascended to the C1 node. After the ascending, if the C1 node and the C2 node have the common data structure, the common data structure can be further ascended to the B1 node. After the second ascending, if the B1 node, the B2 node and the B3 node have the common data structure, the common data structure can be continuously ascended to the A node.

[0146] In the data processing system provided with the tree structure tool, the tree structure can be changed based on the basic property of the tree structure, that is, the structure ascending operation and the structure sinking operation on the tree structure can be supported.

[0147] Specifically, in some possible implementation, based on the tree structure operation mode, the operation processing on the tree structure data can be exporting the tree structure and the information of the tree structure in a preset file format to obtain a corresponding data file.

[0148] Further, based on the tree structure operation mode, the operation processing on the tree structure data can be receiving the imported data file of the tree structure and generating the tree structure based on the data file.

[0149] In this way, the data file in the preset file format, for example, the data file in the binary data format, can be exported, and the permanent storage and re-loading of the tree structure data can be implemented.

[0150] Specifically, in some possible implementation, based on the tree structure operation mode, the operation processing on the tree structure data can be exporting the tree structure and the information of the tree structure in a preset file format to obtain a corresponding data file.

[0151] In this way, the tree structure can be exported as an image to show the internal data relationship.

[0152] In some possible implementation, the method further includes:

[0153] receiving the business data uploaded by the first business system; performing tree structure processing on the business data to obtain tree structure business data corresponding to the business data; and storing the tree structure business data in the system.

[0154] In this step, in order to facilitate the management of the uploaded business data and to enable the business data to adapt to the data processing system, the tree structure processing can be performed on the business data by using the tree decoration function to implement tree structure encapsulation, to obtain the tree structure business data corresponding to the business data, and then the obtained tree structure business data can be stored in the data processing system as the tree structure data, which can support various operations and processing as described above, and after the connection with the first business system is implemented, the business data uploaded by the business system can be received.

[0155] In some possible implementation, the method further includes:

[0156] obtaining an operation function in the second business system; performing tree structure processing on the operation function, so that the processed operation function can support tree structure operation, and transforming a variable in the operation function into tree structure variable data represented by the tree structure.

[0157] In this step, in addition to encapsulating the data into the tree structure data, the operation function in the second service system can also be tree-structured by the tree decoration function described above to achieve tree structure encapsulation, so as to transform the variables in the operation function into tree structure variable data represented by the tree structure, and the processed operation function can support tree structure operation.

[0158] In some possible implementations, the method further includes:

[0159] obtaining a target value of a target parameter in the system; detecting a data type of the target service parameter, the data type including a tree structure data object represented by a tree structure and a conventional numerical object; if the data type of the target service parameter is the conventional numerical object, inputting the target value into a service function corresponding to the target service parameter for processing to obtain a processed result value.

[0160] In this step, when the user wants to process the tree structure data, a target value of a target parameter of a target leaf node in the tree structure data can be input. Since the types of parameters in different leaf nodes are different, the data type of the target service parameter needs to be detected. If the data type of the target service parameter is a conventional numerical object, the target value is directly input into a service function corresponding to the target service parameter, and a result value returned by the obtained service function is taken as a return result.

[0161] The data type includes a tree structure data object represented by a tree structure and a conventional numerical object. The conventional numerical object can include, for example, all python objects, such as int, str, float, and Tensor objects in the torch library.

[0162] Further, the method further includes:

[0163] If the data type of the target service parameter is the tree structure data object, a result tree structure data corresponding to the target service parameter is determined, values on a plurality of nodes under the tree structure of the result tree structure data are obtained one by one, and the obtained plurality of values and the target value are input into a service function corresponding to the result tree structure data to obtain a result value corresponding to the result tree structure data.

[0164] Here, in a case where it is detected that the data type of the target service parameter is a tree structure data object, the corresponding result tree structure data of the target service parameter can be determined according to the related information of the target parameter, that is, which tree structure data is stored in the data processing system, by searching or the like. Then, for the searched result tree structure data, the values on each node of the tree structure can be obtained one by one, and then the values and the target value are input into the service function corresponding to the result tree structure data, to obtain the result value corresponding to the result tree structure data.

[0165] The data processing method provided by the embodiments of the present disclosure can process tree structure data having a tree structure in a data processing system, the tree structure including at least one leaf layer, the leaf layer including at least one leaf node, the data corresponding to the leaf node being key-value pair mapping structure data, the key-value pair mapping structure including a key name of a key and a key value of the key, and the processing including receiving a processing request for the tree structure data in the system, determining a tree structure operation mode for the tree structure data based on the processing request, and performing operation processing on the tree structure data based on the tree structure operation mode.

[0166] In this way, the data is represented by a unified tree structure, which can simplify data logic, separate data and service logic, and achieve simple and effective data management and data calculation. For developers, the tree structure can help quickly build calculation logic, reduce workload, and reduce the complexity of calculation logic.

[0167] Those skilled in the art can understand that the order of writing each step in the above method does not mean a strict execution order and does not constitute any limitation on the implementation process. The specific execution order of each step should be determined by its function and possible internal logic.

[0168] Based on the same inventive concept, the embodiments of the present disclosure also provide a data processing apparatus corresponding to the data processing method. Since the principle of solving problems by the apparatus in the embodiments of the present disclosure is similar to the above-mentioned data processing method, the implementation of the apparatus can be referred to the implementation of the method, and the repeated parts will not be described.

[0169] Please refer to Figure 4 to Figure 5 , Figure 4 a schematic diagram of a data processing apparatus provided by the embodiments of the present disclosure, Figure 5Figure 2 is a schematic diagram of a data processing device according to an embodiment of the present disclosure. The data processing device according to the embodiment of the present disclosure can be applied to the data processing system as described above. The data processing device can be the same device as the data processing system under different names. The data processing device can also be a part of the data processing system and coupled to the data processing system. The modules in the data processing device and the corresponding functional layers in the data processing system can be coupled together to achieve the same function. The system stores tree structure data having a tree structure. The tree structure includes at least one leaf layer. The leaf layer includes at least one leaf node. The data corresponding to the leaf node is in a key-value mapping structure. The key-value mapping structure includes a key name and a key value.

[0170] As shown in Figure 4 , the data processing device 400 includes:

[0171] A request receiving module 410 is configured to receive a processing request for the tree structure data in the system.

[0172] An operation mode determining module 420 is configured to determine a tree structure operation mode for the tree structure data based on the processing request.

[0173] A first operation processing module 430 is configured to perform operation processing on the tree structure data based on the tree structure operation mode.

[0174] In an optional implementation, as shown in Figure 5 , the data processing device 400 further includes a first structuring module 440. The first structuring module 440 is configured to:

[0175] receive business data uploaded by a first business system;

[0176] perform tree structuring processing on the business data to obtain tree structure business data corresponding to the business data;

[0177] store the tree structure business data in the system.

[0178] In an optional implementation, as shown in Figure 5 , the data processing device 400 further includes a second structuring module 450. The second structuring module 450 is configured to:

[0179] obtain an operation function in a second business system;

[0180] perform tree structuring processing on the operation function so that the processed operation function can support tree structure operation and transform variables in the operation function into tree structure variable data represented by the tree structure.

[0181] In an optional implementation, as shown in FIG. 4B, the apparatus further includes a second operation processing module 460, configured to: Figure 5

[0182] obtain a target value of a target parameter in the system;

[0183] detect a data type of the target service parameter, the data type including a tree structure data object represented in a tree structure and a regular numerical object;

[0184] if the data type of the target service parameter is the regular numerical object, input the target value into a service function corresponding to the target service parameter for processing to obtain a processed result value.

[0185] In an optional implementation, the second operation processing module 460 is further configured to:

[0186] if the data type of the target service parameter is the tree structure data object, determine a result tree structure data corresponding to the target service parameter, obtain values on multiple nodes under a tree structure of the result tree structure data one by one, and input the obtained multiple values and the target value into a service function corresponding to the result tree structure data to obtain a result value corresponding to the result tree structure data.

[0187] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0188] perform operation processing on a key value under a first leaf node in a tree structure of the tree structure data in a tree structure operation mode, the tree structure operation mode including one or more of query, assignment, and deletion performed on a child node or a numerical value corresponding to the key value under the first leaf node.

[0189] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0190] perform one or more of the following operation processing on the tree structure data:

[0191] detect whether a key corresponding to a query key name is included under a second leaf node in the tree structure, obtain a number of key-value pairs under a third leaf node in the tree structure, and perform traversal on key-value pairs under a fourth leaf node in the tree structure.

[0192] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0193] ​perform a functional operation corresponding to the tree structure operation mode on the tree structure of the tree structure data, the functional operation including one or more of a mapping operation, a filtering operation, an induction operation, a compiling operation, and a copying operation;

[0194] The mapping operation includes calculating a key value on one or more leaf nodes in the tree structure with a target numerical value.

[0195] The filtering operation includes deleting a leaf node in the tree structure that does not satisfy a target filtering condition.

[0196] The induction operation includes performing a layer-by-layer induction calculation on one or more leaf nodes in at least two leaf layers of the tree structure based on a hierarchical relationship of the leaf nodes and an induction function corresponding to the tree structure operation mode.

[0197] The compiling operation includes compiling and displaying the tree structure and / or a key value under at least one leaf node in the tree structure in a corresponding data format for a user to view.

[0198] The copying operation includes copying the tree structure and / or a leaf node in the tree structure according to a preset copying mode.

[0199] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0200] sink a data structure on a fifth leaf node in the tree structure to a child node of the fifth leaf node; and / or

[0201] extract a common data structure on at least one child node of a sixth leaf node in the tree structure and ascend the common data structure to the sixth leaf node.

[0202] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0203] export the tree structure and information of the tree structure in a preset file format to obtain a corresponding data file; and / or

[0204] receive the data file of the tree structure that is imported and generate the tree structure based on the data file;

[0205] The information of the tree structure includes one or more of type information, structure information, and data information under each node of the tree structure.

[0206] In an optional implementation, the first operation processing module 430 is specifically configured to:

[0207] The tree structure is exported as a visual image to show data relationships in the tree structure.

[0208] The data processing apparatus provided by the embodiments of the present disclosure can process tree structure data having a tree structure in a data processing system, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the data corresponding to the leaf node is key-value pair mapping structure data, the key-value pair mapping structure includes a key name of a key and a key value of the key, and when processing, a processing request for the tree structure data in the system can be received; based on the processing request, a tree structure operation mode for the tree structure data is determined; and based on the tree structure operation mode, the tree structure data is processed.

[0209] In this way, by representing data by a unified tree structure, data logic can be simplified, data and business logic of data can be designed separately, simple and effective data management and data calculation can be implemented, and for a developer, it is beneficial for the developer to quickly build calculation logic by the tree structure, and it is helpful to reduce workload and reduce complexity of calculation logic.

[0210] The processing flow of each module in the apparatus and the interaction flow between the modules can refer to the related description in the above method embodiments, and will not be described in detail here.

[0211] Corresponding to the data processing method in Figure 2 The embodiments of the present disclosure also provide a computer device 600, as shown in Figure 6 The computer device 600 provided by the embodiments of the present disclosure is a schematic diagram of the computer device 600, which includes:

[0212] The processor 610, the memory 620, and the bus 630; the memory 620 is used to store execution instructions, including the memory 621 and the external memory 622; the memory 621 here is also called an internal memory, which is used to temporarily store operation data in the processor 610 and data exchanged with the external memory 622 such as a hard disk, the processor 610 exchanges data with the external memory 622 through the memory 621, the processor 610 and the memory 620 communicate with each other through the bus 630 when the computer device 600 is running, and the machine readable instructions are executed by the processor 610 to execute the steps of the data processing method in the above method embodiments. Figure 2 The steps of the data processing method in the method embodiments shown in

[0213] The embodiments of the present disclosure also provide a computer readable storage medium, which stores a computer program, and the computer program is executed by a processor to execute the steps of the data processing method in the above method embodiments. The storage medium can be a volatile or non-volatile computer readable storage medium.

[0214] The embodiments of the present disclosure further provide a computer program product carrying program codes, the program codes comprising instructions for executing the steps of the data processing method described in the above method embodiments, which can be specifically referred to the above method embodiments and will not be repeated here.

[0215] The computer program product can be specifically implemented by hardware, software or a combination thereof. In an optional embodiment, the computer program product is specifically embodied as a computer storage medium. In another optional embodiment, the computer program product is specifically embodied as a software product, such as a software development kit (SDK) and the like.

[0216] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the above-described system and device can refer to the corresponding process in the above method embodiments, which will not be repeated here. In several embodiments provided by the present disclosure, it should be understood that the disclosed system, device and method can be implemented by other means. The above-described device embodiments are only schematic, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some communication interface, device or unit, which can be electrical, mechanical or other forms.

[0217] The units described as separate components can or can not be physically separate, and the components shown as units can or can not be physical units, i.e. they can be located in one place or distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment.

[0218] In addition, each functional unit in each embodiment of the present disclosure can be integrated into one processing unit, or each unit can exist physically, or two or more units can be integrated into one unit.

[0219] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a nonvolatile computer readable storage medium executable by a processor. Based on this understanding, the technical solutions of the present disclosure essentially or the part that contributes to the prior art or part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a number of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of the present disclosure. The aforementioned storage medium includes: a U disk, a mobile hard disk, a read-only memory (Read-Only Memory, ROM), a random access memory (Random Access Memory, RAM), a magnetic disk or an optical disk, and various media that can store program codes.

[0220] Finally, it should be noted that: the above-described embodiments are only specific embodiments of the present disclosure, used to illustrate the technical solutions of the present disclosure, and not to limit them. The protection scope of the present disclosure is not limited thereto. Although the present disclosure has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art who is familiar with the technology in the art can still make modifications or easily think of changes to the technical solutions described in the foregoing embodiments, or make equivalent replacements to some of the technical features; and these modifications, changes or replacements do not cause the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of the present disclosure, and should be covered within the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope of the claims.

Claims

1. A data processing method, characterized by, The method is applied to a data processing system, the system stores tree structure data with a tree structure, the tree structure includes at least one leaf layer, the leaf layer includes at least one leaf node, the leaf layers at the same layer are at the same level of the tree structure data, the data corresponding to the leaf node is key-value pair mapping structure data, the key-value pair mapping structure includes a plurality of key-value pairs, the key-value pair mapping structure includes a key name of a key and a key value of the key, and the method includes: receiving an external input processing request for the tree structure data in the system; determining a tree structure operation mode for the tree structure data based on the processing request; performing operation processing on the tree structure data based on the tree structure operation mode; receiving business data uploaded by a first business system; performing tree structure processing on the business data to obtain tree structure business data corresponding to the business data; storing the tree structure business data in the system as the tree structure data; obtaining an operation function in a second business system; performing tree structure processing on the operation function, so that the processed operation function can support tree structure operation, and transforming a variable in the operation function into tree structure variable data represented by the tree structure.

2. The method of claim 1, wherein, The method further includes: obtaining a target value of a target parameter in the system; detecting the data type of the target business parameter, the data type including a tree structure data object represented by a tree structure and a conventional numerical object; if the data type of the target business parameter is a conventional numerical object, inputting the target value into a business function corresponding to the target business parameter for processing to obtain a processed result value.

3. The method of claim 2, wherein, After detecting the data type of the target business parameter, the method further includes: if the data type of the target business parameter is a tree structure data object, determining a result tree structure data corresponding to the target business parameter, obtaining a value on each node under the tree structure of the result tree structure data one by one, and inputting the obtained plurality of values and the target value into a business function corresponding to the result tree structure data to obtain a result value corresponding to the result tree structure data.

4. The method according to any one of claims 1 to 3, characterized in that, The operation processing on the tree structure data based on the tree structure operation mode includes: performing operation processing on the key values under a first leaf node in the tree structure of the tree structure data in the tree structure operation mode, the tree structure operation mode including one or more of querying, assigning values, and deleting sub-nodes or numerical values corresponding to the key values under the first leaf node.

5. The method according to any one of claims 1 to 3, characterized in that, The operation processing on the tree structure data based on the tree structure operation mode includes: performing one or more of the following operation processing on the tree structure data: detecting whether the second leaf node in the tree structure includes a key corresponding to a query key name; obtaining the number of key-value pairs under the third leaf node in the tree structure; and traversing the key-value pairs under the fourth leaf node in the tree structure.

6. The method according to any one of claims 1 to 3, characterized in that, The operation processing on the tree structure data based on the tree structure operation mode includes: The tree structure of the tree structure data is subjected to a functional operation corresponding to the tree structure operation mode, the functional operation including one or more of a mapping operation, a filtering operation, an induction operation, a compilation operation, and a copying operation; The mapping operation includes calculating key values on one or more leaf nodes in the tree structure with target numerical values; The filtering operation includes deleting leaf nodes in the tree structure that do not meet a target filtering condition; The induction operation includes performing layer-by-layer induction calculation on one or more leaf nodes in at least two leaf layers of the tree structure based on a hierarchical relationship of the leaf nodes and an induction function corresponding to the tree structure operation mode; The compilation operation includes compiling and displaying key values under the tree structure and / or at least one leaf node in the tree structure in a corresponding data format for a user to view; The copying operation includes copying the tree structure and / or leaf nodes in the tree structure according to a preset copying mode.

7. The method according to any one of claims 1 to 3, characterized in that, The operation processing of the tree structure data based on the tree structure operation mode includes: Sinking a data structure on a fifth leaf node in the tree structure to a child node of the fifth leaf node; and / or Extracting a common data structure on at least one child node of a sixth leaf node in the tree structure and ascending to the sixth leaf node.

8. The method according to any one of claims 1 to 3, characterized in that, The operation processing of the tree structure data based on the tree structure operation mode includes: Exporting the tree structure and information of the tree structure in a preset file format to obtain a corresponding data file; and / or Receiving an imported data file of the tree structure and generating the tree structure based on the data file; The information of the tree structure includes one or more of type information, structure information, and data information under each node of the tree structure.

9. The method according to any one of claims 1 to 3, characterized in that, The operation processing of the tree structure data based on the tree structure operation mode includes: Exporting the tree structure as a visual image to show data relationships in the tree structure.

10. A data processing apparatus, characterized by, The device is applied to a data processing system, the system storing tree structure data having a tree structure, the tree structure including at least one leaf layer, the leaf layer including at least one leaf node, the leaf layers at the same level being at the same hierarchical level of the tree structure data, data corresponding to the leaf nodes being key-value pair mapping structure data, the key-value pair mapping structure including key names and key values of keys, and the device including: A request receiving module configured to receive an externally input processing request for the tree structure data in the system; An operation mode determining module configured to determine a tree structure operation mode for the tree structure data based on the processing request; A data operation processing module configured to perform operation processing of the tree structure data based on the tree structure operation mode. A first service module is configured to receive service data uploaded by a first service system, perform tree-structured processing on the service data to obtain tree-structured service data corresponding to the service data, and store the tree-structured service data in the system as the tree-structured data. A second service module is configured to obtain an operation function in a second service system, perform tree-structured processing on the operation function so that the processed operation function can support tree-structured operation, and transform variables in the operation function into tree-structured variable data represented by the tree structure.

11. A computer device, comprising: The computer program is stored on the computer readable storage medium and is executed by the processor to perform the steps of the data processing method according to any one of claims 1 to 9. The computer program is stored on the computer readable storage medium and is executed by the processor to perform the steps of the data processing method according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that, ​

Images