CN109240878B - Data processing method and device - Google Patents

Data processing method and device Download PDF

Info

Publication number
CN109240878B
CN109240878B CN201810952428.4A CN201810952428A CN109240878B CN 109240878 B CN109240878 B CN 109240878B CN 201810952428 A CN201810952428 A CN 201810952428A CN 109240878 B CN109240878 B CN 109240878B
Authority
CN
China
Prior art keywords
response time
time reference
reference value
value
determining
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
Application number
CN201810952428.4A
Other languages
Chinese (zh)
Other versions
CN109240878A (en
Inventor
沈建林
张晨
宋国强
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jingdong Technology Holding Co Ltd
Original Assignee
JD Digital Technology Holdings Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by JD Digital Technology Holdings Co Ltd filed Critical JD Digital Technology Holdings Co Ltd
Priority to CN201810952428.4A priority Critical patent/CN109240878B/en
Publication of CN109240878A publication Critical patent/CN109240878A/en
Application granted granted Critical
Publication of CN109240878B publication Critical patent/CN109240878B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/3051—Monitoring arrangements for monitoring the configuration of the computing system or of the computing system component, e.g. monitoring the presence of processing resources, peripherals, I/O links, software programs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/3003—Monitoring arrangements specially adapted to the computing system or computing system component being monitored
    • G06F11/302—Monitoring arrangements specially adapted to the computing system or computing system component being monitored where the computing system component is a software system

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The present disclosure provides a data processing method, including: determining at least one response time reference value corresponding to the specific request according to a preset rule; obtaining a response time with respect to the specific request; determining a response time reference value matched with the response time according to the preset rule; and updating a count value corresponding to the matched response time reference value, wherein the count value represents the number of response times matched with the response time reference value.

Description

Data processing method and device
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a data processing method and apparatus.
Background
With the rapid development of scientific technology, various application programs are increasingly applied to many scenes such as work and life. In order to provide better service to users, each application program generally needs to monitor application indexes of the service, such as load (throughput) of the application, response time, error rate, and the like. For example, the minimum response time required by an application for a given percentage (TP) of requests is an important indicator of the quality of service.
In the course of implementing the disclosed concept, the inventor finds that there is at least the following problem in the prior art, that is, when calculating the response time corresponding to the TPn, the prior art needs to sort all the response times related to a certain request first, and then determine the response time corresponding to the corresponding percentage. It can be understood that the calculation of TPn by the sorting algorithm consumes large calculation resources and is low in calculation efficiency.
Disclosure of Invention
In view of the above, the present disclosure provides an optimized data processing method and apparatus.
One aspect of the present disclosure provides a data processing method, including: determining at least one response time reference value corresponding to a specific request according to a preset rule, acquiring response time related to the specific request, determining a response time reference value matched with the response time according to the preset rule, and updating a count value corresponding to the matched response time reference value, wherein the count value represents the number of the response time matched with the response time reference value.
According to an embodiment of the present disclosure, the determining at least one response time reference value with respect to the specific request according to the preset rule includes: determining a plurality of time segment intervals according to the specific request, and determining a plurality of response time reference values based on the processing rule corresponding to each time segment interval.
According to an embodiment of the present disclosure, the determining the response time reference value matched with the response time according to the preset rule includes: and processing the response time according to the preset rule, and determining a response time reference value which is the same as the processed response time as the matched response time reference value.
According to an embodiment of the present disclosure, each of the response time reference values corresponds to a counter, and the updating the count value corresponding to the matched response time reference value includes: and adding 1 to the counter corresponding to the matched response time reference value.
According to an embodiment of the present disclosure, the method further includes: and counting the count value corresponding to the at least one response time reference value according to the statistical parameters.
According to an embodiment of the present disclosure, the counting the count value corresponding to the at least one response time reference value according to the statistical parameter includes: and determining a statistic value according to the statistic parameters and the obtained number of the response time, and determining a response time reference value corresponding to the statistic value according to the count value corresponding to the at least one response time reference value.
According to an embodiment of the present disclosure, the determining the response time reference value corresponding to the statistic according to the count value corresponding to the at least one response time reference value includes: and sequentially accumulating corresponding count values according to the sequence of the at least one response time reference value, and determining the corresponding time reference value corresponding to the statistic value when the count value obtained by accumulation and the statistic value meet the condition.
Another aspect of the present disclosure provides a data processing apparatus including a first determining module, an obtaining module, a second determining module, and an updating module. The first determining module determines at least one response time reference value corresponding to the specific request according to a preset rule. The acquisition module acquires a response time with respect to the specific request. And the second determining module determines a response time reference value matched with the response time according to the preset rule. And the updating module updates a count value corresponding to the matched response time reference value, wherein the count value represents the number of the response times matched with the response time reference value.
According to an embodiment of the present disclosure, the determining at least one response time reference value with respect to the specific request according to the preset rule includes: determining a plurality of time segment intervals according to the specific request, and determining a plurality of response time reference values based on the processing rule corresponding to each time segment interval.
According to an embodiment of the present disclosure, the determining the response time reference value matched with the response time according to the preset rule includes: and processing the response time according to the preset rule, and determining a response time reference value which is the same as the processed response time as the matched response time reference value.
According to an embodiment of the present disclosure, each of the response time reference values corresponds to a counter, and the updating the count value corresponding to the matched response time reference value includes: and adding 1 to the counter corresponding to the matched response time reference value.
According to an embodiment of the present disclosure, the apparatus further includes: and the counting module is used for counting the counting value corresponding to the at least one response time reference value according to the counting parameters.
According to an embodiment of the present disclosure, the counting the count value corresponding to the at least one response time reference value according to the statistical parameter includes: and determining a statistic value according to the statistic parameters and the obtained number of the response time, and determining a response time reference value corresponding to the statistic value according to the count value corresponding to the at least one response time reference value.
According to an embodiment of the present disclosure, the determining the response time reference value corresponding to the statistic according to the count value corresponding to the at least one response time reference value includes: and sequentially accumulating corresponding count values according to the sequence of the at least one response time reference value, and determining the corresponding time reference value corresponding to the statistic value when the count value obtained by accumulation and the statistic value meet the condition.
Another aspect of the present disclosure provides a data processing system comprising: one or more memories storing executable instructions and one or more processors executing the executable instructions to implement the methods described above.
Another aspect of the present disclosure provides a computer-readable storage medium having stored thereon computer-executable instructions for implementing the method as described above when executed.
Another aspect of the disclosure provides a computer program comprising computer executable instructions for implementing the method as described above when executed.
According to the embodiment of the disclosure, the problems of large calculation amount and low calculation efficiency caused by the need of sequencing all response times in the prior art can be at least partially solved, and therefore, the technical effects of reducing the calculation complexity, accelerating the calculation speed and improving the calculation efficiency can be realized by replacing a sequencing algorithm with a statistical count value.
Drawings
The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:
FIG. 1 schematically illustrates an exemplary system architecture to which the data processing methods and apparatus may be applied, according to an embodiment of the present disclosure;
FIG. 2 schematically shows a flow chart of a data processing method according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a schematic diagram of a request and a response request according to an embodiment of the disclosure;
4A-4F schematically illustrate schematic diagrams of data processing according to embodiments of the present disclosure;
FIG. 5 schematically shows a flow chart of a data processing method according to another embodiment of the present disclosure;
FIG. 6 schematically shows a diagram of statistical response time reference values according to an embodiment of the present disclosure;
FIGS. 7A and 7B schematically illustrate block diagrams of data processing apparatus according to embodiments of the disclosure; and
FIG. 8 schematically shows a block diagram of a data processing system according to an embodiment of the present disclosure.
Detailed Description
Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.
All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). It will be further understood by those within the art that virtually any disjunctive word and/or phrase presenting two or more alternative terms, whether in the description, claims, or drawings, should be understood to contemplate the possibilities of including one of the terms, either of the terms, or both terms. For example, the phrase "a or B" should be understood to include the possibility of "a" or "B", or "a and B".
An embodiment of the present disclosure provides a data processing method, including: determining at least one response time reference value corresponding to a specific request according to a preset rule, acquiring the response time related to the specific request, determining the response time reference value matched with the response time according to the preset rule, and updating a count value corresponding to the matched response time reference value, wherein the count value represents the number of the response time matched with the response time reference value.
Fig. 1 schematically illustrates an exemplary system architecture 100 to which the data processing methods and apparatus may be applied, according to an embodiment of the present disclosure.
As shown in fig. 1, the system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 101, 102, 103 to interact with a server 105 over a network 104. Various applications may be installed on the terminal devices 101, 102, 103, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 105 may be a server or a cluster of servers providing various services, for example, a background management server providing support for respective applications. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.
For example, the user may issue a request, such as a login request, or a search request, etc., to the server through the terminal device 101, 102, or 103. The server 105 may respond to the request and record the response time for analysis processing.
It should be noted that the data processing method provided by the embodiment of the present disclosure may be generally executed by the server 105. Accordingly, the data processing apparatus provided by the embodiments of the present disclosure may be generally disposed in the server 105. The data processing method provided by the embodiment of the present disclosure may also be executed by a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the data processing apparatus provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the terminal devices 101, 102, 103 and/or the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.
Fig. 2 schematically shows a flow chart of a data processing method according to an embodiment of the present disclosure.
As shown in fig. 2, the method includes operations S201 to S204.
In operation S201, at least one response time reference value corresponding to a specific request is determined according to a preset rule.
In operation S202, a response time with respect to a specific request is acquired.
In operation S203, a response time reference value to which the response time is matched is determined according to a preset rule.
In operation S204, a count value corresponding to the matched response time reference value is updated, wherein the count value characterizes the number of response times matching the response time reference value.
According to the embodiment of the present disclosure, as shown in fig. 3, a user may send a request to a server through a browser or an application, and the server may parse the user request and send data related to the user request to the user, so as to respond to the user request. For example, a user may enter a web address www.baidu.com in the browser and then enter a car, the browser initiates a request to the server, and the server may respond to the request by sending information about the web address to the browser, thereby completing a response.
In the disclosed embodiments, a respective response time reference value may be created for each type of request. Each type of rule for creating the response time reference value may be the same or different, and specifically, the creation rule may be set according to actual situations.
For example, determining at least one response time reference value with respect to a specific request according to a preset rule may include: the method includes determining a plurality of time segment intervals according to a particular request, and determining a plurality of response time reference values based on a processing rule corresponding to each time segment interval.
For example, a plurality of time segment intervals may be created, within which rounding is performed with corresponding processing rules. For example, assume that the response time for an i-type request is denoted TiFirst, T can beiThe time division method is divided into six time division intervals from a to f, and each division interval can correspond to the following rules:
a) at TiSatisfies 1. ltoreq. TiWhen the temperature is less than or equal to 100, TiOriginal value;
b) at TiT is more than or equal to 101iWhen the content is less than or equal to 1000,
Figure BDA0001770812770000071
c) at TiT is more than or equal to 1001iWhen the content is less than or equal to 5000,
Figure BDA0001770812770000072
d) at TiSatisfies 5001 ≤ TiWhen the content is less than or equal to 30000,
Figure BDA0001770812770000073
e) at TiSatisfies T of 30001 ≤iWhen the content of the active carbon is less than or equal to 300000,
Figure BDA0001770812770000074
f) at TiSatisfy TiWhen > 300000, TiFixed (e.g., 300000).
According to the above rule, if Ti50, the corresponding response time reference value is 50; if T isi112, the corresponding response time reference value is 110; if T isi119, the corresponding response time reference value is 110; if T isi2105, the corresponding response time reference value is 2100; if T isi2199, corresponding to a response time reference value of 2100; if T isi2200, the corresponding response time reference value is 2200; if T isi5622, the corresponding response time reference value is 5000; if T isi5999, corresponding to a response time reference value of 5000; if T isi6000, the corresponding response time reference value is 6000; if T isi6000, the corresponding response time reference value is 6000; if T isi90034, the corresponding response time reference value is 90000; if T isi99999, corresponding to a response time reference of 90000; if T isi100000, corresponding response timeThe inter-reference value is 100000; if T isi300001, corresponding to a response time reference value of 300000; if T isi999999, corresponding to a response time reference value of 300000. It can be seen that a fixed set of response time reference values can be obtained according to the above exemplary rules.
It is understood that different types of requests may correspond to different segment intervals, and the processing rules corresponding to the segment intervals may also be different. For example, the closer the time is to the normal response time, the shorter the segmentation interval may be. The present disclosure is not limited to specific preset rules, and those skilled in the art can determine their corresponding response time reference values for each type of request according to actual situations.
In the disclosed embodiment, a fixed-length barrel container may be created for the response time reference value corresponding to a certain request, and the key of the barrel container may be the response time reference value corresponding to the request. For example, a fixed length cask as shown in FIG. 4A may be created according to the rules in the example above.
According to the embodiments of the present disclosure, after the response time reference value is created, a specific response time or all response times with respect to the request may be acquired. For example, assuming that an application responds to a request 1000 times, 1000 response times may be obtained.
In embodiments of the present disclosure, a response time reference value to which the response time matches may be determined. For example, the acquired response time may be processed according to the same rule as the creation of the response time reference value, and the response time reference value that is the same as the processed response time may be determined as the matching response time reference value.
In the embodiment of the present disclosure, each response time reference value may correspond to a timer, and the timer corresponding to each response time reference value may be set to 0 initially. And after the obtained response time is matched with a certain response time reference value, adding 1 to a counter corresponding to the matched response time reference value.
For example, as shown in FIG. 4B, the response time obtained is 2ms, 1 ≦ T according to the rule in the example aboveiWhen the temperature is less than or equal to 100, TiOriginal valueThen the reference value of the response time matched with the response time is 2, and the counter corresponding to the reference value of the response time of 2 is increased by 1.
As another example, as shown in FIG. 4C, the response time is obtained as 5ms, 1 ≦ T according to the rule in the above exampleiWhen the temperature is less than or equal to 100, TiIf the value is the original value, the response time reference value matched with the response time is 5, and the counter corresponding to the response time reference value of 5 is increased by 1.
As another example, as shown in FIG. 4D, the response time obtained is 101ms, and according to the rule in the above example, 101 ≦ TiWhen the content is less than or equal to 1000,
Figure BDA0001770812770000091
the response time reference value for the response time match is 100 and the counter corresponding to the response time reference value of 100 is incremented by 1.
As another example, as shown in FIG. 4E, the response time obtained is 108ms, 101 ≦ T according to the rules in the above exampleiWhen the content is less than or equal to 1000,
Figure BDA0001770812770000092
the response time reference value for the response time match is 100 and the counter corresponding to the response time reference value of 100 is incremented by 1.
As another example, as shown in FIG. 4F, the response time obtained is 1010ms, 1001 ≦ T according to the rules in the above exampleiWhen the content is less than or equal to 5000,
Figure BDA0001770812770000093
the response time reference value for the response time match is 1000 and the counter corresponding to the response time reference value of 1000 is incremented by 1.
And by analogy, matching and recording the acquired response time and the response time reference value. For example, the response time of each time is 1ms, 3ms, 5ms, 225ms, 800ms, 110ms, 335ms, and … … respectively, the response times are sequentially matched with the reference value of the response time, and then the count value corresponding to the reference value is updated.
The embodiment of the disclosure can reflect the condition of the response time through the response time reference value and the corresponding count value thereof, and when the response time is counted, the total comparison and the ordering are not needed, but the counting is carried out according to the count value of each response time reference value, so that the calculation complexity can be reduced, the calculation speed is increased, and the calculation efficiency is improved.
Fig. 5 schematically shows a flow chart of a data processing method according to another embodiment of the present disclosure.
As shown in fig. 5, the method includes operations S201 to S204 and operation S501. Operations S201 to S204 are the same as or similar to the method described above with reference to fig. 2, and are not repeated herein.
In operation S501, a count value corresponding to at least one response time reference value is counted according to the statistical parameter.
In this embodiment of the present disclosure, counting the count value corresponding to the at least one response time reference value according to the statistical parameter may include: and determining a statistic value according to the statistic parameters and the obtained number of the response time, and determining a response time reference value corresponding to the statistic value according to a count value corresponding to at least one response time reference value.
For example, the TPn of the response time may be calculated, for example, TP90 of the response time, i.e., Top Percent 90, may be calculated. Then 90% may be a statistical parameter and if the number of response times acquired is 1000, the statistical value may be 1000 × 90% — 900.
In the prior art, the TP90 can be calculated by only sorting all 1000 response times, and then finding the response time corresponding to the 900 th data in the sorting as the value of TP 90.
The embodiment of the disclosure may determine the response time reference value corresponding to the statistic value according to the count value corresponding to the response time reference value.
For example, the corresponding count values may be sequentially accumulated according to the order of at least one response time reference value, and when the accumulated count values and the statistics values satisfy a condition, the corresponding time reference value corresponding to the statistics values is determined.
For example, as shown in fig. 6, the positions of the statistics 900 may be determined by sequentially accumulating the corresponding count values from small to large according to the reference value. For example, if the count value of the reference value 1 is 343 and less than 900, the accumulation is continued, if the count value corresponding to the reference value 2 is accumulated, the accumulated count value is 343+298 and 641 and less than 900, if the count value corresponding to the reference value 3 is accumulated, the accumulated count value is 641+260 and 901, and if the count value exceeds 900, the response time reference value corresponding to the statistical value 900 should be 3 ms.
It can be understood that, according to the embodiment of the present disclosure, the corresponding count value may be accumulated from large to small according to the reference value, so as to determine the position of the statistic 900. For example, 1000-.
The embodiment of the disclosure can reflect the condition of the response time through the response time reference value and the corresponding count value thereof, and when the response time is counted, the total comparison and the ordering are not needed, but the counting is performed according to the count value of each response time reference value, so that the calculation complexity can be reduced, the calculation throughput in unit time can be improved, the calculation speed can be increased, and the calculation efficiency can be improved.
Fig. 7A and 7B schematically illustrate block diagrams of a data processing apparatus 700 according to an embodiment of the present disclosure.
As shown in fig. 7A, the data processing apparatus 700 includes a first determining module 710, an obtaining module 720, a second determining module 730, and an updating module 740.
The first determining module 710 determines at least one response time reference value corresponding to a specific request according to a preset rule.
The retrieving module 720 retrieves a response time for the particular request.
The second determining module 730 determines the response time reference value matched with the response time according to a preset rule.
The update module 740 updates a count value corresponding to the matched response time reference value, wherein the count value characterizes the number of response times matching the response time reference value.
According to an embodiment of the present disclosure, determining at least one response time reference value with respect to a specific request according to a preset rule may include: the method includes determining a plurality of time segment intervals according to a particular request, and determining a plurality of response time reference values based on a processing rule corresponding to each time segment interval.
According to the embodiment of the disclosure, determining the response time reference value matched with the response time according to the preset rule may include: and processing the response time according to a preset rule, and determining a response time reference value which is the same as the processed response time as a matched response time reference value.
According to an embodiment of the present disclosure, each response time reference value corresponds to a counter. The count value corresponding to the matched response time reference value may be updated by adding 1 to the counter corresponding to the matched response time reference value.
As shown in fig. 7B, the data processing apparatus 700 may further include a statistics module 750.
The counting module 750 counts a count value corresponding to the at least one response time reference value according to the counting parameter.
According to the embodiment of the present disclosure, counting the count value corresponding to the at least one response time reference value according to the statistical parameter may include: and determining a statistic value according to the statistic parameters and the obtained number of the response time, and determining a response time reference value corresponding to the statistic value according to a count value corresponding to at least one response time reference value.
According to an embodiment of the present disclosure, determining a response time reference value corresponding to a statistic according to a count value corresponding to at least one response time reference value may include: and sequentially accumulating the corresponding count values according to the sequence of at least one response time reference value, and determining the corresponding time reference value corresponding to the statistic value when the count value obtained by accumulation and the statistic value meet the condition.
According to the embodiment of the present disclosure, the data processing apparatus 700 may, for example, perform the method described above with reference to fig. 2 or fig. 5, which is not described herein again.
Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented in any other reasonable manner of hardware or firmware by integrating or packaging a circuit, or in any one of or a suitable combination of software, hardware, and firmware implementations. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.
For example, any of the first determining module 710, the obtaining module 720, the second determining module 730, the updating module 740, and the counting module 750 may be combined into one module to be implemented, or any one of the modules may be divided into a plurality of modules. Alternatively, at least part of the functionality of one or more of these modules may be combined with at least part of the functionality of the other modules and implemented in one module. According to an embodiment of the present disclosure, at least one of the first determining module 710, the obtaining module 720, the second determining module 730, the updating module 740, and the statistics module 750 may be implemented at least in part as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or in a suitable combination of any of them. Alternatively, at least one of the first determining module 710, the obtaining module 720, the second determining module 730, the updating module 740 and the statistics module 750 may be at least partially implemented as a computer program module, which when executed may perform a corresponding function.
FIG. 8 schematically shows a block diagram of a data processing system suitable for implementing the above described method according to an embodiment of the present disclosure. The computer system illustrated in FIG. 8 is only one example and should not impose any limitations on the scope of use or functionality of embodiments of the disclosure.
As shown in fig. 8, a data processing system 800 according to an embodiment of the present disclosure includes a processor 801 which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. The processor 801 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 801 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.
In the RAM 803, various programs and data necessary for the operation of the system 800 are stored. The processor 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. The processor 801 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 802 and/or RAM 803. Note that the programs may also be stored in one or more memories other than the ROM 802 and RAM 803. The processor 801 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in the one or more memories.
System 800 may also include an input/output (I/O) interface 805, also connected to bus 804, according to an embodiment of the disclosure. The system 800 may also include one or more of the following components connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program, when executed by the processor 801, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.
The present disclosure also provides a computer-readable medium, which may be embodied in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer readable medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.
According to embodiments of the present disclosure, a computer readable medium may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, optical fiber cable, radio frequency signals, etc., or any suitable combination of the foregoing.
For example, according to embodiments of the present disclosure, a computer-readable medium may include one or more memories other than ROM 802 and/or RAM 803 and/or ROM 802 and RAM 803 described above.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.
The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims (8)

