Business dynamic change method, device, computer equipment and storage medium

Abstract

The present application relates to a method, apparatus, computer equipment, storage medium and computer program product for dynamic business changes. The method comprises: obtaining a first business sequence, a historical business sequence, and the business status of each element in the historical business sequence; when there is an element with a completed business status in the historical business sequence, taking the element with a completed business status as the first element, and querying the first business sequence based on the first element; when the first element does not exist in the first business sequence, adding the first element to the first business sequence to obtain a second business sequence; obtaining the arrangement order of multiple elements with an unfinished business status in the second business sequence as the business execution order. This method can store elements that have completed business execution together with the updated sequence, which can reduce the computer resources consumed during the sequence update process.

Description

Technical Field

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

[0002] When configuring a business in a business scenario, when the business node sequence is updated (node order, new nodes are added, nodes are deleted) to generate a new sequence, it is necessary to reasonably adjust the node sequence (old sequence) of the ongoing business according to the updated sequence of the business node to complete the update of the business node sequence.

[0003] In traditional technologies, the node sequence to be changed is usually discarded directly, and a new sequence is re-established for business processing after the business change.

[0004] However, in traditional technologies, events that have been processed in the old sequence are not compatible with the new sequence. The old and new sequences are completely independent of each other. With the advent of the big data era, a large amount of computing and storage resources are easily wasted. Summary of the Invention

[0005] Based on this, it is necessary to provide a method, device, computer equipment, computer-readable storage medium and computer program product for dynamically changing business operations that can reduce computing and storage resources in order to address the above technical issues.

[0006] In a first aspect, the present application provides a method for dynamically changing a service. The method comprises:

[0007] Obtaining the first business sequence, the historical business sequence, and the business status of each element in the historical business sequence;

[0008] When there is an element with a completed business status in the historical business sequence, the element with the completed business status is used as the first element, and the first business sequence is queried based on the first element; when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence;

[0009] The arrangement order of the multiple elements in the second service sequence with the service status being unfinished is obtained as the service execution order.

[0010] In one embodiment, when the first element does not exist in the first service sequence, adding the first element to the first service sequence to obtain a second service sequence includes:

[0011] When there is an adjacent second element before the first element, obtaining the adjacent previous second element of the first element in the historical service sequence; wherein the second element belongs to the intersection of the historical service sequence and the first service sequence;

[0012] Based on a second element immediately preceding the first element, the first element is merged into the first service sequence to obtain a second service sequence.

[0013] In one embodiment, when the first element does not exist in the first service sequence, adding the first element to the first service sequence to obtain a second service sequence includes:

[0014] When there is no adjacent second element before the first element, the first element is added to the first element of the first service sequence to obtain a second service sequence; wherein the second element belongs to the intersection of the historical service sequence and the first service sequence.

[0015] In one embodiment, querying the first service sequence based on the first element includes:

[0016] Obtaining a node sequence of the first service sequence, traversing the first service sequence using the plurality of first elements according to the node sequence, and determining a relationship between the first elements and the first service sequence;

[0017] The relationship between the first element and the first service sequence includes: the first element does not exist in the first service sequence, and the first element exists in the first service sequence.

[0018] In one embodiment, when the first element exists in the historical service sequence, the method further includes:

[0019] Acquire multiple third elements in the historical business sequence; wherein the third elements are elements whose business status is not completed;

[0020] querying the first service sequence based on multiple third elements;

[0021] When the third element does not exist in the first service sequence, the third element is deleted.

[0022] In one embodiment, the method further includes:

[0023] When the first element does not exist in the historical service sequence, the first service sequence is used as the second service sequence.

[0024] In a second aspect, the present application further provides a device for dynamically changing services. The device comprises:

[0025] A data acquisition module is used to acquire the first business sequence, the historical business sequence, and the business status of each element in the historical business sequence;

[0026] a second service sequence determination module configured to, when an element with a completed service status exists in the historical service sequence, use the element with the completed service status as the first element and query the first service sequence based on the first element; and, when the first element does not exist in the first service sequence, add the first element to the first service sequence to obtain a second service sequence;

[0027] The service execution sequence determining module is configured to obtain the arrangement order of multiple elements in the second service sequence whose service status is unfinished as the service execution sequence.

