Demand data processing method and device, computer equipment and storage medium

Abstract

The invention relates to a demand data processing method and device, computer equipment, a computer readable storage medium and a computer program product. The method comprises the following steps: acquiring target demand data, and determining target function information according to the target demand data; splitting the target function information to obtain a plurality of pieces of to-be-processed function information; wherein the to-be-processed function information is used for indicating a to-be-processed function of the server; obtaining configuration feature information of the server, and matching each piece of to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure; and according to the demand tree structure, distributing the to-be-processed function information to the corresponding servers so as to process the target demand data. By adopting the method, the required data processing efficiency under the condition of multi-system integration can be improved, and the data consistency of multiple servers can be improved.

Description

Technical Field

[0001] The present application relates to the field of computer application technology, and in particular to a demand data processing method, apparatus, computer equipment, storage medium and computer program product. Background Art

[0002] At present, traditional project management applications, such as Microsoft Project, can support functions such as project planning, task allocation, progress tracking and resource management, and can be used to manage relatively independent projects.

[0003] However, when dealing with large-scale system projects with multiple systems and high coupling, such traditional technologies often fail to meet the requirements. For example, the banking system involves many internal and external systems, and the corresponding project management process usually involves multiple application systems and business departments. Therefore, in the process of demand processing, the project management program is required to be able to handle complex dependencies and frequent cross-departmental coordination. However, for such usage scenarios, the relevant technologies are not comprehensive enough in processing demand data, resulting in low efficiency in demand data processing. Summary of the invention

[0004] Based on this, it is necessary to provide a demand data processing method, device, computer equipment, computer-readable storage medium and computer program product that can improve the efficiency of demand data processing in multi-system integration in response to the above technical problems.

[0005] In a first aspect, the present application provides a method for processing demand data, the method being applied to a data processing system, the data processing system comprising a plurality of service terminals having a functional association relationship; the method comprising:

[0006] Acquiring target demand data, and determining target function information according to the target demand data;

[0007] Splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server;

[0008] Acquire the configuration feature information of the server, and match each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure;

[0009] According to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

[0010] In one embodiment, matching each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure includes:

[0011] Classify each of the to-be-processed functional information according to the processing stage to obtain the sub-node function;

[0012] Determining the server that matches the function of each of the sub-nodes according to the configuration feature information;

[0013] The server is taken as a parent node, and the child node functions matching the server are taken as child nodes of the server to generate a demand tree structure.

[0014] In one embodiment, after distributing the to-be-processed function information to the corresponding server according to the demand tree structure, the method further includes:

[0015] Obtaining processing progress data sent by the server for processing each of the sub-node functions;

[0016] Update the processing status of each of the sub-node functions in the demand tree structure according to the processing progress data;

[0017] The processing status of the sub-node function is monitored, and a processing progress report is generated according to the processing status.

[0018] In one embodiment, monitoring the processing status of the sub-node function and generating a processing progress report according to the processing status includes:

[0019] Monitor the processing status of the subnode function in real time, and determine whether the current moment has reached the node update moment;

[0020] When the current moment reaches the node update moment, a new processing progress report is generated according to the processing status of each sub-node function in the demand tree structure at the current moment.

[0021] In one embodiment, after monitoring the processing status of the sub-node function and generating a processing progress report according to the processing status, the method further includes:

[0022] Sending the progress report of the current processing stage to the multiple service terminals to trigger the counter-signature review of the multiple service terminals;

[0023] In response to the audit instructions of the plurality of servers, when the audit instructions all indicate that the audit is passed, instruct the server to process the sub-node function of the next processing stage.

[0024] In one embodiment, before obtaining the target demand data, the method further includes:

[0025] Obtain initial demand information;

[0026] The natural language description in the initial demand information is converted into a mathematical logic description to obtain target demand data.

[0027] In a second aspect, the present application further provides a demand data processing device, the device is applied to a data processing system, the data processing system includes a plurality of service terminals having a functional association relationship; the device includes:

[0028] A data acquisition module, used to acquire target demand data and determine target function information according to the target demand data;

[0029] A function splitting module, used for splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used for indicating the to-be-processed function of the server;

[0030] A demand allocation module, used for acquiring the configuration feature information of the server, and matching each of the to-be-processed function information with the server according to the configuration feature information, so as to generate a demand tree structure;

[0031] The data processing module is used to distribute the to-be-processed function information to the corresponding service ends according to the demand tree structure, so as to process the target demand data.

[0032] In a third aspect, the present application further provides a computer device, including a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0033] Acquiring target demand data, and determining target function information according to the target demand data;

[0034] Splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server;

[0035] Acquire the configuration feature information of the server, and match each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure;

[0036] According to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

[0037] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the following steps are implemented:

[0038] Acquiring target demand data, and determining target function information according to the target demand data;

[0039] Splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server;

[0040] Acquire the configuration feature information of the server, and match each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure;

[0041] According to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

[0042] In a fifth aspect, the present application further provides a computer program product, including a computer program, which implements the following steps when executed by a processor:

[0043] Acquiring target demand data, and determining target function information according to the target demand data;

[0044] Splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server;

[0045] Acquire the configuration feature information of the server, and match each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure;

[0046] According to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

[0047] The above-mentioned demand data processing method, device, computer equipment, storage medium and computer program product are applied to a data processing system, and the data processing system includes multiple service terminals with functional association relationships. The above-mentioned method obtains target demand data and determines target function information according to the target demand data, thereby splitting the target function information to obtain a number of to-be-processed function information, and uses the to-be-processed function information to indicate the to-be-processed functions of the service terminal, so as to decompose the target demand data into specific functions, and then obtains the configuration feature information of the service terminal, and matches each to-be-processed function information with the service terminal according to the configuration feature information, so as to generate a demand tree structure, and can match each function to be processed with the corresponding service terminal, and comprehensively analyze the processing actions that each service terminal needs to make on the target demand data from the overall perspective, and finally distribute the to-be-processed function information to the corresponding service terminal according to the demand tree structure to process the target demand data, and fully considers the association and dependency between the demand data and multiple service terminals, so as to improve the comprehensiveness of demand data processing in the case of multi-system integration, thereby improving data processing efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related technologies, the drawings required for use in the embodiments or the related technical descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0049] Figure 1 An application environment diagram of a demand data processing method in an embodiment;

[0050] Figure 2 A schematic diagram of a flow chart of a method for processing demand data in one embodiment;

[0051] Figure 3 is a flow chart of a method for processing demand data in another embodiment;

[0052] Figure 4 is a structural block diagram of a demand data processing device in an embodiment;

[0053] Figure 5 is an internal structure diagram of a computer device in one embodiment;

[0054] Figure 6 FIG. 4 is a diagram showing the internal structure of a computer device in another embodiment. DETAILED DESCRIPTION

[0055] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0056] The demand data processing method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown. Among them, the terminal 102 communicates with the server 104 through the network. The terminal 102 can be used to obtain target demand data and send the target demand data to the server 104 of each service end. It can also be used to receive the processing progress report obtained by the server 104 analysis and display the processing progress report. The data storage system can store the data that the server 104 needs to process. The data storage system can be integrated on the server 104, or it can be placed on the cloud or other network servers. The data storage system can be used to store preset data information such as configuration feature information, and can also be used to store information such as the processing progress report generated by the server 104 analysis. Among them, the terminal 102 can be, but is not limited to, various personal computers, laptops, smart phones, tablet computers, Internet of Things devices and portable wearable devices. The Internet of Things devices can be smart speakers, smart TVs, smart air conditioners, smart car-mounted devices, etc. Portable wearable devices can be smart watches, smart bracelets, head-mounted devices, etc. The server 104 can be implemented with an independent server or a server cluster consisting of multiple servers. Exemplarily, in an embodiment of the present application, server 104 may be a server of one or more server ends in a data processing system, or may be a server independent of each server end in a target system, wherein the data processing system includes multiple server ends having a functional association relationship.

[0057] In an exemplary embodiment, Figure 2 As shown, a method for processing demand data is provided. The method is applied to a server, and the server is recorded as a target server. The data processing system includes a target server and multiple associated servers that have functional associations with the target server. In this embodiment, the method is applied to Figure 1 The example of the server 104 in FIG. 1 and the server 104 deployed on the target server is used for explanation, and the method includes the following steps S202 to S208. Among them:

[0058] Step S202, obtaining target demand data, and determining target function information according to the target demand data.

[0059] The target demand data may be input by the demand proposer of the target server through the terminal 102, or may be automatically generated by other servers through monitoring the currently developed or iterated application and then sent to the target server.

[0060] Exemplarily, the server 104 may first obtain initial demand information from the terminal 102 , convert the natural language description in the initial demand information into a mathematical logic description to obtain target demand data, and determine the target function information according to the target demand data.

[0061] Furthermore, the demander can directly input the initial demand information through the terminal 102, and the initial demand can be provided in the form of natural language description, such as "the banking system needs to add a user identity authentication function". After obtaining the initial demand information, the server 104 can convert the natural language description into a more structured mathematical logic description. For example, "adding a user identity authentication function" is converted into a set of specific logical rules or conditions, and finally a clear target demand data is obtained.

[0062] The target function information is a function requirement extracted from the target requirement data, which is used for the specific function that the system needs to realize. For example, the server 104 can extract features that can characterize the corresponding function points according to one or more logical languages ​​in the target requirement data, and confirm the corresponding target function information by accessing the functional component database.

[0063] Step S204, split the target function information to obtain a plurality of function information to be processed.

[0064] The pending function information is used to indicate the pending functions of the server.

[0065] Exemplarily, the server 104 may further decompose the above target function information. The decomposition process breaks down the target function information into multiple small, processable units, namely "to-be-processed function information". These to-be-processed function information will exist in the form of specific tasks, and each task represents a function or operation that needs to be completed by the server. For example, if the function indicated by the target function information is "enhancing the identity authentication mechanism of the banking system", the decomposed to-be-processed functions may include: the development of a user information verification module; the writing of identity authentication logic; and the interface docking with an external authentication system, etc.

[0066] Step S206, obtaining configuration feature information of the server, and matching each to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure.

[0067] Exemplarily, the server 104 can match the function information to be processed according to the configuration feature information of the server, including evaluating the technical requirements of each function to be processed, and determining which tasks to assign to which server according to the resource status and load of each server. The configuration feature information of the server includes business scope, hardware resources, software environment, processing capacity, etc. The server 104 will determine the corresponding server to perform each task based on this information. Next, the server 104 can generate a demand tree structure based on the matching results.

[0068] The demand tree structure is used to show the relationship between the function information to be processed and the corresponding server in the form of a tree diagram, and to clarify the execution order and dependencies of each task, to ensure that the dependencies of the tasks are handled reasonably, and to provide clear guidance for the subsequent task distribution. Each node in the demand tree structure represents a specific function information to be processed, and the edge represents the relationship between the function information to be processed and the server.

[0069] Exemplarily, the server 104 may classify each piece of function information to be processed according to the processing stage to obtain sub-node functions; determine the server that matches each sub-node function based on the configuration feature information; take the server as the parent node, and the sub-node functions that match the server as the child nodes of the server, to generate a demand tree structure.

[0070] Furthermore, in the process of generating the demand tree structure, the server 104 can classify each to-be-processed functional information according to the processing stage, and group the functional information according to the execution sequence or different processing logics. For example, some functions may need to be analyzed and reviewed first, then designed and developed, and finally tested and deployed. The server 104 can divide each to-be-processed functional information into different sub-node functions according to these processing stages, and these sub-node functions represent the specific execution steps or functional modules of the corresponding tasks at different stages.

[0071] Next, the server 104 can determine which sub-node functions can match which servers one by one according to the configuration feature information of the server. The configuration feature information of the server may include parameters such as its business scope, processing capacity, supported technology stack, resource load, etc. The server 104 can use the server as a parent node, and use the sub-node functions that match the server as the child nodes of the server, and finally construct a demand tree structure. In the demand tree structure, the server is the upper node of the tree, and each child node function represents a specific task or functional module, which belongs to the scope of execution of the server. For example, if a server is responsible for processing the "authentication logic writing" task in the "user identity authentication" function, then in the demand tree structure, the server will be the parent node, and all child nodes related to it (such as "authentication logic design" and "logic implementation") will be the child nodes of the server. The demand tree structure can clearly show the responsibility allocation of each task and facilitate the subsequent task execution and coordination.

[0072] Step S208, according to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

[0073] Exemplarily, the server 104 may distribute the function information to be processed, i.e., the tasks, to different servers and the task execution modules corresponding to the target servers in the order determined by the demand tree structure, so as to process the function information to be processed.

[0074] Furthermore, after receiving the assigned task, each service end or functional module starts to perform specific operations and can feed back the execution results to the server 104. The server 104 determines whether the task has been completed correctly based on the feedback, and decides whether to continue to process the next task or adjust the task allocation based on the demand tree structure. For example, the server 104 can also monitor the actual execution of the task in real time to ensure that the task is completed within the preset time, and can also adjust the processing plan in time after discovering problems.

