A data processing method and device, electronic equipment and storage medium

Abstract

The present disclosure provides a data processing method and device, electronic equipment and storage medium, wherein the method comprises: in response to an invoicing request, obtaining an order to be invoiced indicated by the invoicing request; verifying whether the order to be invoiced is the latest order based on a pre-constructed tree-structured order network; if yes, invoicing the order to be invoiced to obtain invoicing information. The present disclosure is beneficial for order verification realized by the pre-constructed tree-structured order network, simple and efficient operation, and only the latest order can be invoiced to avoid the generation of situations such as the inconsistency between the invoicing amount and the actual payment amount caused by the return and exchange order, optimize the invoicing environment, and have stronger adaptability.

Description

TECHNICAL FIELD

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

[0002] Invoices have important significance and role in social and economic activities, have characteristics such as legality and authenticity, are carriers for recording economic activity content, and are important tools for financial management work. For example, business platforms such as comprehensive payment platforms need to provide invoice and red-striking data.

[0003] In reality, there are often demands for returns and exchanges, and sometimes even continuous returns and exchanges. When multiple returns and exchanges occur for an order, the transactions of multiple returns and exchanges need to be associated. In traditional invoice data processing schemes, a linked list structure is often used to store order information. In the scenario of multiple returns and exchanges, the data processing logic is complex, and the invoice takes a long time. SUMMARY

[0004] Embodiments of the present disclosure provide at least a data processing method, device, electronic equipment and storage medium to reduce data processing complexity and improve invoice efficiency through a pre-constructed tree-structured order network.

[0005] In a first aspect, embodiments of the present disclosure provide a data processing method, comprising:

[0006] In response to an invoice request, obtaining a to-be-invoiced order indicated by the invoice request;

[0007] Verifying whether the to-be-invoiced order is a latest order based on a pre-constructed tree-structured order network;

[0008] If yes, invoicing the to-be-invoiced order to obtain invoice information.

[0009] In a possible implementation, the method further comprises:

[0010] If no, generating prompt information for prompting to invoice using the latest order.

[0011] In a possible implementation, the verifying whether the to-be-invoiced order is the latest order based on the pre-constructed tree-structured order network comprises:

[0012] Based on the pre-constructed tree-structured order network, obtaining an original order stored in a first network node, the original order being associated with a latest order;

[0013] Comparing the to-be-invoiced order with the latest order associated with the original order;

[0014] If the comparison succeeds, it is determined that the order to be invoiced is the latest order; if the comparison fails, it is determined that the order to be invoiced is not the latest order.

[0015] In a possible implementation, when the latest order associated with the original order is in an invoiced state, the method further includes:

[0016] When it is determined that a new order is generated, initiating a red-ink instruction for the latest order;

[0017] Receiving red-ink information returned by the red-ink instruction, the red-ink information being used to indicate that the latest order associated with the original order is in a red-ink state.

[0018] In a possible implementation, the tree-structure order network is constructed in advance according to the following steps:

[0019] In response to an order pushing instruction, obtaining a target order in the order pushing instruction;

[0020] Storing the target order into the tree-structure order network based on record information of the target order.

[0021] In a possible implementation, the storing of the target order into the tree-structure order network based on the record information of the target order includes:

[0022] When it is determined that the target order is an original order, storing the target order into a first layer network node in the tree-structure order network; or,

[0023] When it is determined that the target order is not an original order, storing the target order into other layer network nodes in the tree-structure order network based on order association relationships recorded by the target order.

[0024] In a possible implementation, the method further includes:

[0025] When it is determined that the target order is an original order, in response to a latest order pushing instruction, obtaining a latest order in the latest order pushing instruction;

[0026] When it is determined that the latest order and the original order have an association relationship, storing the association relationship between the latest order and the original order into a first layer network node in the tree-structure order network.

[0027] In a possible implementation, the method further includes:

[0028] In a case where it is determined that the target order is not the original order, determining an order association relationship between the target order and the original order based on an order association relationship recorded by the target order and an order association relationship between an order associated with the target order and the original order;