[0028] In a third aspect, the present application further provides a computer device comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the steps of the method described in any one of the above embodiments when executing the computer program.

[0029] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method described in any of the above embodiments.

[0030] In a fifth aspect, the present application further provides a computer program product, which includes a computer program that implements the steps of the method described in any of the above embodiments when executed by a processor.

[0031] The above-mentioned method, apparatus, computer equipment, storage medium and computer program product for dynamic business change first obtain a first business sequence, a historical business sequence, and the business status of each element in the historical business sequence. Then, when there is an element with a completed business status in the historical business sequence, the element with a completed business status is used as the first element, and the first business sequence is queried based on the first element; when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence. Further, the arrangement order of multiple elements with an unfinished business status in the second business sequence is obtained as the business execution order. By querying the business status of each element in the historical business sequence, the elements with a completed business status are merged into the first business sequence to obtain a second business sequence, and then the business execution is performed on the elements with an uncompleted business status in the second business sequence. This can record and save the historical business execution history, and can also store the elements that have completed business execution together with the updated sequence, which can reduce the storage space consumed during the sequence update process. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] Figure 1 This is an application environment diagram of a method for dynamically changing services in one embodiment;

[0033] Figure 2 1 is a flow chart of a method for dynamically changing services in one embodiment;

[0034] Figure 3 is a structural block diagram of a device for dynamically changing services in one embodiment;

[0035] Figure 4 FIG. 1 is a diagram showing the internal structure of a computer device in one embodiment. DETAILED DESCRIPTION

[0036] In order to make the purpose, technical solutions and advantages of this application more clear, the following further describes this application in detail with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain this application and are not intended to limit this application.

[0037] The service dynamic change method provided in the embodiment of the present application can be applied to Figure 1 In the application environment shown, the service publishing terminal 102 communicates with the server 104 via a network. The data storage system can store the data that the service publishing terminal 104 needs to process. The data storage system can be integrated on the server 104, or placed on the cloud or other network servers. The server 104 communicates and interacts with the service publishing terminal 102, thereby entering an environment where the business is dynamically changing. First, the server 104 can obtain a first business sequence from the service publishing terminal 102, obtain a historical business sequence from the database, and the business status of each element in the historical business sequence. Then, when there is an element with a completed business status in the historical business sequence, the server 104 can use the element with a completed business status as the first element and query the first business sequence based on the first element. Further, when the first element does not exist in the first business sequence, the server 104 can add the first element to the first business sequence to obtain a second business sequence. Finally, the server 104 can obtain the arrangement order of multiple elements with an uncompleted business status in the second business sequence as the business execution order. The service publishing end 102 may be, but is not limited to, various personal computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices may include smart speakers, smart TVs, smart air conditioners, and smart car devices. Portable wearable devices may include smart watches, smart bracelets, and head-mounted devices. The server end 104 may be implemented as a standalone server or a server cluster consisting of multiple servers.

[0038] In one embodiment, Figure 2 As shown, a method for dynamic business change is provided, which is described by taking the method applied to a single-side implementation on the server as an example, including the following steps 202 to 206.

[0039] Step 202: Acquire the first service sequence, the historical service sequence, and the service status of each element in the historical service sequence.

[0040] In this embodiment, the service status of each element in the historical service sequence may include but is not limited to: completed, uncompleted, wherein the service status of completed means that the service has not started or is being executed.

[0041] In this embodiment, the number and order of elements in the historical service sequence are independent of the number and order of elements in the first service sequence.

[0042] In this embodiment, the service status of each element in the first service sequence is incomplete.

[0043] Step 204: When there is an element with a completed business status in the historical business sequence, the element with a completed business status is used as the first element, and the first business sequence is queried based on the first element; when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence.

[0044] In this embodiment, when the first element does not exist in the first service sequence, the server can obtain the position of the first element in the historical service sequence and, based on the position of the first element in the historical service sequence and the positions of each element in the first service sequence, determine the position at which the first element is added to the first service sequence. Furthermore, based on the position, the first element is added to the first service sequence to obtain a second service sequence.

[0045] Step 206: Obtain the arrangement order of multiple elements with unfinished business status in the second business sequence as the business execution order.