[0075] The above-mentioned demand data processing method is applied to a data processing system, and the data processing system includes multiple service terminals with functional association relationships. The above-mentioned method obtains target demand data and determines target function information according to the target demand data, thereby splitting the target function information to obtain a number of to-be-processed function information, and uses the to-be-processed function information to indicate the to-be-processed functions of the service terminal, so as to decompose the target demand data into specific functions, and then obtains the configuration feature information of the service terminal, and matches each to-be-processed function information with the service terminal according to the configuration feature information, so as to generate a demand tree structure, and can match each function to be processed with the corresponding service terminal, and comprehensively analyze the processing actions that each service terminal needs to make on the target demand data from the overall perspective, and finally distribute the to-be-processed function information to the corresponding service terminal according to the demand tree structure to process the target demand data, and fully considers the association and dependency between the demand data and multiple service terminals, so as to improve the comprehensiveness of demand data processing in the case of multi-system integration, thereby improving data processing efficiency and ensuring the coordination and consistency of all related service terminal data.

[0076] In an exemplary embodiment, Figure 3 As shown, after distributing the to-be-processed function information to the corresponding server according to the demand tree structure in step S206, steps S302 to S306 may also be included. Among them:

[0077] Step S302, obtaining the processing progress data of each sub-node function sent by the server.

[0078] Exemplarily, the server 104 can obtain the processing progress data sent by the service end. Each service end generates and sends the processing progress data when processing the sub-node function assigned to it. The processing progress data can include the execution status information of the task, the processing progress data, the problem data, the completed work information and the possible error information, etc. The processing progress data of the service end can reflect the actual processing situation of each sub-node function, including the current progress and any possible delay or problem. The server 104 can collect these process data from each service end periodically or in real time to ensure that the latest progress of each task is mastered.

[0079] Step S304: updating the processing status of each sub-node function in the demand tree structure according to the processing progress data.

[0080] Exemplarily, the server 104 can update the processing status of each sub-node function in the demand tree structure according to the processing progress data obtained from the server. Each sub-node function corresponds to a processing status in the demand tree, and the processing status can be divided into different states such as "not started", "in progress", "completed" or "encountered a problem". The server 104 can adjust the status of each sub-node in the demand tree according to the processing progress data sent by the server. For example, if a task has been completed, the server 104 can update the status of the sub-node to "completed"; if a task is delayed or has a problem, the status will be updated to "encountered a problem" or "processing". The update process can help project managers to grasp the progress of each functional task in real time and ensure that all tasks are carried out according to the predetermined plan.

[0081] After updating the demand tree structure, the server 104 can continuously monitor the processing status of each sub-node function. This monitoring process is dynamic. The server 104 can not only track the status changes of each sub-node function, but also identify possible risks or delays in real time. When the server 104 finds that the processing status of a sub-node is abnormal or delayed, it can take corresponding measures, such as reallocating tasks, adjusting the server load, or notifying relevant departments to intervene, so as to timely discover and solve problems and avoid delays or omissions of tasks.

[0082] Step S306, monitoring the processing status of the sub-node function, and generating a processing progress report according to the processing status.

[0083] For example, the server 104 can generate a processing progress report based on the processing status of the monitored sub-node functions, including the current status of each sub-node function, the amount of work completed, the remaining tasks, a detailed description of any delays or problems, and processing suggestions. The processing progress report not only provides comprehensive progress information for project managers, but also serves as a basis for project evaluation and decision-making, further improving the data consistency of the multi-server system. Furthermore, the server 104 can generate the processing progress report periodically according to demand so that all parties can understand the overall progress and status of the project in a timely manner.

[0084] Exemplarily, the server 104 can monitor the processing status of the sub-node function in real time, and determine whether the current moment has reached the node update time; when the current moment has reached the node update time, a new processing progress report is generated according to the processing status of each sub-node function in the demand tree structure at the current moment. Further, when the current moment has not reached the node update time, the server 104 can continue to monitor in real time and keep continuous tracking of the processing status of each sub-node function. Further, the server 104 can monitor the processing status of each sub-node function in real time during the processing of the task, and periodically check the status of each sub-node, including whether the task is carried out smoothly, whether there is a delay or error, and whether the processing strategy needs to be adjusted. In this process, the server 104 can also determine whether the current moment has reached the node update moment.

[0085] Among them, the node update time refers to a specific time point set by the server 104, which is used to evaluate and update the processing status of each child node in the demand tree structure. The node update time can be determined based on a predetermined time interval or the execution progress of the task. For example, the server 104 may perform node updates at intervals and when a certain proportion of tasks are completed. Exemplarily, if it is determined that the current time has reached the node update time, the server 104 can generate a new processing progress report based on the current processing status of each child node function in the demand tree structure, which is used to describe the status of each child node, including which tasks have been completed, which tasks are in progress, whether there are delays or problems, and the estimated completion time. For example, if the processing progress of a child node function is delayed, the processing progress report will be clearly marked in the report, and optimization suggestions or adjustment measures may be proposed. If all tasks are carried out as planned, the report will show the successful completion of the task and the next step plan. Through periodic updates, the server 104 ensures the transparency of the entire task processing process and provides accurate data support for the decision-making layer, thereby promoting the project to be completed on time and efficiently.