1. A method of data processing, comprising:
determining at least one response time reference value corresponding to the specific request according to a preset rule, wherein the determining at least one response time reference value corresponding to the specific request according to the preset rule comprises: determining a plurality of time segmentation intervals according to the specific request, and determining a plurality of response time reference values based on a processing rule corresponding to each time segmentation interval, wherein in at least one time segmentation interval, a plurality of response times correspond to one response time reference value;
acquiring response time related to the specific request, wherein the response time refers to the time required for completing one response, and the completing one response refers to the process that a user sends the specific request to a server and the server sends data related to the specific request to the user;
determining a response time reference value matched with the response time according to the preset rule;
updating a count value corresponding to the matched response time reference value, wherein the count value represents the number of response times matched with the response time reference value; and
counting the count value corresponding to the at least one response time reference value according to the statistical parameters to determine the minimum response time required by a specified percentage of specific requests;
wherein, the counting the count value corresponding to the at least one response time reference value according to the statistical parameter comprises:
determining a statistic value according to the specified percentage and the obtained number of the response time, wherein the statistic value is equal to the product of the specified percentage and the number of the response time; and
sequentially accumulating the corresponding count values according to the magnitude sequence of the at least one response time reference value, determining the response time reference value corresponding to the statistic value when the accumulated value and the statistic value meet the condition, and taking the response time reference value corresponding to the statistic value as the minimum response time;
wherein, when the accumulated value and the statistic value satisfy a condition, determining the response time reference value corresponding to the statistic value comprises: under the condition that the counting values are accumulated according to the sequence of the response time reference values from small to large, taking the corresponding response time reference value when the accumulated value exceeds the statistic value as the response time reference value corresponding to the statistic value; and under the condition that the counting values are accumulated according to the sequence of the response time reference values from large to small, taking the response time reference value corresponding to the accumulated value when the accumulated value exceeds the difference value between the number of response times and the statistic value as the response time reference value corresponding to the statistic value.
2. The method of claim 1, wherein the determining the response time reference value matched with the response time according to the preset rule comprises:
processing the response time according to the preset rule;
determining a response time reference value that is the same as the processed response time as the matched response time reference value.
3. The method of claim 1, wherein:
each response time reference value corresponds to a counter;
the updating the count value corresponding to the matched response time reference value comprises: and adding 1 to the counter corresponding to the matched response time reference value.
4. A data processing apparatus comprising:
the first determining module is configured to determine at least one response time reference value corresponding to the specific request according to a preset rule, where the determining the at least one response time reference value corresponding to the specific request according to the preset rule includes: determining a plurality of time segmentation intervals according to the specific request, and determining a plurality of response time reference values based on a processing rule corresponding to each time segmentation interval, wherein in at least one time segmentation interval, a plurality of response times correspond to one response time reference value;
the acquisition module is used for acquiring response time related to the specific request, wherein the response time refers to the time required for completing one response, and the completion of one response refers to the process that a user sends the specific request to the server and the server sends data related to the specific request to the user;
the second determining module is used for determining a response time reference value matched with the response time according to the preset rule;
the updating module is used for updating a count value corresponding to the matched response time reference value, wherein the count value represents the number of the response time matched with the response time reference value; and
the counting module is used for counting the counting value corresponding to the at least one response time reference value according to the counting parameters so as to determine the minimum response time required by the specific request with the specified percentage;
wherein, the counting the count value corresponding to the at least one response time reference value according to the statistical parameter comprises:
determining a statistic value according to the specified percentage and the obtained number of the response time, wherein the statistic value is equal to the product of the specified percentage and the number of the response time; and
sequentially accumulating the corresponding count values according to the magnitude sequence of the at least one response time reference value, determining the response time reference value corresponding to the statistic value when the accumulated value and the statistic value meet the condition, and taking the response time reference value corresponding to the statistic value as the minimum response time;
wherein, when the accumulated value and the statistic value satisfy a condition, determining the response time reference value corresponding to the statistic value comprises: under the condition that the counting values are accumulated according to the sequence of the response time reference values from small to large, taking the corresponding response time reference value when the accumulated value exceeds the statistic value as the response time reference value corresponding to the statistic value; and under the condition that the counting values are accumulated according to the sequence of the response time reference values from large to small, taking the response time reference value corresponding to the accumulated value when the accumulated value exceeds the difference value between the number of response times and the statistic value as the response time reference value corresponding to the statistic value.
5. The apparatus of claim 4, wherein the determining the response time reference value matched to the response time according to the preset rule comprises:
processing the response time according to the preset rule;
determining a response time reference value that is the same as the processed response time as the matched response time reference value.
6. The apparatus of claim 4, wherein:
each response time reference value corresponds to a counter;
the updating the count value corresponding to the matched response time reference value comprises: and adding 1 to the counter corresponding to the matched response time reference value.
7. A data processing system comprising:
one or more memories storing executable instructions; and
one or more processors executing the executable instructions to implement the method of any one of claims 1-3.
8. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, implement a method according to any one of claims 1 to 3.
CN201810952428.4A 2018-08-20 2018-08-20 Data processing method and device Active CN109240878B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810952428.4A CN109240878B (en) 2018-08-20 2018-08-20 Data processing method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810952428.4A CN109240878B (en) 2018-08-20 2018-08-20 Data processing method and device