[0029] Corresponding storage of the order association relationship between the target order and the original order to other layer network nodes in the tree-structure order network.

[0030] In a second aspect, the present disclosure further provides a data processing apparatus, comprising:

[0031] An acquisition module configured to acquire, in response to an invoicing request, a to-be-invoiced order indicated by the invoicing request;

[0032] A verification module configured to verify, based on a pre-constructed tree-structure order network, whether the to-be-invoiced order is a latest order;

[0033] An invoicing module configured to, if so, perform invoicing on the to-be-invoiced order to obtain invoicing information.

[0034] In a third aspect, the present disclosure further provides an electronic device, comprising a processor, a memory and a bus, the memory stores machine readable instructions executable by the processor, when the electronic device is running, the processor and the memory communicate through the bus, and the machine readable instructions are executed by the processor to perform the data processing method in the first aspect and any one of the various embodiments thereof.

[0035] In a fourth aspect, the present disclosure further provides a computer readable storage medium, the computer readable storage medium stores a computer program, and the computer program is executed by a processor to perform the data processing method in the first aspect and any one of the various embodiments thereof.

[0036] With the above data processing method, apparatus, electronic device and storage medium, in response to an invoicing request, a to-be-invoiced order indicated by the invoicing request can be acquired, based on a pre-constructed tree-structure order network, whether the to-be-invoiced order is a latest order can be verified, and in a case where it is verified that the to-be-invoiced order is a latest order, invoicing information can be provided. The present disclosure is beneficial for order verification realized by a pre-constructed tree-structure order network, is simple and efficient to operate, and only enables invoicing on a latest order to avoid situations such as inconsistency between invoicing amount and actual payment amount caused by return and exchange orders, optimizes invoicing environment, and is more adaptable.

[0037] Other advantages of the present disclosure will be described in more detail in conjunction with the following description and drawings.

[0038] It should be understood that the above description is merely a summary of the technical solutions of the present disclosure, so as to enable a clearer understanding of the technical means of the present disclosure, so that the content of the specification can be implemented. In order to make the above and other purposes, features and advantages of the present disclosure more obvious and easy to understand, the following specific embodiments of the present disclosure are illustrated. BRIEF DESCRIPTION OF DRAWINGS

[0039] In order to more clearly illustrate the technical solutions of the embodiments of the present disclosure, the drawings required to be used in the embodiments will be briefly introduced hereinafter. The drawings incorporated into the specification and form a part of the specification, which show the embodiments consistent with the present disclosure, and are used to illustrate the technical solutions of the present disclosure together with the specification. It should be understood that the following drawings only show some embodiments of the present disclosure, and therefore should not be regarded as a limitation on the scope, and for those skilled in the art, other related drawings can also be obtained without creative labor. Moreover, the same reference numerals are used to represent the same components throughout the drawings. In the drawings:

[0040] Figure 1 A billing and red flush flowchart in the related art is shown;

[0041] Figure 2 An example diagram of a multiple return and exchange scenario is shown;

[0042] Figure 3 A flowchart of a data processing method provided by the embodiments of the present disclosure is shown;

[0043] Figure 4 An application diagram of a data processing method provided by the embodiments of the present disclosure is shown;

[0044] Figure 5 A diagram showing a specific method of constructing an order network in a data processing method provided by the embodiments of the present disclosure is shown;

[0045] Figure 6 A diagram showing a specific method of billing and red flush in a data processing method provided by the embodiments of the present disclosure is shown;

[0046] Figure 7 A diagram showing a data processing device provided by the embodiments of the present disclosure is shown;

[0047] Figure 8 A diagram showing an electronic device provided by the embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0048] Exemplary embodiments of the present disclosure will be described more fully hereinafter with reference to the accompanying drawings; however, they are not limited to only the embodiments set forth herein but can be implemented in various forms. The present embodiments are provided so that this disclosure will be thorough, and will fully convey the scope of the disclosure to those skilled in the art.

[0049] In the description of the embodiments of the present disclosure, it is to be understood that terms such as "including" or "having," and the like, are intended to indicate the presence of the stated feature, number, step, action, component, part, or combination thereof described in the specification, and are not intended to preclude the presence or addition of one or more other features, numbers, steps, actions, components, parts, or combinations thereof.

[0050] Unless otherwise specified, " / " means or, for example, A / B can mean A or B; "and / or" herein is only a description of the relationship between the associated objects, which means that there can be three relationships, for example, A and / or B, which means that there are three cases of A alone, A and B together, and B alone.

[0051] The terms "first", "second", and the like are used only for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined with "first", "second", and the like can explicitly or implicitly include one or more such features. In the description of the embodiments of the present disclosure, unless otherwise specified, the meaning of "a plurality of" is two or more.

[0052] It is found through research that at present, in the billing scenario, due to the association characteristics of the order, a linear table is usually used to store order information. The data processing module accepts the original order information pushed by the cashier system at regular intervals, and these information is recorded in the database table in chronological order.

[0053] When the customer applies for billing, the third-party billing platform obtains billing information from the comprehensive payment platform. The data processing module finds the corresponding order information in the database according to the order number, performs billing verification and billing amount calculation, and finally returns the billing information to the third-party billing platform, which performs billing. After the billing is successful, the invoice information is issued to the data processing module.

[0054] When a return occurs, if the original order has been billed, the business personnel need to manually initiate a red flush on the third-party billing platform, and the third-party billing platform obtains the billed information from the comprehensive payment platform. The data processing module finds the invoice information corresponding to the order in the database according to the order number. Finally, the red flush information is returned to the third-party billing platform, which performs red flush.

[0055] As Figure 1As shown, it is a traditional billing and red correction flowchart, the processing logic is complex, and the efficiency is low. Especially in the scenario of multiple returns and exchanges, it further improves the processing complexity.

[0056] As shown, there are original consumption orders 101 and associated return and exchange orders 102-105. When the billing application is initiated through order 105, the order number 105 record is first found in the order library, then it needs to be determined that the 105 order is the latest order, and there is no previous billed and red corrected order. To this end, all related orders need to be found according to 105. As shown, Figure 2 For each order on the chain, not only the associated orders need to be found upwards, but also the subsequent orders need to be found downwards. If the conditions are met, all orders are summarized to calculate the billing information. Figure 1

[0057] In addition, as shown, when the customer bills through the latest order number, if there is a previous billed and red corrected order, a prompt message will be received: billed, please contact customer service manually red correction. If you need to bill, you need to contact customer service to manually red correct the billed order. The experience is poor for users. Figure 1

[0058] In order to at least partially solve one or more of the above problems and other potential problems, the present disclosure provides at least one data processing scheme for billing and red correction based on a pre-constructed tree structure order network. The data acquisition process is simple and fast in complex scenarios. At most, only two data searches are performed when billing, and billing information is maintained in advance. Billing data is quickly acquired. At the same time, automatic red correction is initiated, and the user experience is good. When the return and exchange order is pushed by the cash register system, the data processing module will automatically red correct the issued invoice, avoiding the complex operation of manual red correction and improving the user experience.

[0059] In order to facilitate the understanding of the present embodiment, first, a data processing method disclosed by the present embodiment is introduced in detail. The execution subject of the data processing method provided by the present embodiment is generally an electronic device with certain computing power, which includes, for example: terminal equipment or server or other processing equipment. The terminal equipment can be a user equipment (User Equipment, UE), a mobile device, a user terminal, a cellular phone, a personal digital assistant (Personal Digital Assistant, PDA), a handheld device, a computing device, etc. In some possible implementation manners, the data processing method can be realized by calling computer readable instructions stored in the memory by the processor.

[0060] Referring to Figure 3 ​​As shown, a flowchart of a data processing method provided by the embodiment of the present disclosure is shown, and the method comprises steps S301-S304, wherein:

[0061] S301: in response to an invoicing request, obtaining an order to be invoiced indicated by the invoicing request;

[0062] S302: verifying whether the order to be invoiced is the latest order based on a tree-structured order network constructed in advance;

[0063] S303: if yes, invoicing the order to be invoiced to obtain invoicing information;

[0064] S304: if no, generating prompt information for prompting to use the latest order to invoice.