[0086] Furthermore, during the task processing, the processing progress report generated by the server 104 can be a combination of graphics and data to ensure that all parties can clearly and intuitively understand the progress and status of the task, and the content of the processing progress report can be presented in the form of a Gantt chart, a flowchart or a demand tree diagram. The Gantt chart can show the start time, end time and progress percentage of each sub-node function, and the progress of the task is represented by the length and color of the bar chart, for example, green means completed, yellow means in progress, and red means there are problems, etc.; the flowchart or demand tree diagram presents the dependency relationship of the task in a tree structure, for example, the parent node represents the task of the previous stage, the child node represents the task of the current stage, and the current status of the task is indicated next to the node, such as "completed" or "processing". The progress bar or status indicator can further reflect the degree of completion of each task through the depth of color and the length of the bar to ensure that the processing progress of the task is clear at a glance.

[0087] In addition to graphical presentations, processing reports can also include detailed text descriptions. The report can list an overview of the progress of each task, including the start time, current progress, estimated completion time, and actual completion time of the task. In addition, the report can also describe the current processing status in detail, such as "processing" or "paused", and indicate whether there are any problems or delays. For example, if a task is delayed, the report can clearly indicate the reason for the delay and the solution.

[0088] In order to ensure that the real-time progress of the task is accurately reflected, the processing progress report can also be dynamically updated. Each time a node is updated, the server 104 will generate the latest report and automatically update the graphics and data in the report to reflect the latest status of the task.

[0089] Exemplarily, after step S306, server 104 may also send a progress report of the current processing stage to multiple server ends to trigger joint review by multiple server ends; in response to the review instructions of multiple server ends, when the review instructions all indicate that the review is passed, instruct the server end to process the sub-node function of the next processing stage.

[0090] Furthermore, during the task processing, the server 104 can not only generate a processing progress report, but also send the report to multiple servers according to the progress of the current processing stage, and trigger the joint review between multiple servers while visualizing the processing process. Joint review is a mechanism to ensure that the task processing meets the standards and the compliance is verified. In large and complex projects, especially when tasks involve multiple departments or systems, each processing stage often requires multiple servers to participate in confirmation and approval, thereby helping to ensure that each task has been reviewed by multiple parties before entering the next stage, avoiding possible misjudgment or omissions by a single server. The server 104 can send the processing progress report of the current stage to multiple related servers, and the report includes key information such as the processing status of each sub-node function, the work completed, the difficulties encountered, and the processing progress. Each server will review the report according to its own responsibilities and business areas to ensure that all processing processes meet the predetermined requirements and standards.

[0091] After receiving the progress report, multiple servers can give feedback according to their respective audit standards. Each server issues an audit instruction based on its own review results, indicating whether it agrees to enter the next processing stage. The audit instruction can include two possible results: "audit passed" or "audit failed". If all servers participating in the audit unanimously pass the audit, server 104 will receive all audit passed instructions, confirming that the current processing stage has been successfully completed and meets the expected standards. At this time, server 104 will decide whether to continue to perform subsequent tasks based on the results of all audit instructions.

[0092] When all audit instructions indicate "audit passed", server 104 can instruct the service end to enter the next processing stage and start processing the next sub-node function. This means that the task has completed the processing of the current stage and passed the multi-party verification, and can continue to move forward and enter the next task stage. Through this multi-party review and countersignature mechanism, it is ensured that the processing of each link is strictly checked and confirmed, reducing the risk of errors or omissions.

[0093] If a service fails the audit during the audit process, the server 104 receives a "failed audit" feedback. In this case, the server 104 can suspend the operation of entering the next stage and analyze and adjust according to the specific problems in the feedback. This may involve re-examining the function implementation, adjusting the processing logic, modifying the configuration, etc., to ensure that the problem is resolved before continuing to advance the task.

[0094] In another exemplary embodiment, the server 104 obtains the initial demand information, converts the natural language description in the initial demand information into a mathematical logic description, and obtains the target demand data. Next, the server 104 obtains the target demand data, determines the target function information according to the target demand data, and splits the target function information to obtain a plurality of function information to be processed.

