CN110928944B - Data processing method and device - Google Patents
Data processing method and device Download PDFInfo
- Publication number
- CN110928944B CN110928944B CN201811002408.7A CN201811002408A CN110928944B CN 110928944 B CN110928944 B CN 110928944B CN 201811002408 A CN201811002408 A CN 201811002408A CN 110928944 B CN110928944 B CN 110928944B
- Authority
- CN
- China
- Prior art keywords
- request
- copy
- copies
- request copy
- user
- 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
- 238000003672 processing method Methods 0.000 title abstract description 14
- 238000000034 method Methods 0.000 claims abstract description 41
- 230000004044 response Effects 0.000 claims description 67
- 238000012545 processing Methods 0.000 claims description 20
- 230000007246 mechanism Effects 0.000 abstract description 4
- 238000010586 diagram Methods 0.000 description 11
- 238000004590 computer program Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 8
- 230000006870 function Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 238000011161 development Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Abstract
The application discloses a data processing method and a device thereof. The method comprises the following steps: determining whether a request copy queue comprising 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 sent by the application program; and if so, respectively sending each request copy in the request copy queue to a corresponding target application. By adopting the method and the device, the request copy can be processed by setting the reserved area, specifically, unified scheduling is performed on the request copy in the reserved area 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 disclosure relates to the field of computer technologies, and in particular, to a data processing method and apparatus thereof.
Background
With the development of the internet, daily software is increasingly biased to web applications, while with the diversification of our access front-ends (e.g., mobile terminals, computers, etc.), web applications are becoming more convenient and popular, and correspondingly, the front-end and the back-end are developed and formed separately, so as to provide a unified interface for different front-ends, and the application is usually implemented by adopting an API architecture. On the premise, the front end and the back end interact very frequently. There are cases where front-end and back-end data are inconsistent due to network jitter or slow processing of components, etc., for example, after a user makes a request to a back-end server via a front-end (e.g., a mobile terminal), the front-end does not receive a response issued by the back-end server in a short time although the back-end server performs an operation for the request. Therefore, a technical solution capable of implementing front-end and back-end data consistency is needed in the prior art.
Disclosure of Invention
The present invention provides a data processing method and device, and aims to solve the above-mentioned problem that front-end and back-end data are inconsistent.
An exemplary embodiment of the present application provides a data processing method, including: determining whether a request copy queue comprising 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 sent by the application program; and if so, respectively sending each request copy in the request copy queue to a corresponding target application.
Another exemplary embodiment of the present application is a computer readable storage medium having stored thereon computer instructions, characterized in that 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 comprising 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 sent by the application program; and if so, respectively sending each request copy in the request copy queue to a corresponding target application.
An exemplary embodiment of the present application provides a data processing method, including: writing a copy of a user request corresponding to the user request from the source application into the reserved area; transmitting a user request copy group comprising the user request copy in the reserved area to a corresponding target application; judging whether response information is received from a corresponding target application; and if the 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 stored thereon computer instructions, characterized in that 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 copy of a user request corresponding to the user request from the source application into the reserved area; transmitting a user request copy group comprising the user request copy in the reserved area to a corresponding target application; judging whether response information is received from a corresponding target application; and if the response information is received, updating the reserved area according to the response information. The above-mentioned at least one technical scheme that this application embodiment adopted can reach following beneficial effect:
the data processing method and the device thereof of the exemplary embodiment of the application process the request copy 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.
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 embodiments of the application and together with the description serve to explain the application and do not constitute an undue limitation to the application. In the drawings:
FIG. 1 is a flow chart 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 according to an exemplary embodiment of the present application;
FIG. 3 is a scene graph illustrating an 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
For the purposes, technical solutions and advantages of the present application, the technical solutions of the present application will be clearly and completely described below with reference to specific embodiments of the present application and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The following describes in detail the technical solutions provided by the embodiments of the present application 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 described in fig. 1, at step S110, it is determined whether a request copy queue including one or more request copies corresponding to one or more data requests issued by an application program exists in a reserved area corresponding to the application program. Specifically, a reserved area for an application may be set first. The reserved area is an area preset by a user (e.g., technician) as needed. For example, the reserved area is typically set in a database server, so that the request data is effectively prevented from being lost due to server abnormality of the application program. Subsequently, in response to the application program issuing a data request, 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 in connection with fig. 2.
As shown in fig. 2, each request copy may include identification information of each request copy, content of a 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 target application information depends on the number of 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 contents for each target application determined by the data request.
For example, assuming that a certain payment application program sends a request, the request content is "pay B user 10 money", and the request content corresponds to two target applications, after both target applications need to return response information, a request copy corresponding to the request may be cleared from a reserved area, and 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 a balance 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 is included in the request copy. Thus, the copy of the request corresponding to the request may be 134332435, "pay B user ten money", "confirm a balance greater than 10, NULL", "complete 10 transfers, NULL". When the response information of the corresponding target application is obtained, the target application information of the request copy may be correspondingly modified, for example, when the response information is received from the target application X, the request 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 message from the target application Y, the copy 134332435 of the request, "ten money paid to user B", "confirm a balance greater than 10, SUCCESS", "complete 10 transfers, NULL" is modified to 134332435, "ten money paid to user B", "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 means of polling, for example, whether a request copy/request copy queue exists in the reserved area may be periodically determined by means of setting a timer (timer). In particular, a polling rate may be determined based on a network environment, which may include network packet loss rates, network load conditions, etc., followed by periodically determining whether there is a request copy queue including one or more request copies in the reserved area according to the determined polling rate.
For example, in the case where it is determined that the network packet loss rate is greater than 10%, the requested copies in the reserved area may be polled at a rate of at most 600 requests per second, if 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, if the network packet loss rate is greater than 90%, the requested copies in the reserved area may be polled at a rate of at most 0 requests per second, that is, if the packet loss rate is greater than 90%.
According to an exemplary embodiment of the present application, the request copies in the request copy queue may be further ordered, that is, the priority of the request copies may be determined, for example, the priority of each request copy may be determined according to the generation time of each request copy, the priority may be higher as the generation time is longer, or the priority may be higher as the number of target applications corresponding to each request copy is greater, 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 may be determined according to the level of the user who issued the request, for example, the priority of the request copy corresponding to the data request issued by the vip user is high. In addition, the priority of the request copies may be set according to two or more criteria. In summary, each request copy in the request copy queue may be prioritized by one or a combination of a time of generation of each request copy in the request copy queue, a number of corresponding target applications, a type of corresponding data request, and a level of caller.
If it is determined in step S110 that there is a request copy queue including one or more request copies in the reserved area, step S120 is performed, and in step S120, the request copies in the request copy queue are respectively sent to the corresponding target applications. After the request copies in the request copy queues are respectively sent to the corresponding target applications, two situations may be faced: the first case is that response information from the target application is received within a predetermined period of time, and the second case is that response information from the target application is not received within a predetermined period of time.
The first case illustrates that the application program successfully sends a request to the target application, and the target application successfully returns response information to the request to the application program after successfully processing the request, so that the application program can clear a request copy corresponding to the request in a reserved area, for example, data related to the request copy can be directly released from a database. Alternatively, the application program may update the database accordingly based on the response information from the target application.
The second case illustrates that the application program 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 processed the request, but fails to send response information to the application program 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, respectively, no response information from the corresponding target application is received within a predetermined period of time, and the request copy that does not receive the response information is retained in the reserved area. Subsequently, step S110 may continue to be performed until no copy of the request exists within the reserved area. That is, as long as there is still a copy of the request within the reserved area, the request may be sent in a loop to the target application corresponding to the copy of the request.
Alternatively, the predetermined period of time is set by a user (e.g., technician) as needed in an actual application, and for example, the predetermined period of time may be set to 0.3 microseconds.
In order to more clearly illustrate exemplary embodiments of the present application, further explanation will be made below with reference to fig. 3, fig. 3 showing a scene diagram to which a data processing method according to exemplary embodiments of the present application is applied.
As shown in fig. 3, the request 1, the request 2, the request 3, and the request 4 issued by the terminal 100 generate the request copy 1, the request copy 2, the request copy 3, and the request copy 4 in the reserved area, 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 situations.
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, resulting in the terminal 100 failing to receive the response information within a predetermined period of time, so that 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 thus the terminal 100 fails to receive the response information within a predetermined period of time, so that the request copy 4 continues to remain in the reserved area.
As such, there are also request copies 3 and 4 in the reserved area, and then the terminal 100 may periodically transmit the request copies 3 and 4 to the terminals 300 and 400, respectively, until there is no request copy in the reserved area.
It should be noted that at this point the terminal 100 may continuously issue data requests while generating request copies within the reserved area, such that the generated request copies may be ordered chronologically behind the request copies 4, 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, the method including: writing a copy of a user request corresponding to the user request from the source application into the reserved area; transmitting a user request copy group comprising the user request copy in the reserved area to a corresponding target application; judging whether response information is received from a corresponding target application; and if the 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, clearing the copy of the user request corresponding to the response information in the reserved area according to the response information.
Optionally, if no response information is received, copies of the user request in the reserved area and the user request in which no response information is received 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 another user request; and adding the other user request copy to the user request copy group.
Optionally, the user request copy includes identification information of the user request copy, content requested by the user, and target application information respectively corresponding to each target application included in the content requested by the user.
In summary, the data processing method of 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 the retry mechanism, thereby ensuring the data consistency of the front end and the back end. Further, by prioritizing the request copies in the request copy queue, more desirable requests may be sent preferentially to the application, meeting development needs.
In order to more clearly understand the inventive concept of the exemplary embodiments of the present application, a block diagram of the data processing apparatus of the exemplary embodiments of the present application will be described below with reference to fig. 4. Those of ordinary skill in the art will appreciate that: the apparatus in fig. 4 only shows components related to the present exemplary embodiment, and general components other than those shown in fig. 4 are included in the apparatus.
Fig. 4 shows a block diagram of a data processing apparatus of an exemplary embodiment of the present application. With reference to fig. 4, at the hardware level, the data processing apparatus includes a processor, an internal bus, and a computer readable storage medium, wherein the computer readable storage medium includes volatile memory and nonvolatile memory. The processor reads the corresponding computer program from the non-volatile memory and then runs. Of course, other implementations, such as logic devices or combinations of hardware and software, are not excluded from the present application, that is, the execution subject of the following processing flows is not limited to each logic unit, but may be hardware or logic devices.
Specifically, the processor performs the following operations: determining whether a request copy queue comprising 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 sent by the application program; and if so, respectively sending each request copy in the request copy queue to a corresponding target application.
Optionally, 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 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 sent by the application program in response to the data request; the request copy is added to a request copy queue.
Optionally, the processor after the implementing step sends each request copy in the request copy queue to the corresponding target application respectively includes: receiving response information from the 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, the processor sends the request copies in the request copy queues to the corresponding target applications respectively, including: and setting priority for each request copy in the request copy queue.
Optionally, the step of prioritizing each request copy in the request copy queue 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 corresponding data request and the level of a caller.
Optionally, the step of sending the request copies in the request copy queues to the corresponding target applications by the processor in the implementation step includes: and sending the request copies in the request copy queues to corresponding target applications according to the priority order of each request copy.
Optionally, the determining, by the processor in the implementing step, whether there is a request copy queue including one or more request copies in the reserved area includes: determining a polling speed according to a network environment; periodically determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to the application program according to the determined polling rate.
According to an exemplary embodiment of the present application, the processor may perform the following operations: writing a copy of a user request corresponding to the user request from the source application into the reserved area; transmitting a user request copy group comprising the user request copy in the reserved area to a corresponding target application; judging whether response information is received from a corresponding target application; and if the response information is received, updating the reserved area according to the response information.
Optionally, in the step of implementing, 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, clearing the copy of the user request corresponding to the response information in the reserved area according to the response information.
Optionally, if no response information is received, the processor keeps copies of the user request in the reserved area and not receiving the response information in the reserved area.
Optionally, the processor further comprises performing the steps of: in response to receiving another user request copy from the source application, generating another user request copy corresponding to the another user request; and adding the other user request copy to the user request copy group.
Optionally, the user request copy includes identification information of the user request copy, content requested by the user, and target application information respectively corresponding to each target application included in the content requested by the user. 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 the retry mechanism, thereby ensuring the data consistency of the front end and the back end. Further, by prioritizing the request copies in the request copy queue, more desirable requests may be sent preferentially to the application, meeting development needs.
The execution subjects of the steps of the method provided in embodiment 1 may be the same apparatus, or the method may be executed by different apparatuses. For example, the execution subject of step 21 and step 22 may be device 1, and the execution subject of step 23 may be device 2; for another example, the execution body of step 21 may be device 1, and the execution bodies of step 22 and step 23 may be device 2; etc.
It will be appreciated by those skilled in the art that 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 flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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 one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
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 storage media for a computer 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, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
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 one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
It will be appreciated by those skilled in the art that 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 foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and changes may be made to the present application by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. which are within the spirit and principles of the present application are intended to be included within the scope of the claims of the present application.
Claims (17)
1. A method of data processing, comprising:
periodically determining whether a request copy queue comprising 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 sent by the application program, and the request copies are used for recording request content of each target application in all target applications related to the corresponding data requests and a mark of whether a response is received;
if so, sending a request to a corresponding target application according to each request copy in the request copy queue;
receiving response information of a target application corresponding to a request copy in the request copy queue, and modifying a mark aiming at the target application in the request copy into a received response;
and after receiving response information of all target applications corresponding to the request copies in the request copy queue, clearing the request copies in the reserved area.
2. The method of claim 1, wherein 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 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 content for the target application.
4. The method as recited in claim 1, further comprising:
generating a request copy corresponding to a data request sent by the application program in response to the data request;
the request copy is added to a request copy queue.
5. The method of claim 1, wherein the method further comprises:
and when response information of all target applications corresponding to the request copies in the request copy queue is not received, the request copies are reserved in the reserved area.
6. The method of claim 1, wherein prior to sending the request copies in the request copy queues to the corresponding target applications, respectively, comprises:
and setting priority for each request copy in the request copy queue.
7. The method of claim 6, 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 corresponding data request and the level of a caller.
8. The method of claim 6, wherein sending the request copies in the request copy queues to the corresponding target applications, respectively, comprises:
and sending the request copies in the request copy queues to corresponding target applications according to the priority order of each request copy.
9. The method of claim 1, wherein periodically 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;
periodically determining whether a request copy queue including one or more request copies exists in a reserved area corresponding to the application program according to the determined polling rate.
10. A computer readable storage medium having stored thereon computer instructions, which when executed, implement the method of any of claims 1 to 9.
11. A data processing apparatus, comprising:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method of any of claims 1 to 9.
12. A method of data processing, comprising:
writing a user request copy corresponding to a user request from a source application into a reserved area, wherein the request copy is used for recording request content of each target application in all target applications related to a corresponding data request and a mark of whether a response is received or not;
periodically sending a request to a corresponding target application according to the user request copies included in the user request copy group including the user request copies in the reserved area;
judging whether response information of a target application corresponding to the user request copy in the user request copy group is received or not;
if yes, modifying a mark aiming at the target application in the user request copy to receive a response;
and after receiving response information of all target applications corresponding to the user request copies in the user request copy group, clearing the user request copies in the reserved area.
13. The method as recited in claim 12, further comprising:
and if response information of all target applications corresponding to the user request copies in the user request copy group is not received, keeping the user request copies in the reserved area.
14. The method as recited in claim 12, further comprising:
in response to receiving another user request copy from the source application, generating another user request copy corresponding to the another user request;
and adding the other user request copy to the user request copy group.
15. The method of claim 12, wherein the user request copy includes identification information of the user request copy, content requested by the user, and target application information corresponding to each target application included in the content requested by the user, respectively.
16. A computer readable storage medium having stored thereon computer instructions, which when executed, implement the method of any of claims 12 to 15.
17. A data processing apparatus, comprising:
a processor; and
a memory arranged to store computer executable instructions which, when executed, cause the processor to perform the method of any of claims 12 to 15.
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 CN110928944A (en) | 2020-03-27 |
| CN110928944B true 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) |
Families Citing this family (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 |
|---|
| 陈珉,喻丹丹,涂国庆.分布式数据库系统中数据一致性维护方法研究.国防科技大学学报.2002,(03),79-83. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110928944A (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108829350B (en) | Data migration method and device based on block chain | |
| CN107395665B (en) | Block chain service acceptance and service consensus method and device | |
| US11386014B2 (en) | Method and system for low latency data management | |
| CN109379299B (en) | Method, device and system for limiting data flow | |
| EP3489815B1 (en) | Method and system for low latency data management | |
| CN110968586A (en) | Distributed transaction processing method and device | |
| WO2017092594A1 (en) | Information processing method and device | |
| CN114595186B (en) | Inter-core communication method and communication device of multi-core processor | |
| CN110928887A (en) | Data processing method and device | |
| CN110430142B (en) | Method and device for controlling flow | |
| CN110928944B (en) | Data processing method and device | |
| CN109428682A (en) | A kind of Message Processing confirmation method and device | |
| CN109729121B (en) | Cloud storage system and method for realizing custom data processing in cloud storage system | |
| CN110764930B (en) | Request or response processing method and device based on message mode | |
| CN112579308A (en) | Task processing method and system | |
| CN110620734A (en) | TCP link data processing method and device | |
| CN112583879A (en) | Request processing method, device and system, storage medium and electronic equipment | |
| CN115934292A (en) | Calling method, device and equipment of microservice application | |
| CN108874557B (en) | Front-end interface processing method and system | |
| CN112099976A (en) | Government affair data exchange task scheduling method and device | |
| CN112311898B (en) | Data processing method and device, server and computer readable storage medium | |
| CN113704274B (en) | Data reading method and electronic equipment | |
| CN111435320A (en) | Data processing method and device | |
| CN115174587A (en) | Data transmission system, method and device | |
| CN117834375A (en) | Information processing method, information processing device, electronic 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 |