[0046] In this embodiment, the service statuses of the multiple elements in the second service sequence may include but are not limited to: completed and uncompleted.

[0047] In this embodiment, the server no longer executes services for multiple elements in the second service sequence whose service status is completed, thereby avoiding repeated execution of the same service and reducing resource waste during service execution.

[0048] In this embodiment, the server executes services on multiple elements in the second service sequence whose service status is unfinished, and the order of service execution is consistent with the order of the second service sequence.

[0049] In the above-mentioned method for dynamic business change, first, the first business sequence, the historical business sequence, and the business status of each element in the historical business sequence are obtained. Then, when there is an element with a completed business status in the historical business sequence, the element with a completed business status is used as the first element, and the first business sequence is queried based on the first element; when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence. Further, the arrangement order of multiple elements with unfinished business status in the second business sequence is obtained as the business execution order. By querying the business status of each element in the historical business sequence, merging the elements with a completed business status into the first business sequence to obtain the second business sequence, and then executing the business on the elements with an uncompleted business status in the second business sequence, the historical business execution history can be recorded and saved, and the elements that have completed business execution can also be stored together with the updated sequence, which can reduce the storage space consumed during the sequence update process.

[0050] In some embodiments, querying the first business sequence based on the first element may include: obtaining the node order of the first business sequence, traversing the first business sequence with multiple first elements according to the node order, and determining the relationship between the first element and the first business sequence; wherein the relationship between the first element and the first business sequence includes: the first element does not exist in the first business sequence, and the first element exists in the first business sequence.

[0051] In this embodiment, when the first element exists in the first service sequence, the service status of the same element in the first service sequence is modified from unfinished to completed.

[0052] In this embodiment, when the first element does not exist in the first service sequence, the server can obtain the position of the first element in the historical service sequence and, based on the position of the first element in the historical service sequence and the positions of each element in the first service sequence, determine the position at which the first element is added to the first service sequence. Furthermore, based on the position, the first element is added to the first service sequence to obtain a second service sequence.

[0053] In some embodiments, when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence, which may include: when an adjacent second element exists before the first element, obtaining the adjacent previous second element of the first element in the historical business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence; based on the adjacent previous second element of the first element, merging the first element into the first business sequence to obtain the second business sequence.

[0054] In this embodiment, when a first element does not exist in a first service sequence, the server can obtain the position of the first element in the historical service sequence. If multiple second elements exist before the first element in the historical service sequence, the server can obtain the previous second element adjacent to the first element in the historical service sequence and query the first service sequence for the position of the second element. Furthermore, based on the position of the second element in the first service sequence, the first element is added to the first service sequence after the second element, adjacent to the second element. The previous second element adjacent to the first element in the historical service sequence refers to the first second element preceding the first element in the historical service sequence. For example, if the historical service sequence is: 1, 3, 2, 5, 7, and the first service sequence is: 1, 3, 6, 7, 8, 5, and the service status of element "2" in the historical service sequence is Completed, then element "2" in the historical service sequence is the first element, the first element does not exist in the first service sequence, and there are two second elements ("1" and "3") before the first element in the historical service sequence. The server then obtains the first second element "3" preceding the first element in the historical service sequence. Furthermore, the server can obtain the position of the second element in the first service sequence. Based on the position of the second element in the first service sequence, the server can add the first element to the first service sequence after the second element and adjacent to the second element. Therefore, the first service sequence (i.e., the second service sequence) with the first element added is: 1, 3, 2, 6, 7, 8, 5. In addition, the service status of the first element in the second service sequence remains unchanged and remains completed.