[0095] Subsequently, server 104 obtains the configuration feature information of the server, classifies each piece of function information to be processed according to the processing stage, obtains the sub-node function, and determines the server that matches each sub-node function based on the configuration feature information. The server is used as the parent node, and the sub-node functions that match the server are used as the child nodes of the server to generate a demand tree structure.

[0096] Next, the server 104 distributes the function information to be processed to the corresponding server according to the demand tree structure to process the target demand data, and obtains the processing process data for processing each sub-node function sent by the server, updates the processing status of each sub-node function in the demand tree structure according to the processing process data, monitors the processing status of the sub-node function in real time, and determines whether the current moment has reached the node update moment, and generates a new processing process report according to the processing status of each sub-node function in the demand tree structure at the current moment when the node update moment has arrived. Send the process report of the current processing stage to multiple servers to trigger the joint review of multiple servers. Finally, the server 104 responds to the review instructions of multiple servers, and instructs the server to process the sub-node function of the next processing stage when the review instructions all indicate that the review is passed.

[0097] It should be understood that, although the various steps in the flowcharts involved in the above-mentioned embodiments are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and these steps can be executed in other orders. Moreover, at least a part of the steps in the flowcharts involved in the above-mentioned embodiments can include multiple steps or multiple stages, and these steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a part of the steps or stages in other steps.

[0098] Based on the same inventive concept, the embodiment of the present application also provides a demand data processing device for implementing the demand data processing method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more demand data processing device embodiments provided below can refer to the limitations of the demand data processing method above, and will not be repeated here.

[0099] In an exemplary embodiment, Figure 4 As shown, a demand data processing device is provided, which is applied to a data processing system, and the data processing system includes a plurality of service ends with functional association relationships; including: a data acquisition module 402, a function splitting module 404, a demand allocation module 406 and a data processing module 408, wherein:

[0100] The data acquisition module 402 is used to acquire target demand data and determine target function information according to the target demand data;

[0101] The function splitting module 404 is used to split the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server;

[0102] The demand allocation module 406 is used to obtain the configuration feature information of the server and match each to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure;

[0103] The data processing module 408 is used to distribute the function information to be processed to the corresponding server ends according to the demand tree structure to process the target demand data.

[0104] In one embodiment, the demand allocation module 406 includes:

[0105] A classification unit, used to classify each function information to be processed according to the processing stage to obtain the sub-node function;

[0106] A matching unit, used to determine a server matching the function of each sub-node according to the configuration feature information;

[0107] The generation unit is used to take the server as a parent node and the child node function matching the server as the child node of the server to generate a demand tree structure.

[0108] In one embodiment, the data processing module 408 includes:

[0109] A process acquisition unit, used to acquire processing process data sent by the server for processing functions of each sub-node;

[0110] A status updating unit, used to update the processing status of each sub-node function in the demand tree structure according to the processing progress data;

[0111] The process monitoring unit is used to monitor the processing status of the sub-node function and generate a processing progress report according to the processing status.

[0112] In one of the embodiments, the process monitoring unit is specifically used to: monitor the processing status of the sub-node functions in real time, and determine whether the current moment has reached the node update time; when the current moment has reached the node update time, generate a new processing process report based on the processing status of each sub-node function in the demand tree structure at the current moment.

[0113] In one of the embodiments, the process monitoring unit is also used to: send a process report of the current processing stage to multiple server ends to trigger a joint review by multiple server ends; and respond to review instructions from multiple server ends, and when the review instructions all indicate that the review is passed, instruct the server end to process the sub-node function of the next processing stage.

[0114] In one embodiment, the data acquisition module 402 is further used to: acquire initial demand information; convert the natural language description in the initial demand information into a mathematical logic description to obtain target demand data.

[0115] Each module in the above-mentioned demand data processing device can be implemented in whole or in part by software, hardware or a combination thereof. Each module can be embedded in or independent of a processor in a computer device in the form of hardware, or can be stored in a memory in a computer device in the form of software, so that the processor can call and execute the operations corresponding to each module above.

[0116] In an exemplary embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as shown in FIG. Figure 5As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, referred to as I / O) and a communication interface. Among them, the processor, the memory and the input / output interface are connected through a system bus, and the communication interface is connected to the system bus through the input / output interface. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store preset data information such as configuration feature information, and can also be used to store information such as a processing progress report generated by the server 104 for analysis. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a method for processing demand data is implemented.