[0065] In order to facilitate understanding of the data processing method provided by the embodiment of the present disclosure, the application scenario of the method will be described in detail first. The data processing method in the embodiment of the present disclosure can be mainly applied to various application scenarios requiring invoicing, and has strong adaptability to business scenarios such as online shopping platforms, in addition to which, it can also be applied to various application scenarios requiring invoice maintenance of orders, which is not specifically limited here. Considering the wide application of online shopping application scenarios, the scenario will be exemplarily described in the following.

[0066] Here, in response to an invoicing request, an order to be invoiced indicated by the request can be obtained. For any order to be invoiced, the embodiment of the present disclosure can verify whether the order to be invoiced is the latest order based on a tree-structured order network constructed in advance, and can invoice in the case of verifying that it is the latest order, thereby ensuring that all invoicing orders are directed to the latest order to avoid various undesirable situations such as the difference between the invoice amount and the actual payment amount.

[0067] The invoicing request here can be triggered manually by a user, that is, when invoicing is required, an invoicing request can be initiated, in addition to which, it can also be automatically triggered, for example, an invoicing request is initiated for each order generated, and it can also be triggered in other ways, which is not specifically limited here.

[0068] The latest order can be the order closest to the current time when the invoicing request is initiated, which is still exemplarily described in the following. Figure 2As shown in the multiple return and exchange scenarios, the order 105 can be the latest order. In the case of determining that an invoice needs to be issued for the order 105, the invoice can be directly issued, for example, the commodity information in the order 105 is extracted, and the invoice information is obtained. Here, if it is desired to invoice the order 104, since the order 104 is not the latest order, prompt information for reminding the latest order to invoice is generated at this time, which is mainly considered that once a new order 105 is generated based on the order 104, the content of the invoice will change substantially, and at this time it is generally considered that the invoice cannot be directly issued for the order 104, thereby automatically optimizing the invoice environment.

[0069] It should be noted that the third-party invoice platform can perform the invoice, and other invoice institutions can also perform the invoice, which is not limited here.

[0070] In order to further understand the above invoice process, the following can be combined with Figure 4 further described.

[0071] As Figure 4 shown, the order record can be searched according to the order number of the order to be invoiced (the order record is stored by using the pre-constructed tree structure order network), so as to determine whether the order is the latest, in the case of determining that it is the latest, the commodity information of the corresponding order is searched to obtain the final invoice information, in the case of determining that it is not the latest, the prompt information of using the latest order number to invoice can be returned.

[0072] Here, since the tree structure based order information storage model is introduced, at most only two data searches are performed, one is to search the order information, and the other is to search the invoice information. Since the invoice information in the record is calculated in advance, the speed of obtaining the invoice data is very fast.

[0073] In the embodiment of the disclosure, based on the pre-constructed tree structure order network, whether the current order to be invoiced is the latest order can be verified, which can be realized by the following steps:

[0074] Step one, based on the pre-constructed tree structure order network, the original order stored in the first layer network node is obtained, and the original order is associated with the latest order;

[0075] Step two, comparing the order to be invoiced with the latest order associated with the original order;

[0076] Step three, if the comparison is successful, it is determined that the order to be invoiced is the latest order; if the comparison fails, it is determined that the order to be invoiced is not the latest order.

[0077] The first network node of the tree-structure order network always maintains the association between the original order and the latest order, and based on the association, it can be determined whether the order to be invoiced is the latest order.

[0078] The data processing method provided by the embodiments of the present disclosure can automatically find the invoiced latest order based on the association maintained by the first network node when a new order is generated, and automatically initiate red correction. Compared with manually initiating red correction, the work efficiency is significantly improved.

[0079] In actual application, it can be determined that a new order is generated when a return or exchange order pushed by the cash register system is received.

[0080] Considering the key role of the construction of the tree-structure order network in invoicing and red correction processing, the process of constructing the order network will be mainly explained as follows, which can be implemented by the following steps:

[0081] Step one, in response to an order pushing instruction, obtaining a target order in the order pushing instruction;

[0082] Step two, storing the target order to the tree-structure order network based on the record information of the target order.

[0083] Here, the target order can be extracted from the order pushing instruction first, and then stored to the corresponding network node of the tree-structure order network based on the record information of the target order.

[0084] Among them, the order pushing instruction can be initiated by the cash register system, and one instruction can carry one target order or multiple target orders. For multiple target orders, the target orders can be stored to the network nodes in chronological order.

[0085] Among them, in the case that the target order is an original order, the target order is stored to the first network node of the tree-structure order network; in the case that the target order is not an original order, the target order is stored to other network nodes of the tree-structure order network based on the order association recorded by the target order.

[0086] The tree-structure order network here is constructed based on the order association, for example, an original order generates two return or exchange orders, and the two return or exchange orders have a direct association with the original order, then the second network node has two, which can store the information of the two return or exchange orders.

[0087] To further improve the order query efficiency, an association relationship with the latest order can be maintained for the original order at all times, and at the same time, an association relationship with the original order is maintained for each order directly or indirectly associated with the original order.

[0088] In a case where it is determined that the target order is the original order, in response to the latest order pushing instruction, the latest order in the latest order pushing instruction is obtained; in a case where it is determined that the latest order is associated with the original order, the order association relationship between the latest order and the original order is stored to the first layer network node in the tree structure order network.

[0089] In addition, in a case where it is determined that the target order is not the original order, the order association relationship between the target order and the original order is determined based on the order association relationship recorded by the target order and the order association relationship between the order associated with the target order and the original order; and the order association relationship between the target order and the original order is stored to other layer network nodes in the tree structure order network.

[0090] To facilitate further understanding of the construction process of the order network described above, the following can be combined with Figure 5 to illustrate.

[0091] As Figure 5 shown, each circle represents an order, and each order can quickly find the associated order upwards and the subsequent order downwards through the associated order and subsequent order fields. The latest order association field of the original order 101 always stores the latest order number in the associated order, so that the latest order can be found. In addition to the original order 101 itself, other orders maintain an original order field for finding the original order.

[0092] A, B, C, D, E, and F in the circle represent the goods in the corresponding order, with the amount of the goods, as Figure 5 shown. The order information here corresponds one-to-one with the billing information, which can be stored in the goods information table. In addition, the billing information can also include goods details, payment details, and billing amount, etc.

[0093] After receiving the order information pushed by the cash register system each time, if the new order has an associated order, it will become a subtree of the existing tree, otherwise it will become the root node of a new tree, and the corresponding billing information will also be updated.

[0094] To facilitate further understanding of the billing or red-out process that can be generated based on the order network, the following can be combined with Figure 6 to illustrate in detail.

[0095] Assuming that the order 104 has been invoiced, when receiving the order information 105 pushed by the cash register system, its associated order is 103, the original order number field 101 is obtained, and then the order 101 is found; the original order 101 records the latest associated order number 104; because the order 104 has been invoiced, redress is automatically initiated for the issued invoice, which can be specifically initiating redress to the third-party invoicing platform.

[0096] At the same time, because the order 105 is the associated order of the order 103, the order 105 can be incorporated into another sub-tree of the order 103 into the order network.

[0097] In actual application, only in the case of determining to invoice for the current latest order 105 can the invoice for the latest order 105 be obtained. Once a new order is generated thereafter, a redress instruction for the invoice developed for the order 105 is automatically initiated, and the specific process is described above and will not be repeated here.

[0098] In the description of the present specification, the description of the terms “some possible embodiments”, “some embodiments”, “examples”, “specific examples”, or “some examples” and the like means that the specific features, structures, materials or characteristics described in conjunction with the embodiments or examples are included in at least one embodiment or example of the present disclosure. In the present specification, the illustrative description of the above terms is not necessarily for the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any suitable manner in any one or more embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the present specification and the features of the different embodiments or examples without contradiction.

