CN112215529A - Method, system, device and computer readable medium for acquiring data - Google Patents
Method, system, device and computer readable medium for acquiring data Download PDFInfo
- Publication number
- CN112215529A CN112215529A CN201910616895.4A CN201910616895A CN112215529A CN 112215529 A CN112215529 A CN 112215529A CN 201910616895 A CN201910616895 A CN 201910616895A CN 112215529 A CN112215529 A CN 112215529A
- Authority
- CN
- China
- Prior art keywords
- production step
- execution result
- central server
- message
- node server
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000004519 manufacturing process Methods 0.000 claims abstract description 269
- 238000012545 processing Methods 0.000 claims abstract description 38
- 238000003860 storage Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 238000012552 review Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 19
- 238000009826 distribution Methods 0.000 description 9
- 238000004891 communication Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 238000007726 management method Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000009331 sowing Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 235000003642 hunger Nutrition 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000003032 molecular docking Methods 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000037351 starvation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders
Abstract
The invention discloses a method, a system, equipment and a computer readable medium for acquiring data, and relates to the technical field of warehousing. One embodiment of the method comprises: the node server receives a message indicating a production step of the manifest processing task, executes the manifest processing task, and sends an execution result to the central server through a remote procedure call protocol; the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result; the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step; the central server sends the message of the next production step to a node server corresponding to the next production step; the central server continues to receive the execution results until the last production step is completed. This embodiment enables to obtain the execution result of each production step.
Description
Technical Field
The present invention relates to the field of warehousing technologies, and in particular, to a method, a system, a device, and a computer-readable medium for acquiring data.
Background
After the manifest is downloaded to the warehousing system, the manifest is subjected to ex-warehouse operation. The ex-warehouse is a general term for each step performed when the article leaves the warehouse. Each step is a production link. In one step the production result is sent to the next step. And finally, finishing warehouse-out.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art: the closed-loop connection is adopted between each step, and the delivery data of the manifest can be obtained after the last step is executed.
Disclosure of Invention
In view of the above, embodiments of the present invention provide a method, system, device and computer readable medium for acquiring data, which can obtain the execution result of each production step.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of acquiring data, including:
the node server receives a message indicating a production step of the manifest processing task, executes the manifest processing task, and sends an execution result to the central server through a remote procedure call protocol;
the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result;
the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step;
the central server sends the message of the next production step to a node server corresponding to the next production step;
the central server continues to receive the execution results until the last production step is completed.
The method further comprises the following steps:
when a node server corresponding to the newly added production step exists, the central server records the identification of the newly added production step and the corresponding relation between the node server corresponding to the newly added production step and the message template of the newly added production step.
The method further comprises the following steps:
when deleting the node server corresponding to the production deleting step, the central server deletes the identifier of the production deleting step and the corresponding relation between the node server corresponding to the production deleting step and the message template of the production deleting step.
The order of the production steps is preset based on the manifest processing task.
And determining the next production step according to the identifier in the execution result, wherein the method comprises the following steps:
and if the execution result comprises more than two identifiers, determining the next production step according to the identifier with the highest priority in the more than two identifiers.
The producing step comprises one or more of the following steps: node, location, package calculation, task assignment, pick, review, and ship.
According to a second aspect of the embodiments of the present invention, there is provided a system for acquiring data, including:
the node server is used for receiving a message indicating a production step of the manifest processing task, executing the manifest processing task and sending an execution result through a remote procedure call protocol;
the central server is used for receiving and storing the execution result and determining the next production step according to the identifier in the execution result;
constructing the execution result according to the message template of the next production step to obtain a message of the next production step;
sending the message of the next production step to a node server corresponding to the next production step;
and continuing to receive the execution result until the last production step is completed.
The central server is specifically configured to determine a next production step according to an identifier with a highest priority in the two or more identifiers if the execution result includes the two or more identifiers.
According to a third aspect of the embodiments of the present invention, there is provided an electronic device for acquiring data, including:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method as described above.
According to a fourth aspect of embodiments of the present invention, there is provided a computer readable medium, on which a computer program is stored, which when executed by a processor, implements the method as described above.
One embodiment of the above invention has the following advantages or benefits: because the node server receives the message indicating one production step of the manifest processing task, executes the manifest processing task, and transmits the execution result to the central server through the remote procedure call protocol. The central server receives and stores the execution result, and determines the next production step according to the identification in the execution result; the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step; the central server sends the message of the next production step to a node server corresponding to the next production step; the central server continues to receive the execution results until the last production step is completed. The execution result is received by the message between each production step, and the execution result can be stored, so that the execution result of each production step can be obtained.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic illustration of an ex-warehouse step according to an embodiment of the invention;
FIG. 2 is a schematic diagram of a main flow of a method of acquiring data according to an embodiment of the invention;
FIG. 3 is a schematic diagram of a connection between a central server and a node server according to an embodiment of the present invention;
FIG. 4 is a schematic illustration of another ex-warehouse step according to an embodiment of the invention;
FIG. 5 is a schematic illustration of yet another ex-warehouse step according to an embodiment of the invention;
FIG. 6 is a schematic illustration of ex-warehouse using a central server according to an embodiment of the invention;
FIG. 7 is a schematic diagram of interaction of a central server with a node server according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of the main structure of a system for acquiring data according to an embodiment of the present invention;
FIG. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 10 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
After the manifest is downloaded to the warehousing system, the manifest is subjected to ex-warehouse operation. The delivery of the manifest includes a plurality of production steps, each production step being connected in series. The result of the previous production step is sent directly to the next production step until the last production step. Wherein each production step is performed by a node server.
Referring to fig. 1, fig. 1 is a schematic diagram of ex-warehouse steps according to an embodiment of the present invention, an exemplary ex-warehouse comprises the following production steps: node, location, package calculation, task assignment, pick, review, and ship.
Wherein each production step is connected in closed loop. It is understood that each production step may be a separate step. Each production step directly sends the execution result of the production step to the next step until the last production step.
Due to the closed loop connection between each production step, the shipment data for the manifest can only be obtained at the last production step. It is difficult to know the production data, i.e., the execution result, of each production step.
In order to solve the problem that the execution result of each production step is difficult to know, the following technical scheme in the embodiment of the invention can be adopted.
Referring to fig. 2, fig. 2 is a schematic diagram of a main flow of a method for acquiring data according to an embodiment of the present invention, in which a node server sends an execution result of a production step to a central server. And the central server constructs the execution result into a message and then sends the message to the next production step, and stores the execution result. As shown in fig. 2, the method specifically includes the following steps:
s201, the node server receives a message indicating a production step of the manifest processing task, executes the manifest processing task, and sends an execution result to the central server through a remote procedure call protocol.
In an embodiment of the invention, a central server is coupled to one or more node servers. Data are interacted between the central server and the node server through a Remote Procedure Call (RPC). A node server may perform manifest processing tasks in a production step. The ex-warehouse comprises a plurality of production steps, and each production step is executed by one node server.
Referring to fig. 3, fig. 3 is a schematic diagram of connection between a central server and a node server according to an embodiment of the present invention. The central server is respectively coupled with the node server a, the node server b, the node server c, the node server d and the node server d.
Wherein the node server in fig. 3 is used to execute the production steps in the ex-warehouse. Illustratively, the production steps include order taking, positioning, task assignment, picking and review; and, the execution sequence of the production steps is as follows: order taking, positioning, task allocation, picking and rechecking.
The node server a executes the production steps as follows: receiving orders; the node server b executes the production steps of: positioning; the node server c executes the production steps of: distributing tasks; the node server d executes the following production steps: picking up goods; the node server e executes the production steps of: and (4) rechecking.
The node server receives a message indicating a production step of the manifest processing task, the message including a production step of the manifest processing task. After receiving the message, the node server can execute the manifest processing task. As an example, the node server b performs the following production steps: and positioning, wherein the message comprises a manifest positioning task. Node server b performs the manifest location task.
The node server is coupled with the central server, and the node server does not need to send the execution result of the production step to the node server of the next production step. Instead, the execution result of the production step is transmitted to the central server by the PRC.
In one embodiment of the invention, the order between production steps is pre-set based on manifest processing tasks. As an example, the manifest processing task one includes a production step a and a production step b, and it is preset to perform the production step b first and then perform the production step a. In this way, different manifest processing tasks may be handled as desired.
S202, the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result.
And the central server receives and stores the execution result sent by the node server. The central server determines the next production step, and therefore sends the received execution result to the next production step for processing.
The result of the execution of a production step includes an identifier by which the next production step can be known. It should be noted that the above-mentioned identifier is recorded in the central server in advance. As an example, if a pick identifier is included in the execution result of the production step, the next production step is determined as: and (6) picking up goods.
In an embodiment of the present invention, in the case where two or more identifiers are included in the execution result of the production step, since the next production step is determined according to the identifiers, it is necessary to compare the priorities of the identifiers. And taking the identifier with the highest priority in more than two identifiers as the identifier for determining the next production step. Wherein the priority of the identification can be preset.
As an example, the preset production steps are: the priority of the positioning mark is higher than that of the production steps: the review identifies the priority. And determining that the next production step is as follows because the priority of the positioning identifier is higher than that of the rechecking identifier: and (6) positioning.
In the above embodiment, the next production step can be determined in time according to the identification priority.
When the central server receives the execution result, the execution result may be stored. The execution result is the execution result of the production step sent by the node server to the central server. As an example, the central server stores the execution result of the current production step, and may transmit the execution result of the current production step to the manifest terminal. The manifest center is used for storing the execution results of all production steps of one manifest. Therefore, the execution result of each production step can be known at the manifest center
S203, the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step.
Because data is not directly interacted between the node servers, the execution result of the node server needs to be sent to the node server of the next production step in the form of a message through the central server. And presetting a message template for each production step, storing the corresponding relation between the message template and the node server corresponding to the production step in a central server, and combining an execution result based on the message template of the production step to construct and obtain a message of the next production step.
As an example, for the next production step: positioning, the message template includes: a service ticket number; a class of product (SKU) number; the number of items; the storage positions are numbered; numbering the batches; the production date; shelf life, etc. And on the basis of the execution result sent by the node server, constructing and obtaining the message of the next production step according to the message template.
And S204, the central server sends the message of the next production step to the node server corresponding to the next production step.
The central server may send the message of the next production step to the node server corresponding to the next production step. Specifically, the central server may send the message of the next production step to the node server of the next production step, and the node server performs further processing.
S205, the central server continues to receive the execution result until the last production step is completed.
The node server of the next production step coupled to the central server continues to send the execution results to the central server. The central server continues to receive the execution result, if the production step is not the last production step and the next production step exists, the step S202 is continuously executed; and if the production step is the last production step and the next production step does not exist, the central server stops receiving the execution result.
In the above embodiment, the central server receives the execution result of the production step sent by the node server. On one hand, the central server constructs the execution result into a message of the next production step and sends the message to the next production step; on the other hand, the center server stores the execution result of the production step. In this way, the result of execution of each production step can be known.
In one embodiment of the invention, the order between the production steps is pre-set. As an example, with continued reference to fig. 3, the production steps include order taking, positioning, task assignment, picking and review; the execution sequence of the production steps is as follows: order taking, positioning, task allocation, picking and rechecking.
It will be appreciated that, according to the production steps in fig. 3, the next production step after order taking is the positioning; the next production step after positioning is task allocation; the next production step of the task assignment is picking; the next production step in the pick-up is review. The rechecking is the last production step.
In the production step in fig. 3, a production step needs to be added: and (5) performing separate broadcasting. The separate sowing is to place the article at a preset position. Then, node server f is added on the basis of 5 node servers in fig. 3. The node server f is coupled to the central server. The node server f executes the production steps of: and (5) performing separate broadcasting.
It can be understood that, when there is a node server corresponding to the new production step, the central server records the identifier of the new production step and the corresponding relationship between the node server corresponding to the new production step and the message template of the new production step. Thus, the server can determine the new production subsidy according to the marks of the new production steps. And sending the message constructed according to the message template of the newly added production step to the node server corresponding to the message template.
In the newly added production step: after the sub-broadcasting, the central server determines that the next production step is the sub-broadcasting according to the sub-broadcasting identifier in the execution result, and then constructs and obtains the sub-broadcasting message according to the sub-broadcasting message template. Then, the sub-broadcast message is sent to the sub-broadcast, and the execution result is output.
In an embodiment of the present invention, one production step needs to be deleted in the production steps, and then, the node server is deleted on the basis of the existing node server. That is, when deleting the node server corresponding to the deleted production step, the central server deletes the identifier of the deleted production step, and deletes the correspondence between the node server corresponding to the deleted production step and the message template of the deleted production step.
Referring to fig. 4, fig. 4 is a schematic diagram of another ex-warehouse step according to an embodiment of the invention. Each box in fig. 4 represents a production step. Each production step is connected in a closed loop mode, and ex-warehouse data can be obtained only after the rechecking of the last production step is completed.
Referring to fig. 5, fig. 5 is a schematic diagram of yet another ex-warehouse step according to an embodiment of the invention. Fig. 5 is a flowchart of the production steps of fig. 4, with additional production steps being added. After the production step order is received, production step distribution may be performed; after the production step is distributed, a production step review may be performed.
As can be understood from fig. 5, after the new production step, it is difficult to avoid adjusting the order between the existing production steps. Moreover, at the production step node, it is necessary to determine whether the next production step is positioning or distribution.
Referring to fig. 6, fig. 6 is a schematic diagram of ex-warehouse using a central server according to an embodiment of the present invention. In fig. 6, by using the technical solution of the embodiment of the present invention, the node servers of each production step are respectively coupled to the central server, and the node servers receive the tasks and send the execution results to the central server.
The node server a executes the following production steps: receiving orders; the node server b executes the production steps of: positioning; the node server c executes the production steps of: distributing tasks; the node server d executes the following production steps: picking up goods; the node server e executes the production steps of: rechecking; the node server f executes the production steps of: and (5) performing separate broadcasting.
Specifically, the node server a sends manifest integrity information to the central server. And the central server determines the positioning of the next production step, sends the positioned message to the node server b and stores the bill of lading completion information.
And the node server b receives the positioning message, executes the manifest positioning task and sends a positioning result to the central server. And the central server determines the task allocation of the next production step, sends the task allocation message to the node server c and stores the positioning result.
And the node server c receives the message of task allocation, executes the manifest to be allocated and sends task information to the central server. And the central server determines the picking of the next production step, sends a picking message to the node server d and stores the task information.
And the node server d receives the goods picking message, executes a goods picking task and sends a goods picking result to the central server. The central server determines the rechecking of the next production step, sends the rechecked message to the node server e, and stores the goods picking result.
And the node server e receives the rechecking message, executes a rechecking task and sends a rechecking result to the central server. The central server determines that the rechecking is the last production step and stores the rechecking result.
The above steps are the execution of the production steps above the central server of fig. 6. In the execution process of the production steps below the central server in fig. 6, the new production steps are distributed.
Specifically, the node server a sends manifest integrity information to the central server. And the central server determines the sub-broadcast of the next production step, sends the sub-broadcast message to the node server f and stores the bill of lading completion information.
And the node server f receives the sub-broadcast message, executes a sub-broadcast task and sends a sub-broadcast result to the central server. And the central server determines the rechecking of the next production step, sends the rechecked message to the node server e and stores the distribution result.
And the node server e receives the rechecking message, executes a rechecking task and sends a rechecking result to the central server. The central server determines that the rechecking is the last production step and stores the rechecking result.
In the above steps, the central server determines the next production step, sends the message of the next production step, and stores the execution result. For each node server, the next production step does not need to be considered, and only the execution result needs to be sent to the central server. And the execution result of each production step can be obtained through the central server. Under the condition of the newly added production step, the relation between the existing node server and the central server does not need to be modified, and only the node server in the newly added production step needs to be coupled with the central server.
Referring to fig. 7, fig. 7 is a schematic diagram of interaction between a central server and a node server according to an embodiment of the present invention. The central server is respectively coupled with the node server a, the node server b, the node server c, the node server d and the node server e.
The node server a executes the production steps as follows: receiving orders; the node server b executes the production steps of: positioning; the node server c executes the production steps of: performing separate sowing; the node server d executes the following production steps: distributing tasks; the node server e executes the production steps of: and (6) docking the third-party device.
The node server a receives the manifest and initializes manifest information. The node server a sends manifest information to the central server. As one example, the manifest information includes: numbering the manifest; the ex-warehouse priority; time of delivery; numbering the articles; the number of items; whether to sequence the item, etc.
The central server receives the manifest information sent by the node server a, judges whether the manifest information comprises the over-warehouse identification, if not, the manifest is a common manifest, needs to assemble a positioning message and sends a positioning request to the node server b. As an example, the positioning message includes: a service ticket number; a type of positioning; a SKU number; the number of items; whether starvation is allowed, etc.
And the node server b receives the positioning request and sends a positioning result to the central server. As an example, the positioning results include: a service ticket number; a SKU number; the number of items; the storage positions are numbered; numbering the batches; whether the shelf life is long; the production date; expiration date, etc.
And the central server receives the positioning result, judges that the positioning result comprises a third-party equipment identifier, needs to assemble an equipment message and sends the equipment message to the node server e. As an example, the device message includes: numbering the manifest; numbering the articles; the number of items; numbering the batches; ex-warehouse priority, etc.
And after receiving the equipment message, the node server e produces a manifest.
And the central server receives the positioning result, judges that the positioning result comprises a task distribution identifier, needs to assemble a task distribution message and sends the task distribution message to the node server d. As an example, the task assignment message includes: numbering the manifest; numbering the articles; numbering the batches; special manifest identification; a SKU number; the number of items; lot number, etc.
And after receiving the task allocation message, the node server d establishes a to-be-allocated bill pool.
And the central server receives the manifest information sent by the node server a, judges whether the manifest information comprises a warehouse-crossing identifier, if the warehouse-crossing identifier is included, the manifest needs to go out of the warehouse and needs to assemble a distribution message, and sends the distribution message to the node server c. As an example, the multicast message includes: numbering the manifest; a SKU number; the number of items; priority, etc.
And after receiving the distribution report, the node server c establishes a manifest to be distributed.
In the embodiment of fig. 7, each node server is coupled to the central server, and the central server determines the next production step based on the identifier and sends a message to the node server of the next production step. The center server has a plurality of execution results of the production steps, and thus the execution result of each production step can be obtained.
Fig. 8 is a schematic diagram of a main structure of a system for acquiring data according to an embodiment of the present invention, where the system for acquiring data may implement a method for acquiring data, and as shown in fig. 8, the system for acquiring data specifically includes:
the node server 801 is configured to receive a message indicating a production step of the manifest processing task, execute the manifest processing task, and send an execution result through a remote procedure call protocol.
The central server 802 is used for receiving and storing the execution result, and determining the next production step according to the identifier in the execution result;
constructing the execution result according to the message template of the next production step to obtain a message of the next production step;
sending the message of the next production step to a node server corresponding to the next production step;
and continuing to receive the execution result until the last production step is completed.
In an embodiment of the present invention, the central server 802 is further configured to record, when there is a node server corresponding to the newly added production step, an identifier of the newly added production step, and a correspondence between the node server corresponding to the newly added production step and a message template of the newly added production step.
In an embodiment of the present invention, the central server 802 is further configured to delete the identifier of the deleted production step when deleting the node server corresponding to the deleted production step, and delete the correspondence between the node server corresponding to the deleted production step and the message template of the deleted production step.
In one embodiment of the invention, the order of the production steps is pre-set based on the manifest processing task.
In an embodiment of the present invention, the central server 802 is specifically configured to determine the next production step according to the identifier with the highest priority in the two or more identifiers when the execution result includes two or more identifiers.
In one embodiment of the invention, the producing step comprises one or more of the following steps: node, location, package calculation, task assignment, pick, review, and ship.
Fig. 9 illustrates an exemplary system architecture 900 of a method of acquiring data or a system of acquiring data to which embodiments of the present invention may be applied.
As shown in fig. 9, the system architecture 900 may include end devices 901, 902, 903, a network 904, and a server 905. Network 904 is the medium used to provide communication links between terminal devices 901, 902, 903 and server 905. Network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 901, 902, 903 to interact with a server 905 over a network 904 to receive or send messages and the like. The terminal devices 901, 902, 903 may have installed thereon various messenger client applications such as, for example only, a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, social platform software, etc.
The terminal devices 901, 902, 903 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 905 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 901, 902, 903. The backend management server may analyze and perform other processing on the received data such as the product information query request, and feed back a processing result (for example, target push information, product information — just an example) to the terminal device.
It should be noted that the method for acquiring data provided by the embodiment of the present invention is generally executed by the server 905, and accordingly, a system for acquiring data is generally disposed in the server 905.
It should be understood that the number of terminal devices, networks, and servers in fig. 9 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 10, a block diagram of a computer system 1000 suitable for use with a terminal device implementing an embodiment of the invention is shown. The terminal device shown in fig. 10 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 10, the computer system 1000 includes a Central Processing Unit (CPU)1001 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. In the RAM 1003, various programs and data necessary for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other via a bus 1004. An input/output (I/O) interface 1005 is also connected to bus 1004.
The following components are connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output section 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The driver 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication part 1009 and/or installed from the removable medium 1011. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 1001.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a transmitting unit, an obtaining unit, a determining unit, and a first processing unit. The names of these units do not in some cases constitute a limitation to the unit itself, and for example, the sending unit may also be described as a "unit sending a picture acquisition request to a connected server".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise:
the node server receives a message indicating a production step of the manifest processing task, executes the manifest processing task, and sends an execution result to the central server through a remote procedure call protocol;
the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result;
the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step;
the central server sends the message of the next production step to a node server corresponding to the next production step;
the central server continues to receive the execution results until the last production step is completed.
According to the technical scheme of the embodiment of the invention, the node server receives the message indicating one production step of the manifest processing task, executes the manifest processing task, and sends the execution result to the central server through the remote procedure call protocol. The central server receives and stores the execution result, and determines the next production step according to the identification in the execution result; the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step; the central server sends the message of the next production step to a node server corresponding to the next production step; the central server continues to receive the execution results until the last production step is completed. The execution result is received by the message between each production step, and the execution result can be stored, so that the execution result of each production step can be obtained.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of acquiring data, comprising:
the node server receives a message indicating a production step of the manifest processing task, executes the manifest processing task, and sends an execution result to the central server through a remote procedure call protocol;
the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result;
the central server constructs the execution result according to the message template of the next production step to obtain the message of the next production step;
the central server sends the message of the next production step to a node server corresponding to the next production step;
the central server continues to receive the execution results until the last production step is completed.
2. The method of acquiring data of claim 1, further comprising:
when a node server corresponding to the newly added production step exists, the central server records the identification of the newly added production step and the corresponding relation between the node server corresponding to the newly added production step and the message template of the newly added production step.
3. The method of acquiring data of claim 1, further comprising:
when deleting the node server corresponding to the production deleting step, the central server deletes the identifier of the production deleting step and the corresponding relation between the node server corresponding to the production deleting step and the message template of the production deleting step.
4. The method of acquiring data of claim 1, wherein the order of the production steps is preset based on the manifest processing task.
5. The method of claim 1, wherein determining the next production step based on the identification in the execution result comprises:
and if the execution result comprises more than two identifiers, determining the next production step according to the identifier with the highest priority in the more than two identifiers.
6. The method of obtaining data according to claim 1, wherein the producing step comprises one or more of the following steps: node, location, package calculation, task assignment, pick, review, and ship.
7. A system for acquiring data, comprising:
the node server is used for receiving a message indicating a production step of the manifest processing task, executing the manifest processing task and sending an execution result through a remote procedure call protocol;
the central server is used for receiving and storing the execution result and determining the next production step according to the identifier in the execution result;
constructing the execution result according to the message template of the next production step to obtain a message of the next production step;
sending the message of the next production step to a node server corresponding to the next production step;
and continuing to receive the execution result until the last production step is completed.
8. The system according to claim 7, wherein the central server is specifically configured to determine a next production step according to an identifier with a highest priority among the two or more identifiers if the execution result includes two or more identifiers.
9. An electronic device for obtaining data, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-6.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910616895.4A CN112215529B (en) | 2019-07-09 | 2019-07-09 | Method, system, device and computer readable medium for acquiring data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910616895.4A CN112215529B (en) | 2019-07-09 | 2019-07-09 | Method, system, device and computer readable medium for acquiring data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112215529A true CN112215529A (en) | 2021-01-12 |
| CN112215529B CN112215529B (en) | 2023-11-07 |
Family
ID=74048444
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910616895.4A Active CN112215529B (en) | 2019-07-09 | 2019-07-09 | Method, system, device and computer readable medium for acquiring data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112215529B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030204454A1 (en) * | 2002-04-30 | 2003-10-30 | Lai Chih Chung | System and method for managing received orders |
| RU2008126648A (en) * | 2008-06-30 | 2010-01-10 | Валерий Иванович Стародубцев (RU) | SYSTEM OF ORDERS AND SALES OF GOODS AND SERVICES (OPTIONS), METHOD OF OFFER FOR SALES AND ORDERING, ORDERS, METHOD FOR SALE OF GOODS AND SERVICES |
| CN102572720A (en) * | 2010-12-24 | 2012-07-11 | 中兴通讯股份有限公司 | Method and system for increasing use efficiency of mapping routing table |
| CN107545385A (en) * | 2016-06-29 | 2018-01-05 | 阿里巴巴集团控股有限公司 | Wrap up processing method, logistics processing server, logistics node server and terminal |
| JP2018049395A (en) * | 2016-09-20 | 2018-03-29 | 株式会社東芝 | Job execution control apparatus and program |
| CN108076110A (en) * | 2016-11-14 | 2018-05-25 | 北京京东尚科信息技术有限公司 | Electronic data interchange system and the device comprising electronic data interchange system |
-
2019
- 2019-07-09 CN CN201910616895.4A patent/CN112215529B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030204454A1 (en) * | 2002-04-30 | 2003-10-30 | Lai Chih Chung | System and method for managing received orders |
| RU2008126648A (en) * | 2008-06-30 | 2010-01-10 | Валерий Иванович Стародубцев (RU) | SYSTEM OF ORDERS AND SALES OF GOODS AND SERVICES (OPTIONS), METHOD OF OFFER FOR SALES AND ORDERING, ORDERS, METHOD FOR SALE OF GOODS AND SERVICES |
| CN102572720A (en) * | 2010-12-24 | 2012-07-11 | 中兴通讯股份有限公司 | Method and system for increasing use efficiency of mapping routing table |
| CN107545385A (en) * | 2016-06-29 | 2018-01-05 | 阿里巴巴集团控股有限公司 | Wrap up processing method, logistics processing server, logistics node server and terminal |
| JP2018049395A (en) * | 2016-09-20 | 2018-03-29 | 株式会社東芝 | Job execution control apparatus and program |
| CN108076110A (en) * | 2016-11-14 | 2018-05-25 | 北京京东尚科信息技术有限公司 | Electronic data interchange system and the device comprising electronic data interchange system |
Non-Patent Citations (1)
| Title |
|---|
| 张敬谊;陈诚;童庆;刘龙;: "多方协同应用中基于编排模型的业务流程监控技术的研究与实现", 计算机应用与软件, no. 03, pages 165 - 169 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112215529B (en) | 2023-11-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110866709A (en) | Order combination method and device | |
| CN108897854B (en) | Monitoring method and device for overtime task | |
| CN105187676A (en) | Calling request processing method and device | |
| CN112070330A (en) | Warehouse-out method and device | |
| CN111478781B (en) | Message broadcasting method and device | |
| CN110837409A (en) | Method and system for executing task regularly | |
| CN111784222A (en) | Method and device for processing orders | |
| CN111861298A (en) | Order canceling method and device | |
| CN110389976B (en) | Multi-interface data scheduling method and device | |
| CN113076186B (en) | Task processing method, device, electronic equipment and storage medium | |
| CN110188969B (en) | Method and device for controlling task issuing | |
| CN112101690A (en) | Article sorting method and device | |
| CN110826960B (en) | Order picking method, device, equipment and computer readable medium | |
| CN114971785A (en) | Order processing method and device, electronic equipment and storage medium | |
| CN108985673B (en) | Inventory list generation method and device | |
| CN112215529B (en) | Method, system, device and computer readable medium for acquiring data | |
| CN111260271A (en) | Method and device for shortening order picking time of store | |
| US20230196271A1 (en) | Method and apparatus for processing order data | |
| CN115390958A (en) | Task processing method and device | |
| CN114202210A (en) | Task allocation method and device | |
| CN113743630A (en) | Method and device for executing intelligent call reservation | |
| CN112836201A (en) | Method, device, equipment and computer readable medium for multi-platform information intercommunication | |
| CN113159659A (en) | Method, device, equipment and computer readable medium for updating manifest aging | |
| CN113766437B (en) | Short message sending method and device | |
| CN110555642A (en) | Method and device for determining route starting point |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |