CN110928944A - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN110928944A CN110928944A CN201811002408.7A CN201811002408A CN110928944A CN 110928944 A CN110928944 A CN 110928944A CN 201811002408 A CN201811002408 A CN 201811002408A CN 110928944 A CN110928944 A CN 110928944A
- Authority
- CN
- China
- Prior art keywords
- request
- copy
- response information
- request copy
- reserved area
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 16
- 238000000034 method Methods 0.000 claims abstract description 40
- 230000004044 response Effects 0.000 claims description 72
- 238000012545 processing Methods 0.000 claims description 18
- 230000007246 mechanism Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 14
- 238000004590 computer program Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 9
- 238000011161 development Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Landscapes
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a data processing method and a device thereof. The method comprises the following steps: determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application program, wherein the one or more request copies correspond to one or more data requests issued by the application program; and if so, respectively sending each request copy in the request copy queue to the corresponding target application. By adopting the method and the device, the request copy can be processed by setting the reserved area, specifically, the request copy in the reserved area is uniformly scheduled by utilizing a retry mechanism, so that the data consistency of the front end and the back end is ensured.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a data processing method and apparatus.
Background
With the development of the internet, software used daily is more and more biased to network application programs, and with the diversification of access front ends (for example, mobile terminals, computers, and the like), network applications become more and more convenient and more popular, and corresponding to the separation of the development and composition of the front end and the back end, in order to provide a uniform interface for different front ends, API architecture is usually adopted for implementation. Under this premise, the interaction between the front end and the back end is very frequent. There are cases where the front-end data and the back-end data are inconsistent due to network jitter or slow component processing, for example, after a user sends a request to a back-end server via a front-end (e.g., a mobile terminal), the back-end server performs an operation for the request, but the front-end does not receive a response sent by the back-end server within a short time. Therefore, there is a need in the art for a solution that can achieve front-end and back-end data consistency.
Disclosure of Invention
The present application mainly aims to provide a data processing method and a device thereof, aiming to solve the above mentioned problem of inconsistent front-end and back-end data.
An exemplary embodiment of the present application provides a data processing method, including: determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application program, wherein the one or more request copies correspond to one or more data requests issued by the application program; and if so, respectively sending each request copy in the request copy queue to the corresponding target application.
Another exemplary embodiment of the present application is a computer-readable storage medium having computer instructions stored thereon, wherein the instructions, when executed, implement the above-described method. Another exemplary embodiment of the present application provides a data processing apparatus including: a processor; and a memory arranged to store computer executable instructions that, when executed, cause the processor to: determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application program, wherein the one or more request copies correspond to one or more data requests issued by the application program; and if so, respectively sending each request copy in the request copy queue to the corresponding target application.
An exemplary embodiment of the present application provides a data processing method, including: writing a user request copy corresponding to a user request from a source application into a reserved area; sending a user request copy group including the user request copy in the reserved area to a corresponding target application; judging whether response information is received from the corresponding target application; and if response information is received, updating the reserved area according to the response information.
Another exemplary embodiment of the present application is a computer-readable storage medium having computer instructions stored thereon, wherein the instructions, when executed, implement the above-described method.
Another exemplary embodiment of the present application provides a data processing apparatus including: a processor; and a memory arranged to store computer executable instructions that, when executed, cause the processor to: writing a user request copy corresponding to a user request from a source application into a reserved area; sending a user request copy group including the user request copy in the reserved area to a corresponding target application; judging whether response information is received from the corresponding target application; and if response information is received, updating the reserved area according to the response information. The embodiment of the application adopts at least one technical scheme which can achieve the following beneficial effects:
the data processing method and the device thereof in the exemplary embodiment of the application process the request copy by setting the reserved area, specifically, perform unified scheduling on the request copy in the reserved area by using a retry mechanism, thereby ensuring the data consistency of the front end and the back end.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a flowchart illustrating a data processing method according to an exemplary embodiment of the present application;
FIG. 2 is a diagram illustrating the structure of a request copy in accordance with an illustrative embodiment of the present application;
FIG. 3 is a scene diagram illustrating the application of a data processing method according to an exemplary embodiment of the present application;
fig. 4 is a block diagram illustrating a data processing apparatus according to an exemplary embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart illustrating a data processing method according to an exemplary embodiment of the present application.
As shown in fig. 1, in step S110, it is determined whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application, wherein the one or more request copies correspond to one or more data requests issued by the application. Specifically, a reserved area for an application may be set first. The reserved area is an area that a user (e.g., a technician) previously sets as needed. For example, the reserved area is usually set in the database server, so that the loss of the requested data due to the server exception of the application program can be effectively prevented. Subsequently, in response to a data request issued by an application program, a request copy corresponding to the data request issued by the application program is generated in the reserved area, and the structure of the request copy will be specifically described below with reference to fig. 2.
As shown in fig. 2, each request copy may include identification information of each request copy, content of the data request corresponding to each request copy, and target application information corresponding to each target application included in the content of the data request, wherein the content of the data request corresponding to each request copy may be obtained according to the data request, and the number of the target application information depends on the number of the target applications involved in the data request. According to an exemplary embodiment of the present invention, the target application information may include a name of each target application and response information corresponding to each target application, and optionally, the target application information may further include request content for each target application determined by the data request.
For example, assuming that a payment application issues a request, the request content is "pay B user 10 money", and the request content corresponds to two target applications, and after both target applications return response information, the request copy corresponding to the request can be cleared from the reserved area, according to the format of the request copy described above, the request copy corresponding to the request includes 134332435, "pay B user ten money", "confirm that the balance of a is greater than 10, NULL", "complete 10 transfers, NULL", where 134332435 is identification information, "pay B user ten money" is the request content of the data request, "complete 10 transfers, NULL" is the target application content corresponding to application X, and "application Y, NULL" is the target application information corresponding to application Y. That is, since the request content corresponds to two target applications (X and Y), two target application information are included in the request copy. Thus, the copy of the request corresponding to the request may be 134332435, "pay for ten money by B user", "confirm that the balance of a is greater than 10, NULL", "complete 10 transfers, NULL". The target application information of the requested copy may be modified accordingly when the response information of the corresponding target application is obtained, e.g., upon receiving the response information from target application X, the requested copy is modified to 134332435, "pay B user ten money", "confirm a balance greater than 10, SUCCESS", "complete 10 transfers, NULL". And upon receiving the response information from the target application Y, will request copy 134332435, "pay B user ten money", "confirm a balance greater than 10, SUCCESS", "complete 10 transfers, NULL" modified to 134332435, "pay B user ten money", "confirm a balance greater than 10, SUCCESS", "complete 10 transfers, SUCCESS". The generated plurality of request copies then form a request copy queue, which may exist in the reserved area in the form of a queue or table.
According to an exemplary embodiment of the present application, whether a request copy/request copy queue exists in the reserved area may be periodically determined by polling, for example, whether a request copy/request copy queue exists in the reserved area may be periodically determined by setting a timer (timer) in a polling manner. Specifically, a polling rate may be determined according to a network environment, which may include a network packet loss rate, a network load condition, and the like, and then, it may be periodically determined whether a request copy queue including one or more request copies exists in the reserved area according to the determined polling rate.
For example, in the case where the network packet loss rate is determined to be greater than 10%, the requested copies in the reserved area may be polled at a rate of at most 600 requests per second, in the case where the network packet loss rate is greater than 50%, the requested copies in the reserved area may be polled at a rate of at most 300 requests per second, in the case where the network packet loss rate is greater than 90%, that is, in the case where the network packet loss rate is greater than 90%, the processing may be suspended.
According to the exemplary embodiments of the present application, the request copies in the request copy queue may also be sorted, that is, the priority of the request copies is determined, for example, the priority of each request copy may be determined according to the generation time of each request copy, the longer the generation time, the higher the priority, or the greater the number, the higher the priority, according to the number of target applications corresponding to each request copy, or the priority of the request copy corresponding to the data request may be determined according to the type of the data request, for example, the priority of the request of the query class may be lower. Or the priority of the request copy corresponding to the data request can be determined according to the level of the requesting user, for example, the priority of the request copy corresponding to the data request sent by the vip user is high. In addition, the priority of the request copies may also be set according to two or more metrics. In summary, each request copy in the request copy queue may be prioritized by one or a combination of a generation time of each request copy, a number of corresponding target applications, a type of corresponding data request, and a level of a caller.
If it is determined in step S110 that a request copy queue including one or more request copies exists in the reserved area, step S120 is performed, and in step S120, the request copies in the request copy queue are respectively sent to corresponding target applications. After the request copies in the request copy queue are respectively sent to the corresponding target applications, two situations may be encountered: the first case is that the response information from the target application is received within a predetermined time period, and the second case is that the response information from the target application is not received within the predetermined time period.
In the first case, the application program successfully sends a request to the target application, and after the target application successfully processes the request, response information to the request is successfully returned to the application program. Optionally, based on the response information from the target application, the application may update the database accordingly.
The second case illustrates that the application successfully makes a request to the target application, but the target application fails to process the request for its own reasons (e.g., processing power or network problems, etc.), or the target application has already processed the request but fails to send a response message to the application within a predetermined time due to network jitter, etc. That is, after each request copy in the request copy queue is sent to the corresponding target application, the response information from the corresponding target application is not received within a predetermined time period, and then the request copy which does not receive the response information is retained in the reserved area. Subsequently, step S110 may be continued until there is no request copy in the reserved area. That is, as long as there is still a copy of the request within the reserved area, the request may be looped to the target application corresponding to the copy of the request.
Optionally, the predetermined time period is set by a user (e.g., a technician) as required in practical applications, for example, the predetermined time period may be set to 0.3 microseconds.
To more clearly illustrate an exemplary embodiment of the present application, further explanation will be made below with reference to fig. 3, and fig. 3 shows a scene diagram of an application of a data processing method according to an exemplary embodiment of the present application.
As shown in fig. 3, request 1, request 2, request 3, and request 4 issued by the terminal 100 generate request copy 1, request copy 2, request copy 3, and request copy 4 within the reserved area, and it should be noted that only 4 request copies are shown in fig. 3 for convenience of explanation, but the number of request copies is not limited thereto. Subsequently, the 4 copies of the request within the reserved area transmit the request to the corresponding terminals 200, 300, and 400, respectively. As can be seen from fig. 3, the request copy faces three cases.
The first case is that the request copy 1 and the request copy 2 are sent to the same terminal 200, the terminal 200 sends response information to the terminal 100 after processing the request copy 1 and the request copy 2, and the terminal 100 updates the database according to the response information and simultaneously clears the request copy 1 and the request copy 2 in the reserved area.
The second case is that after the terminal 100 transmits the request copy 3 to the terminal 300, the terminal 300 responds to the request in the request copy 3, generates response information, and transmits the response information to the terminal 100, but the transmission fails, so that the terminal 100 fails to receive the response information within a predetermined time period, and thus, the request copy 3 continues to remain in the reserved area.
The third case is that after the terminal 100 transmits the request copy 4 to the terminal 400, the terminal 400 fails to respond to the request contained in the request copy 4, and therefore, the terminal 100 fails to receive the response information within a predetermined period of time, and thus, the request copy 4 continues to remain within the reserved area.
As such, the request copy 3 and the request copy 4 also exist within the reserved area, and then the terminal 100 may periodically transmit the request copy 3 and the request copy 4 to the terminal 300 and the terminal 400, respectively, until the request copy does not exist within the reserved area.
It should be noted that at this time, the terminal 100 may continuously issue data requests while generating request copies within the reserved area, so that the generated request copies may be arranged behind the request copy 4 in a time sequence or may be ordered in a sequence preset by the user.
According to an exemplary embodiment of the present application, there is provided a data processing method including: writing a user request copy corresponding to a user request from a source application into a reserved area; sending a user request copy group including the user request copy in the reserved area to a corresponding target application; judging whether response information is received from the corresponding target application; and if response information is received, updating the reserved area according to the response information.
Optionally, if response information is received, updating the reserved area according to the response information includes: and if the response information is received, after the response information is received, removing the user request copy corresponding to the response information in the reserved area according to the response information.
Optionally, if the response information is not received, the user request copy in the reserved area and the user request copy which does not receive the response information are reserved in the reserved area.
Optionally, the method further comprises: in response to receiving another user request copy from the source application, generating another user request copy corresponding to the other user request; adding the other user requested copy to the set of user requested copies.
Optionally, the user request copy includes identification information of the user request copy, content of the user request, and target application information respectively corresponding to each target application included in the content of the user request.
In summary, the data processing method according to the exemplary embodiment of the present application processes the request copy by setting the reserved area, specifically, performs unified scheduling on the request copy in the reserved area by using a retry mechanism, thereby ensuring data consistency between the front end and the back end. Furthermore, by setting priority to the request copies in the request copy queue, the more needed requests can be sent to the application program preferentially, and the development requirement is met.
In order to more clearly understand the inventive concept of the exemplary embodiment of the present application, a block diagram of a data processing apparatus of the exemplary embodiment of the present application will be described below with reference to fig. 4. Those of ordinary skill in the art will understand that: the apparatus in fig. 4 shows only components related to the present exemplary embodiment, and common components other than those shown in fig. 4 are also included in the apparatus.
Fig. 4 shows a block diagram of a data processing device of an exemplary embodiment of the present application. Referring to fig. 4, the data processing apparatus includes a processor, an internal bus, and a computer-readable storage medium including a volatile memory and a non-volatile memory, at a hardware level. The processor reads the corresponding computer program from the non-volatile memory and then runs it. Of course, besides the software implementation, the present application does not exclude other implementations, such as logic devices or a combination of software and hardware, and the like, that is, the execution subject of the following processing flow is not limited to each logic unit, and may also be hardware or logic devices.
Specifically, the processor performs the following operations: determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application program, wherein the one or more request copies correspond to one or more data requests issued by the application program; and if so, respectively sending each request copy in the request copy queue to the corresponding target application.
Optionally, each of the one or more request copies includes identification information of each request copy, content of the data request corresponding to each request copy, and target application information respectively corresponding to each target application included in the content of the data request.
Optionally, the target application information includes a name of the target application, response information corresponding to the target application, and/or request content for the target application.
Optionally, the processor may further perform the following operations: generating a request copy corresponding to a data request in response to the data request issued by the application; adding the request copy to a request copy queue.
Optionally, after the implementing step of sending each request copy in the request copy queue to the corresponding target application, the processor includes: receiving response information from a corresponding target application within a predetermined period of time; and clearing the request copy corresponding to the response information in the reserved area.
Optionally, before the implementing step sends the request copies in the request copy queue to the corresponding target applications, the processor includes: a priority is set for each request copy in the request copy queue.
Optionally, the prioritizing each request copy in the request copy queue by the processor in the implementing step includes: and setting priority for each request copy in the request copy queue according to one or a combination of the generation time of each request copy in the request copy queue, the number of corresponding target applications, the type of the corresponding data request and the level of a caller.
Optionally, the sending, by the processor, the request copies in the request copy queue to the corresponding target applications in the implementing step includes: and respectively sending the request copies in the request copy queue to corresponding target applications according to the priority order of each request copy.
Optionally, the processor, in the step of implementing, determining whether a request copy queue including one or more request copies exists in the reserved area includes: determining a polling speed according to a network environment; and periodically determining whether a request copy queue comprising one or more request copies exists in a reserved area corresponding to the application program according to the determined polling speed.
According to an example embodiment of the present application, the processor may perform the following operations: writing a user request copy corresponding to a user request from a source application into a reserved area; sending a user request copy group including the user request copy in the reserved area to a corresponding target application; judging whether response information is received from the corresponding target application; and if response information is received, updating the reserved area according to the response information.
Optionally, the updating, by the processor in the implementation step, the reserved area according to the response information if the response information is received includes: and if the response information is received, after the response information is received, removing the user request copy corresponding to the response information in the reserved area according to the response information.
Optionally, if the processor does not receive the response information, the processor retains the copy of the user request in the reserved area and the copy of the user request which does not receive the response information in the reserved area.
Optionally, the processor further comprises executing the steps of: in response to receiving another user request copy from the source application, generating another user request copy corresponding to the other user request; adding the other user requested copy to the set of user requested copies.
Optionally, the user request copy includes identification information of the user request copy, content of the user request, and target application information respectively corresponding to each target application included in the content of the user request. In summary, the data processing apparatus according to the exemplary embodiment of the present application processes the request copy by setting the reserved area, specifically, performs unified scheduling on the request copy in the reserved area by using a retry mechanism, thereby ensuring data consistency between the front end and the back end. Furthermore, by setting priority to the request copies in the request copy queue, the more needed requests can be sent to the application program preferentially, and the development requirement is met.
It should be noted that the execution subjects of the steps of the method provided in embodiment 1 may be the same device, or different devices may be used as the execution subjects of the method. For example, the execution subject of steps 21 and 22 may be device 1, and the execution subject of step 23 may be device 2; for another example, the execution subject of step 21 may be device 1, and the execution subjects of steps 22 and 23 may be device 2; and so on.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (19)
1. A data processing method, comprising:
determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to an application program, wherein the one or more request copies correspond to one or more data requests issued by the application program;
and if so, respectively sending each request copy in the request copy queue to the corresponding target application.
2. The method of claim 1, wherein each request copy of the one or more request copies includes identification information of each request copy, content of the data request corresponding to each request copy, and target application information corresponding to each target application included in the content of the data request, respectively.
3. The method of claim 2, wherein the target application information includes a name of the target application, response information corresponding to the target application, and/or request contents for the target application.
4. The method of claim 1, further comprising:
generating a request copy corresponding to a data request in response to the data request issued by the application;
adding the request copy to a request copy queue.
5. The method of claim 1, wherein sending each request copy in the request copy queue to a corresponding target application comprises:
receiving response information from a corresponding target application within a predetermined period of time;
and clearing the request copy corresponding to the response information in the reserved area.
6. The method of claim 1, wherein sending each request copy in the request copy queue to a corresponding target application comprises:
response information from the corresponding target application is not received within a predetermined time period;
and keeping the request copy which does not receive the response information in the reserved area.
7. The method of claim 1, wherein prior to sending the request copies in the request copy queue to the corresponding target applications respectively, comprises:
a priority is set for each request copy in the request copy queue.
8. The method of claim 7, wherein prioritizing each request copy in the request copy queue comprises:
and setting priority for each request copy in the request copy queue according to one or a combination of the generation time of each request copy in the request copy queue, the number of corresponding target applications, the type of the corresponding data request and the level of a caller.
9. The method of claim 7, wherein sending the request copies in the request copy queue to the corresponding target applications respectively comprises:
and respectively sending the request copies in the request copy queue to corresponding target applications according to the priority order of each request copy.
10. The method of claim 1, wherein determining whether a request copy queue comprising one or more request copies exists in the reserved area comprises:
determining a polling speed according to a network environment;
and periodically determining whether a request copy queue comprising one or more request copies exists in a reserved area corresponding to the application program according to the determined polling speed.
11. A computer readable storage medium having computer instructions stored thereon that, when executed, implement the method of any of claims 1 to 10.
12. A data processing apparatus, comprising:
a processor; and
a memory arranged to store computer executable instructions that, when executed, cause the processor to perform the method of any of claims 1 to 10.
13. A data processing method, comprising:
writing a user request copy corresponding to a user request from a source application into a reserved area;
sending a user request copy group including the user request copy in the reserved area to a corresponding target application;
judging whether response information is received from the corresponding target application;
and if response information is received, updating the reserved area according to the response information.
14. The method of claim 13, wherein updating the reserved area according to response information if the response information is received comprises: and if the response information is received, after the response information is received, removing the user request copy corresponding to the response information in the reserved area according to the response information.
15. The method of claim 13, wherein if no response information is received, keeping copies of user requests in the reserved area with no response information received in the reserved area.
16. The method of claim 13, further comprising:
in response to receiving another user request copy from the source application, generating another user request copy corresponding to the other user request;
adding the other user requested copy to the set of user requested copies.
17. The method of claim 13, wherein the user requested copy includes identification information of the user requested copy, content of the user request, and target application information respectively corresponding to each target application included in the content of the user request.
18. A computer readable storage medium having computer instructions stored thereon which, when executed, implement the method of any of claims 13 to 17.
19. A data processing apparatus, comprising:
a processor; and
a memory arranged to store computer executable instructions that, when executed, cause the processor to perform the method of any of claims 13 to 17.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811002408.7A CN110928944B (en) | 2018-08-30 | 2018-08-30 | Data processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811002408.7A CN110928944B (en) | 2018-08-30 | 2018-08-30 | Data processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110928944A true CN110928944A (en) | 2020-03-27 |
| CN110928944B CN110928944B (en) | 2024-04-02 |
Family
ID=69854867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811002408.7A Active CN110928944B (en) | 2018-08-30 | 2018-08-30 | Data processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110928944B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7464503B2 (en) | 2020-11-13 | 2024-04-09 | 株式会社日立製作所 | Data request processing device, data request processing method and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6330625B1 (en) * | 1999-01-15 | 2001-12-11 | Oracle Corporation | System for initiating multiple read operation requests to multiple copies of a data item and identifying a first one of the requests as having the fastest response time |
| CN101651526A (en) * | 2008-08-14 | 2010-02-17 | 武汉光发科技有限公司 | Method for transmitting messages between network equipment |
| CN102368700A (en) * | 2011-10-25 | 2012-03-07 | 曙光信息产业(北京)有限公司 | Transmission method of massages in distributed system |
| CN104885064A (en) * | 2012-08-20 | 2015-09-02 | 国际商业机器公司 | Managing a data cache for a computer system |
| CN105069058A (en) * | 2015-07-24 | 2015-11-18 | 中国地质大学（武汉） | Quick response method of network map request for high-frequency interaction environment |
| CN106130868A (en) * | 2016-06-02 | 2016-11-16 | 腾讯科技（深圳）有限公司 | A kind of processing method adjusting back message and queue management system |
| CN107153671A (en) * | 2016-03-02 | 2017-09-12 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for realizing the read-write of multifile copy in a distributed system |
| CN107180031A (en) * | 2016-03-09 | 2017-09-19 | 华为技术有限公司 | Distributed storage method and device, data processing method and device |
| CN107391268A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | service request processing method and device |
-
2018
- 2018-08-30 CN CN201811002408.7A patent/CN110928944B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6330625B1 (en) * | 1999-01-15 | 2001-12-11 | Oracle Corporation | System for initiating multiple read operation requests to multiple copies of a data item and identifying a first one of the requests as having the fastest response time |
| CN101651526A (en) * | 2008-08-14 | 2010-02-17 | 武汉光发科技有限公司 | Method for transmitting messages between network equipment |
| CN102368700A (en) * | 2011-10-25 | 2012-03-07 | 曙光信息产业(北京)有限公司 | Transmission method of massages in distributed system |
| CN104885064A (en) * | 2012-08-20 | 2015-09-02 | 国际商业机器公司 | Managing a data cache for a computer system |
| CN105069058A (en) * | 2015-07-24 | 2015-11-18 | 中国地质大学（武汉） | Quick response method of network map request for high-frequency interaction environment |
| CN107153671A (en) * | 2016-03-02 | 2017-09-12 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus for realizing the read-write of multifile copy in a distributed system |
| CN107180031A (en) * | 2016-03-09 | 2017-09-19 | 华为技术有限公司 | Distributed storage method and device, data processing method and device |
| CN107391268A (en) * | 2016-05-17 | 2017-11-24 | 阿里巴巴集团控股有限公司 | service request processing method and device |
| CN106130868A (en) * | 2016-06-02 | 2016-11-16 | 腾讯科技（深圳）有限公司 | A kind of processing method adjusting back message and queue management system |
Non-Patent Citations (1)
| Title |
|---|
| 陈珉,喻丹丹,涂国庆: "分布式数据库系统中数据一致性维护方法研究", no. 03, pages 79 - 83 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7464503B2 (en) | 2020-11-13 | 2024-04-09 | 株式会社日立製作所 | Data request processing device, data request processing method and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110928944B (en) | 2024-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109936511B (en) | Token obtaining method, device, server, terminal equipment and medium | |
| US20150120854A1 (en) | Subscriber based priority of messages in a publisher-subscriber domain | |
| CN109379299B (en) | Method, device and system for limiting data flow | |
| CN110968586A (en) | Distributed transaction processing method and device | |
| CN107276970B (en) | Unbinding and binding method and device | |
| CN106844055B (en) | Task execution method and device | |
| CN111737356B (en) | Processing method and device for block chain event | |
| WO2021057666A1 (en) | Transmission control method, network management server, base station and storage medium | |
| CN109254854A (en) | Asynchronous invoking method, computer installation and storage medium | |
| CN107026897B (en) | Data processing method, device and system | |
| CN109428682A (en) | A kind of Message Processing confirmation method and device | |
| CN110764930B (en) | Request or response processing method and device based on message mode | |
| CN106599045B (en) | Request sending method and device | |
| CN110928944A (en) | Data processing method and device | |
| EP3985493A1 (en) | Group member management method and apparatus, group message processing method and apparatus, device, and storage medium | |
| CN110381150B (en) | Data processing method and device on block chain, electronic equipment and storage medium | |
| CN107169752B (en) | Resource transfer method and device | |
| CN115794317B (en) | Processing method, device, equipment and medium based on virtual machine | |
| CN112416534A (en) | Agent-based task management method and device | |
| CN110968406B (en) | Method, device, storage medium and processor for processing task | |
| CN110753006A (en) | Data processing method and device and electronic equipment | |
| CN110895517B (en) | Method, equipment and system for transmitting data based on FPGA | |
| CN112583879A (en) | Request processing method, device and system, storage medium and electronic equipment | |
| CN106899652B (en) | Method and device for pushing service processing result | |
| CN110413427B (en) | Subscription data pulling method, device, equipment and storage medium |
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 |