[0099] Regarding the method flowchart of the embodiments of the present disclosure, some operations are described as different steps executed in a certain order. Such flowcharts are illustrative rather than limiting. Some steps described herein can be grouped together and executed in a single operation, some steps can be divided into multiple sub-steps, and some steps can be executed in an order different from that shown herein. Each step shown in the flowchart can be implemented in any way by any circuit structure and / or tangible mechanism (for example, by software running on a computer device, hardware (for example, processor or chip implemented logic function), etc., and / or any combination thereof) in any manner.

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

[0101] Based on the same inventive concept, the data processing method is also provided in the embodiments of the present disclosure. Since the principle of the device in the embodiments of the present disclosure solves the problem is similar to the above-mentioned data processing method of the present disclosure, the implementation of the device can be referred to the implementation of the method, and the repeated parts will not be described here.

[0102] Referring to Figure 7 Fig. 1 is a schematic diagram of a data processing device provided by the embodiments of the present disclosure, and the device comprises an acquisition module 701, a verification module 702, and an invoicing module 703.

[0103] The acquisition module 701 is configured to acquire the to-be-invoiced order indicated by the invoicing request in response to the invoicing request.

[0104] The verification module 702 is configured to verify whether the to-be-invoiced order is the latest order based on the pre-constructed tree-structured order network.

[0105] The invoicing module 703 is configured to invoice the to-be-invoiced order to obtain the invoicing information if the to-be-invoiced order is the latest order.

[0106] The above-mentioned data processing device can acquire the to-be-invoiced order indicated by the invoicing request in response to the invoicing request, verify whether the to-be-invoiced order is the latest order based on the pre-constructed tree-structured order network, and provide the invoicing information in the case of verifying that the to-be-invoiced order is the latest order. The present disclosure is beneficial to the order verification realized by the pre-constructed tree-structured order network, and the operation is simple and efficient. Moreover, only the latest order can be invoiced to avoid the generation of the situation that the invoicing amount does not match the actual payment amount caused by the return and exchange order, optimize the invoicing environment, and have stronger adaptability.

[0107] In a possible implementation, the device further comprises:

[0108] The prompting module 704 is configured to generate prompt information for prompting the invoicing using the latest order if the to-be-invoiced order is not the latest order.

[0109] In a possible implementation, the verification module 702 is configured to verify whether the to-be-invoiced order is the latest order based on the pre-constructed tree-structured order network according to the following steps:

[0110] Based on the pre-constructed tree-structured order network, the original order stored in the first layer network node is acquired, and the original order is associated with the latest order;

[0111] The to-be-invoiced order is compared with the latest order associated with the original order;

[0112] If the comparison is successful, it is determined that the to-be-invoiced order is the latest order; if the comparison fails, it is determined that the to-be-invoiced order is not the latest order.

[0113] In a possible implementation, the apparatus further includes, in a case where the latest order associated with the original order is in an invoiced state:

[0114] a red module 705, configured to initiate a red instruction for the latest order in a case where it is determined that a new order is generated; and receive red information returned by the red instruction, the red information being used to indicate that the latest order associated with the original order is in a red state.

[0115] In a possible implementation, the verification module 702 is configured to pre-construct the tree-structure order network according to the following steps:

[0116] In response to the order pushing instruction, the target order in the order pushing instruction is acquired.

[0117] The target order is stored into the tree-structure order network based on the record information of the target order.

[0118] In a possible implementation, the verification module 702 is configured to store the target order into the tree-structure order network based on the record information of the target order according to the following steps:

[0119] In a case where the target order is an original order, the target order is stored into a first layer network node in the tree-structure order network; or

[0120] In a case where the target order is not an original order, the target order is stored into other layer network nodes in the tree-structure order network based on the order association relationship recorded by the target order.

[0121] In a possible implementation, the verification module 702 is further configured to:

[0122] In a case where the target order is an original order, the latest order in the latest order pushing instruction is acquired in response to the latest order pushing instruction.

[0123] In a case where it is determined that the latest order is associated with the original order, the order association relationship between the latest order and the original order is stored into the first layer network node in the tree-structure order network.

[0124] In a possible implementation, the verification module 702 is further configured to:

[0125] In a case where the target order is not an original order, the order association relationship between the target order and the original order is determined based on the order association relationship recorded by the target order and the order association relationship between the order associated with the target order and the original order.