[0055] In another embodiment, the server can obtain the node order of the first business sequence, traverse the first business sequence with multiple first elements according to the node order, determine the relationship between the first element and the first business sequence, and then determine whether to add the first element to the first business sequence based on the relationship between the first element and the first business sequence, as well as the specific position of adding the first element to the first business sequence. Therefore, when the first element does not exist in the first business sequence, other first elements may have been added to the first business sequence. The server can obtain the previous second element (intermediate element 1) adjacent to the first element in the historical business sequence, and the previous first element (intermediate element 2) adjacent to the first element in the historical business sequence. The server can determine the position of the current first element in the first business sequence based on the distance between the current first element and the intermediate element 1 and the intermediate element 2 respectively. Among them, the previous first element adjacent to the first element in the historical business sequence refers to the first first element before the first element in the historical business sequence. For example, when the historical service sequence is: 1, 3, 2, 5, 4, 7, the first service sequence is: 1, 3, 6, 7, 8, 5, and the service status of element "2" and element "4" in the historical service sequence is completed, and the current first element is element "4", then elements "2" and "4" in the historical service sequence are first elements, and the server has previously added the first element "2" to the first service sequence. The first service sequence with the added first element "2" is: 1, 3, 2, 6, 7, 8, 5. Furthermore, the current first element "4" does not exist in the first service sequence, and there are three second elements (respectively "1", "3", and "5") and one first element "2" before the first element in the historical service sequence. At this time, the server can obtain the first second element "5" (intermediate element 1) before the first element in the historical service sequence and the first first element "2" (intermediate element 2) before the first element in the historical service sequence. Furthermore, in the historical service sequence, the distance between the current first element "4" and the middle element 1 is smaller than the distance between the first element "4" and the middle element 2. The server can choose to add the current first element "4" to the first service sequence after the middle element 1, adjacent to the middle element 1. Therefore, the first service sequence with the first element "4" added is: 1, 3, 2, 6, 7, 8, 5, 4. Furthermore, the service status of the first element in the second service sequence remains unchanged and remains completed.

[0056] In this embodiment, when the last element in the historical service sequence completes traversal of the first service sequence in node order, the obtained second service sequence is the final second service sequence.

[0057] In some embodiments, when the first element does not exist in the first business sequence, adding the first element to the first business sequence to obtain a second business sequence may include: when there is no adjacent second element before the first element, adding the first element to the first element of the first business sequence to obtain the second business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0058] In this embodiment, when the first element does not exist in the first business sequence, the server can obtain the position of the first element in the historical business sequence. When the first element is the first element in the historical business sequence, the first element is directly added before the first element of the first business sequence to obtain the second business sequence.

[0059] In another embodiment, when the first element does not exist in the first business sequence, the server can obtain the position of the first element in the historical business sequence. When there are multiple elements before the first element in the historical business sequence, but when the multiple elements before the first element in the historical business sequence do not exist in the first business sequence, the server can also directly add the first element before the first element of the first business sequence to obtain a second business sequence.

[0060] In some embodiments, when there is a first element in the historical business sequence, the above method may also include: obtaining multiple third elements in the historical business sequence; wherein the third element is an element with an incomplete business status; querying the first business sequence based on the multiple third elements; when there is no third element in the first business sequence, deleting the third element.

[0061] In this embodiment, when the third element does not exist in the first business sequence, the third element is ignored, that is, not processed. For example, when the historical business sequence is: 1, 2, 3, 4 and the first business sequence is: 1, 3, 6, and the historical business sequence contains the first element "1" and the third elements "2", "3" and "4", the first business sequence contains the third element "3" but does not contain the third elements "2" and "4". Therefore, the third elements "2" and "4" are ignored. Moreover, since the first element "1" exists in the first business sequence, the server can directly change the business status of the same element in the first business sequence from unfinished to completed. Then the second business sequence is: 1, 3, 6, where the business status of element "1" is completed, and the business status of elements "3" and "6" are unfinished.

[0062] In some embodiments, the above method may further include: when the first element does not exist in the historical service sequence, using the first service sequence as the second service sequence.

[0063] In this embodiment, when the business status of all elements in the historical business sequence is incomplete, the server can ignore the elements in the historical business sequence and directly use the first business sequence as the second business sequence, saving the operation of sequence processing multiple elements in the first business sequence and improving the speed of business sequence update.

[0064] It should be understood that, although the various steps in the flowcharts involved in the various embodiments described above are displayed in sequence according to the instructions of the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless otherwise specified herein, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flowcharts involved in the various embodiments described above can include multiple steps or multiple stages, and these steps or stages are not necessarily executed and completed 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 portion of steps or stages in other steps.

[0065] Based on the same inventive concept, the embodiments of the present application also provide a device for dynamically changing services for implementing the aforementioned method for dynamically changing services. The implementation solution provided by this device is similar to the implementation solution described in the aforementioned method. Therefore, the specific limitations in one or more embodiments of the device for dynamically changing services provided below can be found in the above-mentioned limitations on the method for dynamically changing services, and will not be repeated here.