Publications (2)

Publication Number Publication Date
CN109240878A CN109240878A (en) 2019-01-18
CN109240878B true CN109240878B (en) 2021-01-26

Family

ID=65069887

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810952428.4A Active CN109240878B (en) 2018-08-20 2018-08-20 Data processing method and device

Country Status (1)

Country Link
CN (1) CN109240878B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7207043B2 (en) * 2002-12-31 2007-04-17 International Business Machines Corporation Programmatic response-time based workload distribution techniques
US9122782B2 (en) * 2011-09-28 2015-09-01 International Business Machines Corporation Apparatus and computer program product for adaptively determining response time distribution of transactional workloads
CN107103009B (en) * 2016-02-23 2020-04-10 杭州海康威视数字技术股份有限公司 Data processing method and device

Also Published As

Publication number Publication date
CN109240878A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
US10547618B2 (en) Method and apparatus for setting access privilege, server and storage medium
US10249070B2 (en) Dynamic interaction graphs with probabilistic edge decay
CN110866040B (en) User portrait generation method, device and system
CN110766348B (en) Method and device for combining goods picking tasks
CN107291835B (en) Search term recommendation method and device
CN112836128A (en) Information recommendation method, device, equipment and storage medium
CN110059064B (en) Log file processing method and device and computer readable storage medium
CN114297278A (en) Method, system and device for quickly writing batch data
CN110866031B (en) Database access path optimization method and device, computing equipment and medium
CN112214770A (en) Malicious sample identification method and device, computing equipment and medium
CN109240878B (en) Data processing method and device
CN110019531B (en) Method and device for acquiring similar object set
CN112100211B (en) Data storage method, apparatus, electronic device, and computer readable medium
CN111460020B (en) Method, device, electronic equipment and medium for resolving message
CN111680754B (en) Image classification method, device, electronic equipment and computer readable storage medium
CN113688160A (en) Data processing method, processing device, electronic device and storage medium
CN109614137B (en) Software version control method, device, equipment and medium
CN111507734B (en) Method and device for identifying cheating request, electronic equipment and computer storage medium
CN107291921B (en) Information processing method and system
CN113362097B (en) User determination method and device
CN110875856A (en) Method and apparatus for activation data anomaly detection and analysis
CN111460273B (en) Information pushing method and device
CN113741796B (en) Data persistence method and device for terminal application
CN115981910B (en) Method, apparatus, electronic device and computer readable medium for processing exception request
CN113239687B (en) Data processing method and device

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
CB02 Change of applicant information

Address after: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Beijing Daxing District, Beijing

Applicant after: Jingdong Digital Technology Holding Co., Ltd.

Address before: Room 221, 2nd floor, Block C, 18 Kechuang 11th Street, Beijing Daxing District, Beijing

Applicant before: Beijing Jingdong Financial Technology Holding Co., Ltd.

CB02 Change of applicant information
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder

Address after: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176

Patentee after: Jingdong Technology Holding Co.,Ltd.

Address before: Room 221, 2 / F, block C, 18 Kechuang 11th Street, Daxing District, Beijing, 100176

Patentee before: JINGDONG DIGITAL TECHNOLOGY HOLDINGS Co.,Ltd.

CP01 Change in the name or title of a patent holder