[0117] In an exemplary embodiment, a computer device is provided. The computer device may be a terminal, and its internal structure diagram may be as shown in FIG. Figure 6 As shown. The computer device includes a processor, a memory, an input / output interface, a communication interface, a display unit and an input device. The processor, the memory and the input / output interface are connected through a system bus, and the communication interface, the display unit and the input device are connected to the system bus through the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be realized through WIFI, a mobile cellular network, NFC (near field communication) or other technologies. When the computer program is executed by the processor, a method for processing demand data is realized. The display unit of the computer device is used to form a visually visible picture, which can be a display screen, a projection device or a virtual reality imaging device. The display screen can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, trackball or touchpad set on the computer device shell, or an external keyboard, touchpad or mouse.

[0118] Those skilled in the art will understand that Figure 6The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0119] In an exemplary embodiment, a computer device is provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the following steps when executing the computer program: obtaining target demand data, and determining target function information based on the target demand data; splitting the target function information to obtain a plurality of function information to be processed; wherein the function information to be processed is used to indicate the function to be processed of the server; obtaining configuration feature information of the server, and matching each function information to be processed with the server based on the configuration feature information to generate a demand tree structure; and distributing the function information to be processed to corresponding servers respectively according to the demand tree structure to process the target demand data.

[0120] In one embodiment, when the processor executes the computer program, the following steps are also implemented: each piece of function information to be processed is classified according to the processing stage to obtain the sub-node function; based on the configuration feature information, a server matching each sub-node function is determined; the server is used as the parent node, and the sub-node functions matching the server are used as the sub-nodes of the server to generate a demand tree structure.

[0121] In one embodiment, when the processor executes the computer program, the following steps are also implemented: obtaining processing progress data for processing each sub-node function sent by the server; updating the processing status of each sub-node function in the demand tree structure according to the processing progress data; monitoring the processing status of the sub-node function, and generating a processing progress report according to the processing status.

[0122] In one embodiment, when the processor executes the computer program, it also implements the following steps: real-time monitoring of the processing status of the sub-node functions, and determining whether the current moment has reached the node update moment; when the current moment has reached the node update moment, generating a new processing progress report based on the processing status of each sub-node function in the demand tree structure at the current moment.

[0123] In one embodiment, when the processor executes the computer program, the following steps are also implemented: a process report of the current processing stage is sent to multiple server ends to trigger a joint review by multiple server ends; in response to the review instructions of multiple server ends, when the review instructions all indicate that the review is passed, the server end is instructed to process the sub-node function of the next processing stage.

[0124] In one embodiment, when the processor executes the computer program, the following steps are also implemented: obtaining initial demand information; converting the natural language description in the initial demand information into a mathematical logic description to obtain target demand data.

[0125] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored. When the computer program is executed by a processor, the following steps are implemented: obtaining target demand data, and determining target function information based on the target demand data; splitting the target function information to obtain a plurality of function information to be processed; wherein the function information to be processed is used to indicate the function to be processed of the server; obtaining configuration feature information of the server, and matching each function information to be processed with the server based on the configuration feature information to generate a demand tree structure; and distributing the function information to be processed to corresponding servers respectively according to the demand tree structure to process the target demand data.

[0126] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: each piece of function information to be processed is classified according to the processing stage to obtain the sub-node function; based on the configuration feature information, a server matching each sub-node function is determined; the server is used as the parent node, and the sub-node functions matching the server are used as the sub-nodes of the server to generate a demand tree structure.

[0127] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining processing progress data for processing each sub-node function sent by the server; updating the processing status of each sub-node function in the demand tree structure according to the processing progress data; monitoring the processing status of the sub-node function, and generating a processing progress report according to the processing status.

[0128] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: real-time monitoring of the processing status of the sub-node functions, and determining whether the current moment has reached the node update moment; when the current moment has reached the node update moment, generating a new processing progress report based on the processing status of each sub-node function in the demand tree structure at the current moment.

[0129] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: a process report of the current processing stage is sent to multiple server ends to trigger a joint review by multiple server ends; in response to the review instructions of multiple server ends, when the review instructions all indicate that the review is passed, the server end is instructed to process the sub-node function of the next processing stage.

[0130] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining initial demand information; converting the natural language description in the initial demand information into a mathematical logic description to obtain target demand data.

[0131] In one embodiment, a computer program product is provided, including a computer program, which implements the following steps when executed by a processor: obtaining target demand data, and determining target function information based on the target demand data; splitting the target function information to obtain a plurality of function information to be processed; wherein the function information to be processed is used to indicate the function to be processed of the server; obtaining configuration feature information of the server, and matching each function information to be processed with the server based on the configuration feature information to generate a demand tree structure; and distributing the function information to be processed to corresponding servers respectively according to the demand tree structure to process the target demand data.