[0066] In one embodiment, Figure 3 As shown, a device for dynamically changing a service is provided, comprising: a data acquisition module 302, a second service sequence determination module 304, and a service execution order determination module 306, wherein:

[0067] The data acquisition module 302 is used to acquire the first business sequence, the historical business sequence, and the business status of each element in the historical business sequence.

[0068] The second service sequence determination module 304 is configured to, when a completed service element exists in the historical service sequence, use the completed service element as the first element and query the first service sequence based on the first element. If the first element does not exist in the first service sequence, the module adds the first element to the first service sequence to obtain a second service sequence.

[0069] The service execution sequence determining module 306 is configured to obtain the arrangement order of the plurality of elements in the second service sequence whose service status is incomplete as the service execution sequence.

[0070] In one embodiment, the second service sequence determination module 304 may include:

[0071] The second element acquisition submodule is used to acquire the adjacent previous second element of the first element in the historical business sequence when there is an adjacent second element before the first element; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0072] The first merging submodule is configured to merge the first element into the first service sequence based on a second element that is an adjacent previous element of the first element, so as to obtain a second service sequence.

[0073] In one embodiment, the second service sequence determination module 304 may include:

[0074] The second merging submodule is used to add the first element to the first element of the first business sequence to obtain a second business sequence when there is no adjacent second element before the first element; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0075] In one embodiment, the second service sequence determination module 304 may include:

[0076] The traversal submodule is used to obtain the node order of the first business sequence, traverse the first business sequence according to the node order of multiple first elements, and determine the relationship between the first element and the first business sequence; wherein the relationship between the first element and the first business sequence includes: the first element does not exist in the first business sequence, and the first element exists in the first business sequence.

[0077] In one embodiment, when the first element exists in the historical service sequence, the apparatus may further include:

[0078] The third element acquisition module is used to acquire multiple third elements in the historical business sequence; wherein the third elements are elements with unfinished business status.

[0079] A query module is used to query the first service sequence based on multiple third elements.

[0080] The deleting module is configured to delete the third element when the third element does not exist in the first service sequence.

[0081] In one embodiment, the above device may further include:

[0082] The replacement module is used to use the first service sequence as the second service sequence when the first element does not exist in the historical service sequence.

[0083] Each module in the above-mentioned dynamic service change device can be implemented in whole or in part through software, hardware, or a combination thereof. Each module can be embedded in or independent of the processor in the computer device in hardware form, or can be stored in the memory of the computer device in software form, so that the processor can call and execute the corresponding operations of each module.

[0084] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 4 As shown. The computer device includes a processor, a memory, an input / output interface (Input / Output, abbreviated as I / O) and a communication interface. The processor, memory and input / output interface are connected through a system bus, and the communication interface is 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, a computer program and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the computer device is used to store data such as historical business sequences and the business status of each element in the historical business sequence. 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 dynamic business changes is implemented.

[0085] Those skilled in the art will understand that Figure 4 The 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 shown in the figure, or combine certain components, or have a different component arrangement.

[0086] In one embodiment, a computer device is provided, comprising 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 a first business sequence, a historical business sequence, and the business status of each element in the historical business sequence; when there is an element with a completed business status in the historical business sequence, taking the element with a completed business status as the first element, and querying the first business sequence based on the first element; when the first element does not exist in the first business sequence, adding the first element to the first business sequence to obtain a second business sequence; and obtaining the arrangement order of multiple elements with an unfinished business status in the second business sequence as the business execution order.

[0087] In one embodiment, when the processor executes the computer program, it also implements adding the first element to the first business sequence to obtain a second business sequence when the first element does not exist in the first business sequence, which may include: when an adjacent second element exists before the first element, obtaining the adjacent previous second element of the first element in the historical business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence; based on the adjacent previous second element of the first element, merging the first element into the first business sequence to obtain the second business sequence.

[0088] In one embodiment, when the processor executes the computer program, it also implements adding the first element to the first business sequence to obtain a second business sequence when the first element does not exist in the first business sequence, which may include: when there is no adjacent second element before the first element, adding the first element to the first element of the first business sequence to obtain the second business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0089] In one embodiment, when the processor executes the computer program, it also implements a query on the first business sequence based on the first element, which may include: obtaining the node order of the first business sequence, traversing the first business sequence according to the node order of multiple first elements, and determining the relationship between the first element and the first business sequence; wherein the relationship between the first element and the first business sequence includes: the first element does not exist in the first business sequence, and the first element exists in the first business sequence.

[0090] In one embodiment, when there is a first element in a historical business sequence, the processor may further implement the following steps when executing a computer program: obtaining multiple third elements in the historical business sequence; wherein the third element is an element with an incomplete business status; querying the first business sequence based on the multiple third elements; and when there is no third element in the first business sequence, deleting the third element.

[0091] In one embodiment, when the processor executes the computer program, the following steps may be further implemented: when the first element does not exist in the historical service sequence, the first service sequence is used as the second service sequence.

[0092] 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 a first business sequence, a historical business sequence, and the business status of each element in the historical business sequence; when there is an element with a completed business status in the historical business sequence, taking the element with a completed business status as the first element, and querying the first business sequence based on the first element; when the first element does not exist in the first business sequence, adding the first element to the first business sequence to obtain a second business sequence; obtaining the arrangement order of multiple elements with an unfinished business status in the second business sequence as the business execution order.

[0093] In one embodiment, when the computer program is executed by the processor, it is also implemented that when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence, which may include: when an adjacent second element exists before the first element, obtaining the adjacent previous second element of the first element in the historical business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence; based on the adjacent previous second element of the first element, the first element is merged into the first business sequence to obtain the second business sequence.

[0094] In one embodiment, when the computer program is executed by the processor, it is also implemented that when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence, which may include: when there is no adjacent second element before the first element, the first element is added to the first element of the first business sequence to obtain the second business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0095] In one embodiment, when the computer program is executed by the processor, it also implements a query on the first business sequence based on the first element, which may include: obtaining the node order of the first business sequence, traversing the first business sequence according to the node order of multiple first elements, and determining the relationship between the first element and the first business sequence; wherein the relationship between the first element and the first business sequence includes: the first element does not exist in the first business sequence, and the first element exists in the first business sequence.

[0096] In one embodiment, when there is a first element in a historical business sequence, the computer program can also implement the following steps when executed by the processor: obtain multiple third elements in the historical business sequence; wherein the third element is an element with an incomplete business status; query the first business sequence based on the multiple third elements; when the third element does not exist in the first business sequence, delete the third element.

[0097] In one embodiment, when the computer program is executed by the processor, the following steps may be further implemented: when the first element does not exist in the historical service sequence, the first service sequence is used as the second service sequence.

[0098] In one embodiment, a computer program product is provided, comprising a computer program that, when executed by a processor, implements the following steps: obtaining a first business sequence, a historical business sequence, and the business status of each element in the historical business sequence; when there is an element with a completed business status in the historical business sequence, taking the element with a completed business status as the first element, and querying the first business sequence based on the first element; when the first element does not exist in the first business sequence, adding the first element to the first business sequence to obtain a second business sequence; and obtaining the arrangement order of multiple elements with an uncompleted business status in the second business sequence as the business execution order.

[0099] In one embodiment, when the computer program is executed by the processor, it is also implemented that when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence, which may include: when an adjacent second element exists before the first element, obtaining the adjacent previous second element of the first element in the historical business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence; based on the adjacent previous second element of the first element, the first element is merged into the first business sequence to obtain the second business sequence.

[0100] In one embodiment, when the computer program is executed by the processor, it is also implemented that when the first element does not exist in the first business sequence, the first element is added to the first business sequence to obtain a second business sequence, which may include: when there is no adjacent second element before the first element, the first element is added to the first element of the first business sequence to obtain the second business sequence; wherein the second element belongs to the intersection of the historical business sequence and the first business sequence.

[0101] In one embodiment, when the computer program is executed by the processor, it also implements a query on the first business sequence based on the first element, which may include: obtaining the node order of the first business sequence, traversing the first business sequence according to the node order of multiple first elements, and determining the relationship between the first element and the first business sequence; wherein the relationship between the first element and the first business sequence includes: the first element does not exist in the first business sequence, and the first element exists in the first business sequence.

