CN112215529B - 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
- CN112215529B CN112215529B CN201910616895.4A CN201910616895A CN112215529B CN 112215529 B CN112215529 B CN 112215529B CN 201910616895 A CN201910616895 A CN 201910616895A CN 112215529 B CN112215529 B CN 112215529B
- Authority
- CN
- China
- Prior art keywords
- production step
- execution result
- node server
- central server
- message
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000004519 manufacturing process Methods 0.000 claims abstract description 274
- 238000012545 processing Methods 0.000 claims abstract description 35
- KLPWJLBORRMFGK-UHFFFAOYSA-N Molindone Chemical compound O=C1C=2C(CC)=C(C)NC=2CCC1CN1CCOCC1 KLPWJLBORRMFGK-UHFFFAOYSA-N 0.000 claims abstract description 11
- 229940028394 moban Drugs 0.000 claims abstract description 11
- 238000003860 storage Methods 0.000 claims description 12
- 238000004590 computer program Methods 0.000 claims description 9
- 238000004364 calculation method Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 22
- 238000012552 review Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 238000009331 sowing Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 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
- 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
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000004807 localization Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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
Landscapes
- Business, Economics & Management (AREA)
- Economics (AREA)
- Engineering & Computer Science (AREA)
- Marketing (AREA)
- Quality & Reliability (AREA)
- Finance (AREA)
- Entrepreneurship & Innovation (AREA)
- Human Resources & Organizations (AREA)
- Accounting & Taxation (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Factory Administration (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method, a system, equipment and a computer readable medium for acquiring data, relating to the technical field of warehousing. One embodiment of the method comprises the following steps: the node server receives a message indicating one 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 report Wen Moban of the next production step to obtain a 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; and the central server continues to receive the execution result until the last production step is completed. This embodiment can 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, an apparatus, and a computer readable medium for acquiring data.
Background
After the manifest is downloaded to the warehousing system, the manifest is subjected to warehouse-out operation. The shipment is a collective term for the steps performed when the item leaves the warehouse. Each step is a production link. In one step the production result is sent to the next step. Finally, the warehouse-out is completed.
In the process of implementing the present invention, the inventor finds that at least the following problems exist in the prior art: each step is connected in a closed loop, and the ex-warehouse data of the manifest can be obtained after the last step is executed.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method, system, apparatus, and computer-readable medium for acquiring data, capable of obtaining an execution result of each production step.
To achieve the above object, according to one aspect of the embodiments of the present invention, there is provided a method for acquiring data, including:
the node server receives a message indicating one 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 report Wen Moban of the next production step to obtain a 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;
and the central server continues to receive the execution result until the last production step is completed.
The method further comprises the steps of:
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 steps of:
when deleting the node server corresponding to the deleted production step, the central server deletes the identification of the deleted production step and the corresponding relation between the node server corresponding to the deleted production step and the message template of the deleted production step.
The order of the production steps is preset based on the manifest processing task.
The step of determining the next production step according to the identification in the execution result 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 includes one or more of the following steps: nodes, positioning, package calculation, task allocation, picking, rechecking and shipping.
According to a second aspect of an embodiment of the present invention, there is provided a system for acquiring data, including:
the node server is used for receiving a message indicating one 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 identification in the execution result;
constructing the execution result according to the report Wen Moban of the next production step to obtain a message of the next production step;
the message of the next production step is sent 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 a mark with a highest priority among the two or more marks when the execution result includes the two or more marks.
According to a third aspect of an embodiment of the present invention, there is provided an electronic device that acquires data, including:
one or more processors;
storage means for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the methods as described above.
According to a fourth aspect of embodiments of the present invention, there is provided a computer readable medium having stored thereon a computer program which when executed by a processor implements a 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 center 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 report Wen Moban of the next production step to obtain a message of the next production step; the central server sends the message of the next production step to the 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 through 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-described non-conventional alternatives are 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 a step of leaving a warehouse according to an embodiment of the invention;
FIG. 2 is a schematic diagram of the main flow of a method of acquiring data according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a connection of a central server to node servers according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of another step of leaving a warehouse according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of yet another step of delivery according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a warehouse-out employing a central server in accordance with an embodiment of the present invention;
FIG. 7 is a schematic diagram of interactions of a central server with node servers 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 applied;
fig. 10 is a schematic diagram of a computer system suitable for use in implementing an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which various details of the embodiments of the present invention are included to facilitate understanding, and are to be considered 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 warehouse-out operation. The bill delivery includes a plurality of production steps, each of which is connected sequentially. 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 a step of delivery according to an embodiment of the present invention, an exemplary delivery comprising the following production steps: nodes, positioning, package calculation, task allocation, picking, rechecking and shipping.
Wherein each production step is closed loop connected. It is understood that each production step may be a separate step. Each production step directly transmits 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 ex-warehouse data of the manifest can only be obtained in 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 solutions in the embodiments of the present invention may 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, and a node server sends an execution result of a production step to a central server. The central server builds 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 comprises the following steps:
s201, the node server receives a message indicating one 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. The central server and the node servers interact data through a remote procedure call protocol (Remote Procedure Call, RPC). A node server may perform manifest handling tasks in a production step. The ex-warehouse comprises a plurality of production steps, and each production step is respectively executed by one node server.
Referring to fig. 3, fig. 3 is a schematic diagram illustrating connection between a central server and node servers according to an embodiment of the present invention. The central server is coupled to node server a, node server b, node server c, node server d, and node server d, respectively.
Wherein the node server in fig. 3 is used to perform the production steps in the out-warehouse. Exemplary production steps include order receiving, positioning, task allocation, picking and review; the execution sequence of the production steps is as follows: order receiving, positioning, task allocation, picking and rechecking.
The node server a performs the following production steps: receiving a bill; the node server b performs the following production steps: positioning; the node server c performs the following production steps: task allocation; the node server d performs the following production steps: picking up goods; the node server e performs the following production steps: 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 the node server receives the message, the manifest processing task can be executed. As an example, the node server b performs the following production steps: and if so, the message comprises a manifest positioning task. The node server b performs the manifest localization 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 result of execution of the production step is sent to the center server through the PRC.
In one embodiment of the invention, the order between production steps is preset based on the manifest handling tasks. As an example, the manifest processing task one includes a production step a and a production step b, and is preset to execute the production step b first and then execute the production step a. In this way, different manifest handling tasks can be handled as needed.
S202, the central server receives and stores the execution result, and determines the next production step according to the identification in the execution result.
The center server receives and stores the execution result sent by the node server. The central server determines the next production step, and sends the received execution result to the next production step for processing.
The execution result of the production step includes a flag, by which the next production step can be known. It should be noted that the above-mentioned identification is recorded in the central server in advance. As one example, including the pick identifier in the execution result of the production step, the next production step is determined to be: and (5) picking.
In one embodiment of the present invention, in the case where two or more markers are included in the execution result of the production steps, since the next production step is determined in accordance with the markers, the priorities of the markers need to be compared. And taking the mark with the highest priority in the more than two marks as the mark for determining the next production step. Wherein, the priority of the identification can be preset.
As an example, the production steps are preset: the priority of the positioning mark is higher than that of the production steps: review identifies priority. The execution result of the production step comprises a positioning mark and a rechecking mark, and the next production step is determined as follows because the priority of the positioning mark is higher than that of the rechecking mark: and (5) positioning.
In the above embodiment, the next production step may be determined in time according to the identification priority.
In the case where the center server receives the execution result, the execution result may also be stored. The execution result is the execution result of the production step sent by the node server to the center server. As one example, the center 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 result of all production steps of one manifest. Thus, the execution result of each production step can be known at the manifest center
S203, the central server constructs a message of the next production step according to the report Wen Moban of the next production step.
Because the node servers do not directly interact with each other, the execution results of the node servers need to be sent to the node server in the next production step in the form of messages 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 constructing a message for the next production step based on the message template of the production step and the execution result.
As an example, for the next production step: positioning, wherein the message template comprises: a service list number; class (SKU) number; the number of items; storing a position number; batch numbering; date of production; shelf life, etc. Based on the execution result sent by the node server, a message of the next production step is constructed according to the message template.
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. In particular, the central server may send the message of the next production step to the node server of the next production step, which may perform 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 with the central server continues to send 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 there is a next production step, then continues to execute S202; 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 center server receiving node server transmits the execution result of the production step. On the 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. Thus, the execution result of each production step can be known.
In one embodiment of the invention, the order between the production steps is preset. As one example, with continued reference to fig. 3, the production steps include order taking, positioning, task allocation, picking, and review; the execution sequence of the production steps is as follows: order receiving, positioning, task allocation, picking and rechecking.
It will be appreciated that following the production steps in fig. 3, the next production step after receipt is positioning; the next production step after positioning is task allocation; the next production step of task allocation is picking; the next production step of picking is review. Review is the last production step.
In the production steps in fig. 3, a production step is added: and (5) sub-sowing. The sub-sowing is to place the articles at preset positions. Then, on the basis of 5 node servers in fig. 3, a node server f is added. The node server f is coupled to a central server. The node server f performs the following production steps: and (5) sub-sowing.
It can be understood that when there is a node server corresponding to the newly added production step, the central server records the identifier of the newly added production step and the correspondence between the node server corresponding to the newly added production step and the message template of the newly added production step. Thus, the server can determine the newly added production auxiliary according to the mark of the newly added production step. 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 steps: after the sub-broadcasting, the central server determines that the next production step is the sub-broadcasting according to the sub-broadcasting identification in the execution result, and then constructs a sub-broadcasting message according to the sub-broadcasting message Wen Moban. And then, sending the separated message to the separated broadcast, and outputting an execution result.
In one embodiment of the present invention, one of the production steps needs to be deleted, and then the node server is deleted based on the existing node server. That is, when the node server corresponding to the deleted production step is deleted, the center server deletes the above-described identification of the deleted production step, and 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 step of leaving a warehouse according to an embodiment of the present invention. Each square in fig. 4 represents a production step. Each production step is connected in a closed loop, and the ex-warehouse data can be obtained only after the final production step is checked.
Referring to fig. 5, fig. 5 is a schematic diagram of yet another step of delivery according to an embodiment of the present invention. Fig. 5 is a partial view of the production steps of fig. 4. After the production step order is received, the production step unicast can be performed; after the production step is disseminated, a production step review may be performed.
As can be seen from fig. 5, after the new production steps, it is difficult to avoid the adjustment of 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 multicasting.
Referring to fig. 6, fig. 6 is a schematic diagram of a delivery using a central server according to an embodiment of the present invention. In fig. 6, according to the technical scheme of the embodiment of the present invention, the node servers in each production step are respectively coupled with the central server, and the node servers receive the tasks and send the execution results to the central server.
The node server a performs the following production steps: receiving a bill; the node server b performs the following production steps: positioning; the node server c performs the following production steps: task allocation; the node server d performs the following production steps: picking up goods; the node server e performs the following production steps: rechecking; the node server f performs the following production steps: and (5) sub-sowing.
Specifically, the node server a transmits manifest integrity information to the center server. The central server determines the next production step to locate and sends the located message to the node server b, and stores the manifest completion information.
The node server b receives the positioning message, executes the manifest positioning task and sends a positioning result to the center server. 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. The central server determines the next production step to pick up the goods, and sends the picking message to the node server d, and stores the task information.
The node server d receives the order picking message, executes the order picking task and sends the order picking result to the center server. The central server determines the next production step to review and sends the message of review to the node server e, and stores the picking result.
And the node server e receives the rechecking message, executes the rechecking task and sends the rechecking result to the central server. The central server determines the rechecking as 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 of the production steps below the central server of fig. 6, the newly added production steps are distributed.
Specifically, the node server a transmits manifest integrity information to the center server. The center server determines the next production step of the sub-broadcasting, and sends the sub-broadcasting message to the node server f, and stores the manifest completion information.
And the node server f receives the multicast message, executes the multicast task and sends a multicast result to the central server. The center server determines the next production step to review, sends the message of review to the node server e, and stores the multicast result.
And the node server e receives the rechecking message, executes the rechecking task and sends the rechecking result to the central server. The central server determines the rechecking as the last production step and stores the rechecking result.
In the above steps, the central server determines the next production step, and sends a message of the next production step, and stores the execution result. For each node server, the next production step is not needed to be considered, and only the execution result is needed to be sent to the central server. And further, the execution result of each production step can be known through the central server. In the case of a new production step, the relationship between the existing node server and the center server need not be modified, and only the node server of the new production step needs to be coupled with the center server.
Referring to fig. 7, fig. 7 is a schematic diagram illustrating interaction between a central server and node servers according to an embodiment of the present invention. Wherein the central server is coupled to node server a, node server b, node server c, node server d, and node server e, respectively.
The node server a performs the following production steps: receiving a bill; the node server b performs the following production steps: positioning; the node server c performs the following production steps: sowing separately; the node server d performs the following production steps: task allocation; the node server e performs the following production steps: and interfacing with a third party device.
The node server a receives the manifest and initializes the manifest information. The node server a transmits manifest information to the center server. As one example, manifest information includes: a manifest number; a delivery priority; the time of ex-warehouse; an article number; the number of items; whether to sequence the items, etc.
The center 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, and a positioning message needs to be assembled to send a positioning request to the node server b. As one example, the location message includes: a service list number; a positioning type; SKU number; the number of items; whether to allow for ullage, etc.
The node server b receives the positioning request and sends the positioning result to the central server. As one example, the positioning results include: a service list number; SKU number; the number of items; storing a position number; batch numbering; whether or not to preserve shelf life; date of production; expiration date, etc.
The center server receives the positioning result, judges that the positioning result comprises the third party equipment identifier, needs to assemble equipment messages and sends the equipment messages to the node server e. As one example, the device message includes: a manifest number; an article number; the number of items; batch numbering; delivery priority, etc.
And after receiving the equipment message, the node server e produces a manifest.
The central server receives the positioning result, judges that the positioning result comprises a task allocation identifier, needs to assemble a task allocation message, and sends the task allocation message to the node server d. As one example, the task allocation message includes: a manifest number; an article number; batch numbering; a special manifest identification; SKU number; the number of items; batch number, etc.
And after receiving the task allocation message, the node server d establishes a to-be-allocated manifest pool.
The center server receives the manifest information sent by the node server a, judges whether the manifest information comprises a more-warehouse identifier, and if the manifest information comprises the more-warehouse identifier, the manifest needs to be more-warehouse and out of warehouse, and a broadcast message needs to be assembled and sent to the node server c. As one example, the unicast message includes: a manifest number; SKU number; the number of items; priority, etc.
And after receiving the multicast message, the node server c establishes a to-be-multicast manifest.
In the embodiment of fig. 7, each node server is coupled to a central server, the central server determines the next production step based on the identification, and sends a message to the node server for the next production step. The center server has a plurality of execution results of the production steps, so that 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, as shown in fig. 8, where the system for acquiring data specifically includes:
the node server 801 is configured to receive a message indicating a production step of a manifest processing task, execute the manifest processing task, and send an execution result through a remote procedure call protocol.
The central server 802 is configured to receive and store the execution result, and determine a next production step according to the identifier in the execution result;
constructing a message of the next production step according to the report Wen Moban of the next production step;
the message of the next production step is sent 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 one embodiment of the present invention, the central server 802 is further configured to record, when there is a node server corresponding to the new production step, an identifier of the new production step and a correspondence between the node server corresponding to the new production step and a message template of the new production step.
In one embodiment of the present invention, the central server 802 is further configured to delete the identifier of the deleted production step and the correspondence between the node server corresponding to the deleted production step and the message template of the deleted production step when deleting the node server corresponding to the deleted production step.
In one embodiment of the invention, the order of the production steps is preset based on the manifest handling tasks.
In one 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 of the two or more identifiers when the execution result includes the two or more identifiers.
In one embodiment of the invention, the step of producing comprises one or more of the following steps: nodes, positioning, package calculation, task allocation, picking, rechecking and shipping.
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, system architecture 900 may include terminal devices 901, 902, 903, a network 904, and a server 905. The network 904 is the medium used to provide communications links between the terminal devices 901, 902, 903 and the server 905. The network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
A user may interact with the server 905 over the network 904 using the terminal devices 901, 902, 903 to receive or send messages, etc. Various communication client applications may be installed on the terminal devices 901, 902, 903, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients, social platform software, and the like (by way of example only).
Terminal devices 901, 902, 903 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 905 may be a server that provides various services, such as a background management server (by way of example only) that provides support for shopping-type websites browsed by users using terminal devices 901, 902, 903. The background management server may analyze and process the received data such as the product information query request, and feedback the processing result (e.g., the target push information, the product information—only an example) to the terminal device.
It should be noted that, the method for acquiring data provided in 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, there is illustrated a schematic diagram of a computer system 1000 suitable for use in implementing an embodiment of the present invention. The terminal device shown in fig. 10 is only an example, and should not impose any limitation on the functions and the scope of use of the embodiment of the present invention.
As shown in fig. 10, the computer system 1000 includes a Central Processing Unit (CPU) 1001, which can execute 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 required for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other by 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 portion 1007 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), etc., and a speaker, etc.; a storage portion 1008 including a hard disk or 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 drive 1010 is also connected to the I/O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is installed as needed in the drive 1010, so that a computer program read out therefrom is installed as needed in the storage section 1008.
In particular, according to embodiments of the present disclosure, the processes described above with reference to 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 shown in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 1009, and/or installed from the removable medium 1011. The above-described functions defined in the system of the present invention are performed when the computer program is executed by a Central Processing Unit (CPU) 1001.
The computer readable medium shown in the present invention may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 context of this document, 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, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. 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 flowcharts 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 involved in the embodiments of the present invention may be implemented in software or in hardware. The described modules may also be provided in a processor, for example, as: a processor includes a transmitting unit, an acquiring unit, a determining unit, and a first processing unit. The names of these units do not constitute a limitation on the unit itself in some cases, and for example, the transmitting unit may also be described as "a unit that transmits 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 present alone without being fitted into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to include:
the node server receives a message indicating one 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 report Wen Moban of the next production step to obtain a 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;
and the central server continues to receive the execution result 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 report Wen Moban of the next production step to obtain a message of the next production step; the central server sends the message of the next production step to the 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 through 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 embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives can occur depending upon design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.
Claims (9)
1. A method of acquiring data, comprising:
the node server receives a message indicating one production step of the manifest processing task, executes the manifest processing task, sends an execution result to the central server through a remote procedure call protocol, executes the manifest processing task in one production step, and the out-warehouse comprises a plurality of production steps, wherein each production step is executed by one node server, and the production steps comprise one or more of the following steps: nodes, positioning, parcel calculation, task allocation, picking, rechecking and shipping;
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 report Wen Moban of the next production step to obtain a 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;
and the central server continues to receive the execution result until the last production step is completed.
2. The method of acquiring data according to claim 1, wherein the method further comprises:
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 according to claim 1, wherein the method further comprises:
when deleting the node server corresponding to the deleted production step, the central server deletes the identification of the deleted production step and the corresponding relation between the node server corresponding to the deleted production step and the message template of the deleted production step.
4. The method 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 said determining a 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. A system for acquiring data, comprising:
the node server is used for receiving a message indicating one production step of the manifest processing task, executing the manifest processing task, sending an execution result through a remote procedure call protocol, executing the manifest processing task in one production step by one node server, and leaving a warehouse, wherein each production step is respectively executed by one node server, and the production steps comprise one or more of the following steps: nodes, positioning, parcel calculation, task allocation, picking, rechecking and shipping;
the central server is used for receiving and storing the execution result and determining the next production step according to the identification in the execution result;
constructing the execution result according to the report Wen Moban of the next production step to obtain a message of the next production step;
the message of the next production step is sent to a node server corresponding to the next production step;
and continuing to receive the execution result until the last production step is completed.
7. The system according to claim 6, wherein the central server is specifically configured to determine the next production step according to the identifier with the highest priority among the two or more identifiers when the execution result includes the two or more identifiers.
8. An electronic device for acquiring data, comprising:
one or more processors;
storage means for storing one or more programs,
when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-5.
9. A computer readable medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements the method according to any of claims 1-5.
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 CN112215529A (en) | 2021-01-12 |
| CN112215529B true 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 (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI235307B (en) * | 2002-04-30 | 2005-07-01 | Hon Hai Prec Ind Co Ltd | An order processing system and method |
-
2019
- 2019-07-09 CN CN201910616895.4A patent/CN112215529B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| 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 |
|---|
| 多方协同应用中基于编排模型的业务流程监控技术的研究与实现;张敬谊;陈诚;童庆;刘龙;;计算机应用与软件(03);第165-169页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112215529A (en) | 2021-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110837409B (en) | Method and system for executing tasks at fixed time | |
| CN110866709A (en) | Order combination method and device | |
| CN111038906B (en) | Order sorting method and device | |
| CN110572422B (en) | Data downloading method, device, equipment and medium | |
| CN111861298A (en) | Order canceling method and device | |
| CN111478781B (en) | Message broadcasting method and device | |
| CN115951923B (en) | Subscription event management method, display system, device and storage medium | |
| CN110188969B (en) | Method and device for controlling task issuing | |
| CN113765958B (en) | Job task processing method and job client | |
| CN110798495B (en) | Method and server for end-to-end message push in cluster architecture mode | |
| CN112215529B (en) | Method, system, device and computer readable medium for acquiring data | |
| CN110826960B (en) | Order picking method, device, equipment and computer readable medium | |
| US20230196271A1 (en) | Method and apparatus for processing order data | |
| CN114971785A (en) | Order processing method and device, electronic equipment and storage medium | |
| CN112306791B (en) | Performance monitoring method and device | |
| CN113157461B (en) | Method and device for transmitting message in task list execution process | |
| CN112836201A (en) | Method, device, equipment and computer readable medium for multi-platform information intercommunication | |
| CN113743630A (en) | Method and device for executing intelligent call reservation | |
| CN113766437B (en) | Short message sending method and device | |
| CN112214731B (en) | Method and device for determining target set | |
| CN112528176A (en) | Information object validity detection method, device and system | |
| CN111861295B (en) | Method and apparatus for cargo handling | |
| CN116596636A (en) | Order solicitation processing method and device | |
| CN112311833B (en) | Data updating method and device | |
| CN110120958B (en) | Task pushing method and device based on crowdsourcing mode |
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 |