[0132] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: each piece of function information to be processed is classified according to the processing stage to obtain the sub-node function; based on the configuration feature information, a server matching each sub-node function is determined; the server is used as the parent node, and the sub-node functions matching the server are used as the sub-nodes of the server to generate a demand tree structure.

[0133] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining processing progress data for processing each sub-node function sent by the server; updating the processing status of each sub-node function in the demand tree structure according to the processing progress data; monitoring the processing status of the sub-node function, and generating a processing progress report according to the processing status.

[0134] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: real-time monitoring of the processing status of the sub-node functions, and determining whether the current moment has reached the node update moment; when the current moment has reached the node update moment, generating a new processing progress report based on the processing status of each sub-node function in the demand tree structure at the current moment.

[0135] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: a process report of the current processing stage is sent to multiple server ends to trigger a joint review by multiple server ends; in response to the review instructions of multiple server ends, when the review instructions all indicate that the review is passed, the server end is instructed to process the sub-node function of the next processing stage.

[0136] In one embodiment, when the computer program is executed by the processor, the following steps are also implemented: obtaining initial demand information; converting the natural language description in the initial demand information into a mathematical logic description to obtain target demand data.

[0137] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0138] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM). The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. Non-relational databases may include distributed databases based on blockchains, etc., but are not limited to this. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but are not limited to this.

[0139] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0140] The above-described embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the present application. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the attached claims.

Claims

1. A method for processing demand data, characterized in that: The method is applied to a data processing system, wherein the data processing system includes a plurality of service terminals having a functional association relationship; the method includes: Acquiring target demand data, and determining target function information according to the target demand data; Splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used to indicate the to-be-processed function of the server; Acquire the configuration feature information of the server, and match each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure; According to the demand tree structure, the function information to be processed is distributed to the corresponding server ends respectively to process the target demand data.

2. The method according to claim 1, characterized in that The matching each of the to-be-processed function information with the server according to the configuration feature information to generate a demand tree structure includes: Classify each of the to-be-processed functional information according to the processing stage to obtain the sub-node function; Determining the server that matches the function of each of the sub-nodes according to the configuration feature information; The server is taken as a parent node, and the child node functions matching the server are taken as child nodes of the server to generate a demand tree structure.

3. The method according to claim 2, characterized in that After distributing the to-be-processed function information to the corresponding server according to the demand tree structure, the method further includes: Obtaining processing progress data sent by the server for processing each of the sub-node functions; Update the processing status of each of the sub-node functions in the demand tree structure according to the processing progress data; The processing status of the sub-node function is monitored, and a processing progress report is generated according to the processing status.

4. The method according to claim 3, characterized in that The monitoring the processing status of the sub-node function and generating a processing progress report according to the processing status includes: Monitor the processing status of the subnode function in real time, and determine whether the current moment has reached the node update moment; When the current moment reaches the node update moment, a new processing progress report is generated according to the processing status of each sub-node function in the demand tree structure at the current moment.

5. The method according to claim 3, characterized in that: After monitoring the processing status of the sub-node function and generating a processing progress report according to the processing status, the method further includes: Sending the progress report of the current processing stage to the multiple service terminals to trigger the counter-signature review of the multiple service terminals; In response to the audit instructions of the plurality of servers, when the audit instructions all indicate that the audit is passed, instruct the server to process the sub-node function of the next processing stage.

6. The method according to any one of claims 1 to 5, characterized in that: Before obtaining the target demand data, the method further includes: Obtain initial demand information; The natural language description in the initial demand information is converted into a mathematical logic description to obtain target demand data.

7. A demand data processing device, characterized in that: The device is applied to a data processing system, wherein the data processing system includes a plurality of service terminals having a functional association relationship; the device includes: A data acquisition module, used to acquire target demand data and determine target function information according to the target demand data; A function splitting module, used for splitting the target function information to obtain a plurality of to-be-processed function information; wherein the to-be-processed function information is used for indicating the to-be-processed function of the server; A demand allocation module, used for acquiring the configuration feature information of the server, and matching each of the to-be-processed function information with the server according to the configuration feature information, so as to generate a demand tree structure; The data processing module is used to distribute the to-be-processed function information to the corresponding service ends according to the demand tree structure, so as to process the target demand data.

8. A computer device comprising a memory and a processor, wherein the memory stores a computer program, wherein: When the processor executes the computer program, the steps of the method according to any one of claims 1 to 6 are implemented.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.

Images