[0102] In one embodiment, when there is a first element in a historical business sequence, the computer program can also implement the following steps when executed by the processor: obtain multiple third elements in the historical business sequence; wherein the third element is an element with an incomplete business status; query the first business sequence based on the multiple third elements; when the third element does not exist in the first business sequence, delete the third element.

[0103] In one embodiment, when the computer program is executed by the processor, the following steps may be further implemented: when the first element does not exist in the historical service sequence, the first service sequence is used as the second service sequence.

[0104] 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 the relevant laws, regulations and standards of relevant countries and regions.

[0105] Those skilled in the art will appreciate that all or part of the processes in the above-mentioned embodiment methods can be implemented 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 memory, database or other media used in the embodiments provided in this application may include at least one of non-volatile and volatile memory. Non-volatile memory may include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory may include random access memory (RAM) or external cache memory, etc. By way of 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 the various embodiments provided herein may include at least one of a relational database and a non-relational database. Non-relational databases may include, but are not limited to, distributed databases based on blockchains. The processor involved in the various embodiments provided herein may be, but are not limited to, a general-purpose processor, a central processing unit, a graphics processing unit, a digital signal processor, a programmable logic unit, a data processing logic unit based on quantum computing, and the like.

[0106] The technical features of the above embodiments can 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.

[0107] The above-described embodiments merely represent several implementation methods of the present application. While the descriptions are relatively specific and detailed, they should not be construed as limiting the scope of the present application. It should be noted that a person of ordinary skill in the art may make various modifications and improvements without departing from the spirit of the present application, and these modifications and improvements fall within the scope of protection of the present application. Therefore, the scope of protection of the present application shall be determined by the appended claims.

Claims

1. A method for dynamic business change, characterized in that: The method comprises: Acquire a first service sequence, a historical service sequence, and a service status of each element in the historical service sequence; When there is an element with a completed service status in the historical service sequence, taking the element with a completed service status as the first element, and querying the first service sequence based on the first element; when the first element does not exist in the first service sequence, adding the first element to the first service sequence to obtain a second service sequence; The arrangement order of the multiple elements with an unfinished business status in the second business sequence is obtained as the business execution order.

2. The method according to claim 1, characterized in that When the first element does not exist in the first service sequence, adding the first element to the first service sequence to obtain a second service sequence includes: When there is an adjacent second element before the first element, obtaining the adjacent previous second element of the first element in the historical service sequence; wherein the second element belongs to the intersection of the historical service sequence and the first service sequence; Based on a second element immediately preceding the first element, the first element is merged into the first service sequence to obtain a second service sequence.

3. The method according to claim 1, characterized in that When the first element does not exist in the first service sequence, adding the first element to the first service sequence to obtain a second service sequence includes: When there is no adjacent second element before the first element, the first element is added to the first element of the first service sequence to obtain a second service sequence; wherein the second element belongs to the intersection of the historical service sequence and the first service sequence.

4. The method according to claim 1, wherein The querying the first service sequence based on the first element includes: Obtaining a node sequence of the first service sequence, traversing the first service sequence using the plurality of first elements according to the node sequence, and determining a relationship between the first elements and the first service sequence; The relationship between the first element and the first service sequence includes: the first element does not exist in the first service sequence, and the first element exists in the first service sequence.

5. The method according to claim 1, wherein When the first element exists in the historical service sequence, the method further includes: Acquire multiple third elements in the historical business sequence; wherein the third elements are elements with unfinished business status; querying the first service sequence based on the plurality of third elements; When the third element does not exist in the first service sequence, the third element is deleted.

6. The method according to claim 1, characterized in that The method further comprises: When the first element does not exist in the historical service sequence, the first service sequence is used as the second service sequence.

7. A device for dynamically changing services, characterized in that: The device comprises: A data acquisition module, configured to acquire a first business sequence, a historical business sequence, and a business status of each element in the historical business sequence; a second service sequence determining module configured to, when an element with a completed service status exists in the historical service sequence, use the element with a completed service status as a first element and query the first service sequence based on the first element; and when the first element does not exist in the first service sequence, add the first element to the first service sequence to obtain a second service sequence; The service execution sequence determining module is configured to obtain the arrangement order of multiple elements in the second service sequence whose service status is incomplete as the service execution sequence.

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