[0126] The order association relationship between the target order and the original order is stored into the other layer network nodes in the tree-structure order network.

[0127] It should be noted that the device in the embodiments of the present disclosure can implement the various processes of the embodiments of the foregoing method and achieve the same effects and functions, which will not be described here.

[0128] The embodiments of the present disclosure also provide an electronic device, such as Figure 8 As shown in FIG. 8, an electronic device structure schematic diagram provided by the embodiments of the present disclosure includes a processor 801, a memory 802, and a bus 803. The memory 802 stores machine readable instructions executable by the processor 801 (such as the execution instructions of the acquisition module 701, the verification module 702, and the invoicing module 703 in the device, etc.), and when the electronic device is running, the processor 801 and the memory 802 communicate through the bus 803, and the machine readable instructions are executed by the processor 801 to perform the following processing: Figure 7

[0129] In response to the invoicing request, the order to be invoiced indicated by the invoicing request is acquired;

[0130] Based on the pre-constructed tree structure order network, it is verified whether the order to be invoiced is the latest order;

[0131] If yes, the order to be invoiced is invoiced to obtain the invoicing information.

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

[0133] The embodiments of the present disclosure also provide a computer program product, which carries a program code. The instructions included in the program code can be used to execute the steps of the data processing method described in the above method embodiments. For details, please refer to the above method embodiments, which will not be described here.

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

[0135] ​The various embodiments in the present disclosure are described in a progressive manner, and the same or similar parts among the various embodiments can be referred to each other. Each embodiment focuses on the difference from other embodiments. In particular, for the apparatus, device, and computer-readable storage medium embodiments, since they are basically similar to the method embodiments, the description is simplified, and the relevant part can be referred to the part of the method embodiment.

[0136] The apparatus, device, and computer-readable storage medium provided by the embodiments of the present disclosure are one-to-one corresponding to the method, and therefore, the apparatus, device, and computer-readable storage medium also have the similar beneficial technical effects as the method. Since the beneficial technical effects of the method have been described in detail above, the beneficial technical effects of the apparatus, device, and computer-readable storage medium will not be described here.

[0137] Those skilled in the art will appreciate that the embodiments of the present disclosure can be provided as methods, apparatuses (devices or systems), or computer-readable storage media. Therefore, the present disclosure can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present disclosure can take the form of a computer-readable storage medium embodied on one or more computer-usable storage media having computer-usable program code embodied thereon, including but not limited to magnetic storage, CD-ROM, optical storage, etc.

[0138] The present disclosure is described with reference to flowcharts and / or block diagrams of methods, apparatuses (devices or systems), and computer-readable storage media according to the embodiments of the present disclosure. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing apparatus to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing apparatus produce a device that implements the flowcharts and / or block diagrams. Figure 1 The flow or multiple flows and / or blocks Figure 1 The apparatus that implements the functions specified in the flow or multiple flows and / or blocks.

[0139] These computer program instructions can also be stored in a computer-readable memory that can direct the computer or other programmable data processing apparatus to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including instruction apparatus that implements the flowcharts and / or block diagrams. Figure 1 The flow or multiple flows and / or blocks Figure 1 The apparatus that implements the functions specified in the flow or multiple flows and / or blocks.

[0140] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 Figure 1 The computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks.

[0141] In a typical configuration, a computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0142] The memory can include non-persistent memory and / or volatile memory, such as random access memory (RAM) and / or cache memory, non-volatile memory, such as read-only memory (ROM), EPROM, and / or flash memory, etc. The memory is an example of computer readable media.

[0143] Computer readable media includes permanent and non-permanent, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile disc (DVD), or other optical storage, magnetic cassette, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information accessible to a computing device. In addition, although the operations of the methods of the present disclosure are described in a particular order in the drawings, this does not require or imply that the operations must be performed in that particular order, or that all of the illustrated operations must be performed to achieve the desired results. Additionally or alternatively, certain steps can be omitted, combined into a single step, and / or divided into multiple steps.

[0144] Although the spirit and principles of the present disclosure have been described with reference to several specific embodiments, it should be understood that the present disclosure is not limited to the disclosed specific embodiments, and the division of aspects does not mean that the features in these aspects cannot be combined to benefit. This division is only for the convenience of expression. The present disclosure is intended to cover various modifications and equivalent arrangements included in the spirit and scope of the appended claims.

Claims

1. A data processing method, characterized in that, include: In response to an invoicing request, obtain the order to be invoiced as indicated in the invoicing request; The system verifies whether the order to be invoiced is the latest order based on a pre-constructed tree-structured order network. The tree-structured order network is constructed based on order association relationships. The original orders stored in the first-level network nodes of the tree-structured order network maintain a latest order association field. The latest order association field is used to always store the latest order associated with the original order. Other orders maintain the original order field. The latest order is a new order that is determined when a return or exchange order is received. If so, then issue an invoice for the order to be invoiced and obtain the invoicing information; If not, a prompt message will be generated to remind users to use the latest order for invoicing, ensuring that all invoiced orders point to the latest order.

2. The method according to claim 1, characterized in that, The verification of whether the order to be invoiced is the latest order based on the pre-built tree-structured order network includes: Based on a pre-built tree-structured order network, the original orders stored in the first-level network nodes are obtained, and the original orders are associated with the latest orders; The order to be invoiced is compared with the latest order associated with the original order; If the comparison is successful, the order to be invoiced is determined to be the latest order; if the comparison fails, the order to be invoiced is determined to be not the latest order.

3. The method according to claim 2, characterized in that, If the latest order associated with the original order is in an invoiced state, the method further includes: If it is determined that a new order has been generated, initiate a red-ink instruction for the latest order; The system receives red-reversal information returned by the red-reversal instruction, which indicates that the latest order associated with the original order is in a red-reversal state.

4. The method according to claim 1, characterized in that, Pre-build a tree-structured order network using the following steps: In response to an order push instruction, retrieve the target order from the order push instruction; The target order is stored in the tree-structured order network based on the record information of the target order.

5. The method according to claim 4, characterized in that, The step of storing the target order in the tree-structured order network based on the record information of the target order includes: If the target order is determined to be an original order, the target order is stored in the first-level network node of the tree-structured order network; or, If it is determined that the target order is not the original order, the target order is stored in other layer network nodes in the tree-structured order network based on the order association relationship recorded in the target order record.

6. The method according to claim 5, characterized in that, The method further includes: If it is determined that the target order is the original order, in response to the latest order push instruction, the latest order in the latest order push instruction is obtained; If it is determined that the latest order is associated with the original order, the order association between the latest order and the original order is stored in the first-level network node of the tree-structured order network.

7. The method according to claim 5, characterized in that, The method further includes: If it is determined that the target order is not the original order, the order association relationship between the target order and the original order is determined based on the order association relationship recorded in the target order record and the order association relationship between the order associated with the target order and the original order. The order association relationship between the target order and the original order is stored in other layer network nodes of the tree-structured order network.

8. A data processing apparatus, characterized in that, include: The acquisition module is used to acquire the order to be invoiced as indicated by the invoicing request in response to the invoicing request; The verification module is used to verify whether the order to be invoiced is the latest order based on a pre-built tree-structured order network. The tree-structured order network is constructed based on order association relationships. The original orders stored in the first-level network nodes of the tree-structured order network maintain a latest order association field. The latest order association field is used to always store the latest order associated with the original order. Other orders maintain the original order field. The latest order is a new order that is determined when a return or exchange order is received. The invoicing module is used to issue an invoice for the order to be invoiced if the condition is met, and to obtain invoicing information if the condition is not met, and to generate a prompt message to remind the user to use the latest order for invoicing, so as to ensure that all invoiced orders point to the latest order.

9. An electronic device, characterized in that, include: The device includes a processor, a memory, and a bus, wherein the memory stores machine-readable instructions that the processor executes, and the processor communicates with the memory via the bus when the electronic device is in operation, and the machine-readable instructions, when executed by the processor, perform the data processing method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, performs the data processing method as described in any one of claims 1 to 7.

Images