CN112966180B - Request processing method, apparatus, device, medium, and program product - Google Patents

Request processing method, apparatus, device, medium, and program product Download PDF

Info

Publication number
CN112966180B
CN112966180B CN202110248657.XA CN202110248657A CN112966180B CN 112966180 B CN112966180 B CN 112966180B CN 202110248657 A CN202110248657 A CN 202110248657A CN 112966180 B CN112966180 B CN 112966180B
Authority
CN
China
Prior art keywords
experiment
experiments
objects
object set
current
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
CN202110248657.XA
Other languages
Chinese (zh)
Other versions
CN112966180A (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.)
Beijing Baidu Netcom Science and Technology Co Ltd
Original Assignee
Beijing Baidu Netcom Science and Technology 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 Beijing Baidu Netcom Science and Technology Co Ltd filed Critical Beijing Baidu Netcom Science and Technology Co Ltd
Priority to CN202110248657.XA priority Critical patent/CN112966180B/en
Publication of CN112966180A publication Critical patent/CN112966180A/en
Application granted granted Critical
Publication of CN112966180B publication Critical patent/CN112966180B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/957Browsing optimisation, e.g. caching or content distillation
    • G06F16/9577Optimising the visualization of content, e.g. distillation of HTML documents
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/22Matching criteria, e.g. proximity measures

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • User Interface Of Digital Computer (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The disclosure discloses a request processing method, a request processing device, a request processing equipment, a request processing medium and a request processing program product, and relates to the technical field of computers, in particular to the technical field of experiments. The specific implementation scheme is as follows: obtaining an object request from a current object; and responding to the object request, and selecting a target experiment aiming at the current object from a plurality of experiments based on preset matching information, wherein the plurality of experiments comprise at least one first experiment and a plurality of second experiments, the first experiment is mutually exclusive with other experiments in the plurality of experiments, and the second experiment is an experiment except the first experiment in the plurality of experiments; wherein, the matching information includes: the method comprises the steps of matching a first object set with a first experiment and matching a second object set with a second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects.

Description

Request processing method, apparatus, device, medium, and program product
Technical Field
Relates to the technical field of computers, in particular to the technical field of experiments.
Background
Before the release of the program product, a plurality of improvement schemes can be set for the program product, and experiments can be carried out on the plurality of improvement schemes so as to observe the change of object feedback caused by the change of a certain characteristic of the program product, and then a scheme with better improvement effect for the characteristic can be selected. Wherein, some experiments are mutually exclusive in object flow, namely, the same object cannot participate in two mutually exclusive experiments at the same time. There is no solution to the complex mutual exclusion problem in the related art.
Disclosure of Invention
The present disclosure provides a request processing method, apparatus, device, storage medium, and program product.
According to an aspect of the present disclosure, there is provided a request processing method performed by an electronic device, including: obtaining an access request from a current object; and responding to the access request, and selecting a target experiment aiming at the current object from a plurality of experiments based on preset matching information, wherein the plurality of experiments comprise at least one first experiment and a plurality of second experiments, the first experiment is mutually exclusive with other experiments in the plurality of experiments, and the second experiment is an experiment except the first experiment in the plurality of experiments; wherein, the matching information includes: the method comprises the steps of matching a first object set with a first experiment and matching a second object set with a second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects.
According to another aspect of the present disclosure, there is provided a request processing apparatus including: the acquisition module is used for acquiring an access request from the current object; the selection module is used for responding to the access request, selecting a target experiment aiming at the current object from a plurality of experiments based on preset matching information, wherein the plurality of experiments comprise at least one first experiment and a plurality of second experiments, the first experiment is mutually exclusive with other experiments in the plurality of experiments, and the second experiment is an experiment except the first experiment in the plurality of experiments; wherein, the matching information includes: the first object set includes a partial object among a preset plurality of objects, and the second object set includes an object other than the partial object among the plurality of objects.
According to another aspect of the present disclosure, there is provided an electronic device including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method as described above.
According to another aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method as above.
According to another aspect of the present disclosure, there is provided a computer program product comprising a computer program which, when executed by a processor, implements a method as above.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.
Drawings
The drawings are for a better understanding of the present solution and are not to be construed as limiting the present disclosure. Wherein:
FIG. 1 schematically illustrates an exemplary system architecture to which a request processing method may be applied, according to an embodiment of the present disclosure;
FIG. 2 schematically illustrates a schematic diagram of an object flow distribution approach according to an embodiment of the present disclosure;
FIG. 3 schematically illustrates a flow chart of a request processing method according to an embodiment of the disclosure;
FIG. 4 schematically illustrates a schematic diagram of an object-to-experiment matching approach in accordance with an embodiment of the present disclosure;
FIG. 5 schematically illustrates a schematic diagram of an experimental partitioning approach in accordance with an embodiment of the present disclosure;
FIG. 6 schematically illustrates a schematic diagram of an experimental partitioning approach according to another embodiment of the present disclosure;
FIG. 7 schematically illustrates a schematic diagram of subject distribution according to an embodiment of the present disclosure;
FIG. 8 is a block diagram of a request processing apparatus used to implement an embodiment of the present disclosure;
FIG. 9 illustrates a schematic block diagram of an example electronic device that may be used to implement embodiments of the present disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
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/or 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 should be noted that the terms used herein should be construed to have meanings consistent with the context of the present specification and should not be construed in an idealized or overly formal manner.
Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a convention should be interpreted in accordance with the meaning of one of skill in the art having generally understood the convention (e.g., "a system having at least one of A, B and C" would include, but not be limited to, systems having 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.).
Embodiments of the present disclosure provide a request processing method performed by an electronic device, including: obtaining an access request from a current object; and responding to the access request, and selecting a target experiment aiming at the current object from a plurality of experiments based on preset matching information, wherein the plurality of experiments comprise at least one first experiment and a plurality of second experiments, the first experiment is mutually exclusive with other experiments in the plurality of experiments, and the second experiment is an experiment except the first experiment in the plurality of experiments; wherein, the matching information includes: the method comprises the steps of matching a first object set with a first experiment and matching a second object set with a second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects.
Fig. 1 schematically illustrates an exemplary system architecture 100 in which a request processing method may be applied, according to an embodiment of the present disclosure. It should be noted that fig. 1 is only an example of a system architecture to which embodiments of the present disclosure may be applied to assist those skilled in the art in understanding the technical content of the present disclosure, but does not mean that embodiments of the present disclosure may not be used in other devices, systems, environments, or scenarios.
As shown in fig. 1, a system architecture 100 according to this embodiment may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used as a medium to provide communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired and/or wireless communication links, and the like.
The object may interact with the server 105 via the network 104 using the terminal devices 101, 102, 103 to receive or send messages or the like. Various communication client applications may be installed on the terminal devices 101, 102, 103, such as shopping class applications, web browser applications, search class applications, instant messaging tools, mailbox clients and/or social platform software, to name a few. Wherein the object may be, for example, a user or the like.
The terminal devices 101, 102, 103 may be a variety of electronic devices having a display screen and supporting web browsing, including but not limited to smartphones, tablets, laptop and desktop computers, and the like.
The server 105 may be a server providing various services, such as a background management server (by way of example only) providing support for websites browsed by the object utilizing the terminal devices 101, 102, 103. The background management server may analyze and process the received data such as the access request, and feed back the processing result (e.g., a web page, information, or data acquired or generated according to the access request) to the terminal device.
It should be noted that, the method for processing a request provided by the embodiment of the present disclosure may be generally performed by the server 105. Accordingly, the request processing apparatus provided by the embodiments of the present disclosure may be generally disposed in the server 105. The request processing method provided by the embodiments of the present disclosure may also be performed by a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105. Accordingly, the request processing apparatus provided by the embodiments of the present disclosure may also be provided in a server or a server cluster that is different from the server 105 and is capable of communicating with the terminal devices 101, 102, 103 and/or the server 105.
For example, the object may submit an access request to the server 105 through any one of the terminal devices 101, 102, or 103 (for example, but not limited to, the terminal device 101), and the server 105 may process the access request submitted by the object according to the request processing method of the embodiment of the present disclosure, to obtain a target experiment corresponding to the access request, so that the object participates in the target experiment.
It should be understood that the number of terminal devices, networks and control devices in fig. 1 is merely illustrative. There may be any number of terminal devices, networks and control devices, as desired for implementation.
In the embodiment of the disclosure, some characteristics of the program product can be improved to form a plurality of improved schemes, and some objects experience the improved schemes to obtain feedback of the use condition of the objects, so that the improved schemes with better effect can be obtained according to the use condition analysis of the objects. The characteristics may include, for example, characteristics of display effects for the page, such as improvements in page background color, fonts, and the like. The feasibility and the effectiveness of the strategy represented by the experiment are judged by conducting subdivision and random experiments on the flow of the object and monitoring and tracking the experimental effect.
The whole flow of the experiment can be as follows: 1) It is proposed to assume that: before the experiment, the developer can consider which variables to improve and how to improve, and the experience of the object can be improved. 2) The determination scheme is as follows: with assumptions and expectations, a particular experimental regime may be determined, such as determining which of the variables (and their values) of the experiment, e.g., the variables (and their values) may be: font (black/red), page background (black/red). In addition, whether a conflict exists between some experiments needs to be considered, for example, when the background is black, the font cannot be black, so that it needs to be ensured that no intersection exists between experimental objects of the background experiment and the font experiment, namely, the flow mutual exclusion of the experiment, wherein the flow can be an access request, and the "experimental mutual exclusion" appearing below can be the flow mutual exclusion of the experiment, namely, the intersection cannot occur between the participating objects of the experiment. 3) Function development: after the scheme is determined, the function research and development is further carried out, and the program segments corresponding to the improved scheme are added into the program product. For example, if experiments for black, green, and blue backgrounds are added on the basis of the original white background of the program product, a black background module X2, a green background module X3, and a blue background module X4 may be added on the basis of the original white background module X1 in the program product, and an object may be allocated to one of the modules X1 to X4 upon receiving an access request. 4) Configuration experiment: after the function development is completed, specific experimental information including flow information, variable information and the like can be configured on the experimental platform. 5) Checking experimental data: after the experiment is online, online logs are generated, and behavior data of the object, such as object behavior data of object browsing amount, click amount and the like, can be counted according to the logs. 6) Conclusion of yield: after a period of experiment, experimental conclusion can be drawn according to the experimental data of each group.
In view of the mutual exclusion problem mentioned in the above description, the inventors found that there are scenarios of joint experiments, e.g., existing experiments A, B, C and D, where experiment a is an experiment for the overall background color of the page; experiment B is an experiment for font color, experiment C is an experiment for form border, and experiment D is an experiment for virtual key color. For this case, a needs to be mutually exclusive with B, C and D, respectively, while B, C and D need not be mutually exclusive between each other, which may be referred to as a joint experiment scenario, i.e., when multiple experiments are performed simultaneously, where there is at least one first experiment, the first experiment is mutually exclusive with other experiments than itself, but there is no need for mutual exclusion between groups of experiments other than the at least one first experiment, where other experiments than the at least one first experiment may be referred to as a second experiment. Taking experiments A, B, C and D as examples, if a needs to be mutually exclusive with B, C and D, respectively, and B, C and D need not be mutually exclusive, then experiment a is a first experiment, B, C and D are each a second experiment; if A needs to be mutually exclusive with B, C and D, respectively, and B needs to be mutually exclusive with A, C and D, respectively, and C and D do not need to be mutually exclusive, then experiments A and B are each a first experiment, and C and D are each a second experiment.
In order to avoid the intersection between the participating objects of the mutual exclusion experiment, all the experiments with mutual exclusion can be put in one experiment layer to divide the whole experiment object equally, wherein the concept of the experiment layer is introduced for the convenience of explanation and understanding. The experimental layer may have a total number of subjects, and each of the plurality of experiments in the experimental layer occupies a portion of the total number of subjects, and one subject may participate in one experiment in the experimental layer but not in other experiments in the layer.
Fig. 2 schematically illustrates a schematic diagram of an object flow allocation scheme according to an embodiment of the present disclosure.
As shown in fig. 2, if a needs to be mutually exclusive with B, C and D, respectively, A, B, C and D may be both placed in one experimental layer 201, and the four experiments divide the whole amount of the experimental objects, and no intersection exists between any two experimental objects. For example, the total subjects were u1 to u20, where u1 to u5 could be assigned to experiment A, u6 to u10 could be assigned to experiment B, u11 to u15 could be assigned to experiment C, and u16 to u20 could be assigned to experiment D. When a subject initiates a request, the subject can participate in one experiment (e.g., experiment a) in the experiment layer 201, cannot participate in other experiments (B, C and D) in the experiment layer 201, and achieves flow mutual exclusion between experiment a and other experiments. However, this object allocation method has the following problems: instead of requiring mutual exclusion between experiments B, C and D, i.e., the object traffic between experiments B, C and D is reusable, i.e., one object can participate in both experiments B, C and D, the above-described partitioning scheme does not intersect between the participating objects between experiments B, C and D, resulting in a reduction in the number of objects participating in each experiment. If the mutually exclusive experiments are too many, the flow distributed by each experiment may be small, and the experiment requirements cannot be met.
The embodiment of the disclosure also provides an access request processing method, which can solve the problem of complex experiment mutual exclusion, solve the problems existing in the scheme, not only can realize the purpose of not repeatedly using the same object between mutually exclusive experiments, but also can realize the multiplexing of the objects between the experiments without mutual exclusion, and improve the utilization rate of the object flow.
In the embodiment of the disclosure, the mutual exclusion relation among the plurality of experiments may be manually set by an experimenter, that is, whether any two experiments need mutual exclusion or not may be predetermined by the experimenter.
The embodiment of the present disclosure provides a request processing method, and a request processing method according to an exemplary embodiment of the present disclosure is described below with reference to fig. 3 to 7 in conjunction with the application scenario of fig. 1.
Fig. 3 schematically illustrates a flow chart of a request processing method according to an embodiment of the present disclosure.
As shown in fig. 3, the request processing method 300 of the embodiment of the present disclosure may include, for example, operations S310 to S320.
In operation S310, an access request from a current object is obtained.
In operation S320, in response to the access request, a target experiment for the current object is selected from a plurality of experiments based on preset matching information, wherein the plurality of experiments includes at least one first experiment and a plurality of second experiments, the first experiment is an experiment mutually exclusive to other experiments in the plurality of experiments, and the second experiment is an experiment other than the first experiment in the plurality of experiments. Wherein, the matching information includes: a matching relationship between the first set of objects and the first experiment and a matching relationship between the second set of objects and the second experiment. The first object set comprises a part of objects in the preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects.
In the embodiment of the disclosure, before the experiment is performed, the correspondence between the object and the experiment may be matched in advance, so that after the experiment starts, the target experiment in which the object needs to participate may be found according to the pre-matched correspondence.
In one example, the plurality of experiments may be referred to as experiments A, B, C and D, where experiment a needs to be mutually exclusive of B, C and D, respectively, and B, C and D need not be mutually exclusive, then experiment a is the first experiment and B, C and D are each the second experiment.
Fig. 4 schematically illustrates a schematic diagram of an object-to-experiment matching manner according to an embodiment of the present disclosure.
As shown in fig. 4, in the full-scale object, experiment a alone may occupy a part of the experimental objects, which is the first object set. For example, experiment a may be placed in experiment layer 401, and experiment layer 401 may be assigned a first set of objects, where when an object in the first set of objects sends an access request, the object may be assigned to experiment layer 401 to participate in experiment a. Wherein, the full-volume experimental object can be selected from platform registration objects for experiments, and the part of the objects participating in the experiments can be called the full-volume experimental object. The total number of subjects are, for example, subjects u1 to u10, and the first set of subjects may be, for example, subjects u1 to u4. The remaining experimental objects u5 to u10 except the first object set may constitute a second object set, and objects in the second object set may be multiplexed in the second experiments B, C and D. For example, the second experiments B, C and D are located in one experiment layer 402, 403 and 404, respectively, the second object set may be allocated to the experiment layers 402, 403 and 404, and when an object in the second object set sends an access request, the object may be allocated to the three experiment layers to participate in the experiments B, C and D simultaneously, so as to implement multiplexing of the object traffic.
In another example, if A needs to be mutually exclusive with B, C and D, respectively, and B needs to be mutually exclusive with A, C and D, respectively, and C and D need not be mutually exclusive, then experiments A and B are mutually exclusive with the rest of the experiments except themselves, so experiments A and B are each a first experiment, and C and D are each a second experiment. In this case, experiments a and B need to be placed in one experiment layer to average the objects of the first object set, and experiments C and D each occupy one experiment layer to multiplex the objects of the second object set. In this way, experiment a and experiment B divided the subjects of the first subject set, so there was no intersection between the participating subjects of experiment a and experiment B, nor between the participating subjects of experiment a/B and experiment C/D, while experiments C and D could multiplex the remaining subjects except for the first subject set.
In the embodiment of the disclosure, after an experiment starts, when an access request of a certain object is received, whether the object is an experiment object is checked, if yes, a target experiment corresponding to the object is found according to preset matching information of the object and the experiment in response to the access request, so that the object participates in the target experiment.
According to the embodiment of the disclosure, first, aiming at the first experiment mutually exclusive to other experiments in the combined experiment scene, the object required by the first experiment is selected, and then the other objects except the object required by the first experiment in the total experiment objects are multiplexed into the other second experiments, so that the purpose of not repeatedly using the same experiment object among mutually exclusive experiments can be realized, multiplexing of the experiment objects among the mutually exclusive experiments can be realized, the utilization rate of the object flow is improved, and the object demand of each experiment is met.
According to an embodiment of the present disclosure, selecting a target experiment for a current subject from a plurality of experiments includes: selecting a first experiment from at least one first experiment as a target experiment in the case that the current object belongs to the first object set; in the case that the current object belongs to the second object set, a plurality of second experiments are taken as target experiments.
Along with the first example described above, experiment a is a first experiment, experiment a alone occupies the objects of a first set of objects, B, C and D are each one second experiment, B, C and D multiplex the objects of a second set of objects. If the current object belongs to the first object set, the target experiment corresponding to the current object is experiment A, namely the current object needs to participate in experiment A. If the current object belongs to the second object set, the target experiments corresponding to the current object are experiments B, C and D, i.e., the current object needs to participate in experiments B, C and D at the same time.
Along with the second example described above, experiments A and B are each a first experiment, experiments A and B divide the objects of the first object set, experiments C and D are each a second experiment, and C and D multiplex the objects of the second object set. If the current object belongs to the first object set, the target experiment corresponding to the current object is experiment a or experiment B, i.e. the current object needs to participate in one of the experiments a and B. If the current object belongs to the second object set, the target experiments corresponding to the current object are experiments C and D, namely the current object needs to participate in the experiments C and D at the same time.
According to the embodiment of the disclosure, the current object may participate in one experiment in the first experiments, the same object may be avoided from being used between mutually exclusive first experiments, or the current object may participate in each experiment in the second experiments, and object multiplexing between non-mutually exclusive second experiments may be achieved.
According to an embodiment of the present disclosure, the request processing method further includes: generating a display page based on the target experiment; and outputting the display page to the current object.
Along with the first example described above, experiment a is a first experiment and experiments B, C and D are each a second experiment. For example, experiment a is an experiment performed on the overall background color of the page, e.g., with both black/blue colors; experiment B is an experiment performed on font colors, for example with two colors black/blue; experiment C is performed on the form border, e.g., with two colors black/blue; experiment D is performed for a virtual key color, for example, with two colors black/blue.
If the target experiment corresponding to the current object is experiment A, when the page is generated, the background color of the page can be changed from original white to black or blue, and the colors of the fonts, the form borders and the virtual keys still adopt the original colors. After the improved page is generated, the page is displayed to the object through the terminal equipment so as to observe the change of the use condition of the object caused by the change of the background color of the page.
If the target experiments corresponding to the current object are experiments B, C and D, when the page is generated, the background color of the font, the form frame and the virtual key can be changed from the original color to black or blue, and the background color still adopts the original white. After the improved page is generated, the page is displayed to the object through the terminal equipment so as to observe the change of the use condition of the object caused by the color change of fonts, form borders and virtual keys.
According to an embodiment of the present disclosure, the request processing method may further include: forming a first set of objects, wherein forming the first set of objects comprises: (1) obtaining subject conditions for each first experiment; (2) Selecting a plurality of candidate objects meeting the object condition of any one of the first experiments from a plurality of preset objects; (3) A predetermined number of objects are selected from a plurality of candidate objects to form a first set of objects.
For example, each experiment may have respective object conditions, which may refer to target objects of the experiment, such as objects of different ages, android/IOS objects, etc. In the process of selecting the first object set, objects meeting the object condition of any first experiment can be selected from the total number of experimental objects as candidate objects. And selecting a predetermined number of objects from the candidate objects to form a first object set, wherein the predetermined number can be calculated according to a preset proportion, and the number of the objects of the first object set can be about 10% -20% of the total experimental objects. The remaining objects other than the first set of objects may form a second set of objects. The first object set selected based on the above manner may satisfy the object condition and the number condition required for the first experiment.
If the current object belongs to the first object set, a first experiment which is met by the current object can be determined, and then the object participates in the experiment which meets the object condition.
According to embodiments of the present disclosure, all of the first experiments are divided into a plurality of first control experiments (control experiments may also be referred to as experimental branches) according to different values of experimental variables. The matching information further includes: and the first object sets are divided to obtain a plurality of first sub-object sets and a plurality of first comparison experiments, wherein the first sub-object sets and the first comparison experiments are in one-to-one correspondence, and objects in any two first sub-object sets have no intersection.
According to an embodiment of the present disclosure, each second experiment is divided into a plurality of second control experiments according to different values of experimental variables. The matching information further includes: and the second object set is divided to obtain a plurality of matching relations between the second sub-object sets and the second comparison experiments in a one-to-one correspondence manner.
Fig. 5 schematically illustrates a schematic diagram of an experimental partitioning approach according to an embodiment of the present disclosure.
As shown in FIG. 5, along with the first example described above, experiment A is a first experiment and experiments B, C and D are each a second experiment. For example, experiment a was divided into 5 control experiments (A1-A5) according to 5 background colors of experiment a, one background color for each control experiment. Accordingly, the experiment layer 501 where the experiment a is located may be divided into 5 sections, each section corresponds to a part of the objects in the first object set, each section corresponds to a control experiment, and the objects in different sections have no intersection.
If experiments B, C and D also each have 5 transformed colors, then experiments B, C and D can be divided into 5 control experiments (B1-B5, C1-C5, D1-D5), respectively, and for each second experiment, the second set of objects can be divided into 5 subsets, one control experiment for each subset. Accordingly, the experimental layers 501-504 where experiments B, C and D are located can be divided into 5 sections, one section corresponding to each control experiment. There is no intersection of subjects between subsets belonging to the same second experiment, i.e. one subject may participate in multiple second experiments, but only one control experiment in each second experiment.
Fig. 6 schematically illustrates a schematic diagram of an experimental partitioning approach according to another embodiment of the present disclosure.
As shown in fig. 6, along with the second example described above, experiments a and B are each a first experiment, and experiments C and D are each a second experiment. If experiment a has 3 background colors and experiment B has 2 font colors, experiment a is divided into 3 control experiments (A1 to A3) according to the 3 background colors of experiment a, and experiment B is divided into 2 control experiments (B1 to B2) according to the 2 font colors of experiment B, the first experiment is divided into 5 control experiments altogether, and the experiment layer 601 needs to be divided into 5 sections, that is, the first object set is divided into 5 subsets, each subset corresponds to one control experiment.
If experiments C and D each had 5 shifted colors, experiments C and D could be divided into 5 control experiments (C1-C5, D1-D5), respectively. For each second experiment, the second set of objects may be divided into 5 subsets, one for each control experiment. Accordingly, the experimental layers 501-504 where experiments B, C and D are located can be divided into 5 sections, one section corresponding to each control experiment.
According to the embodiment of the disclosure, for the case that each experiment has multiple control experiments, the first object set and the second object set are divided into multiple subsets, so that intersection among the participating objects of different control experiments of the same experiment is avoided, and the chaotic condition that one object corresponds to two page background colors is avoided.
According to an embodiment of the present disclosure, selecting a predetermined number of objects from a plurality of candidate objects to form a first object set includes at least one of the following ways (1) to (2):
(1) Randomly extracting a predetermined number of objects from the plurality of candidate objects to form a first set of objects.
(2) An object whose object behavior similarity satisfies a predetermined similarity condition is selected from a plurality of candidate objects to form a first object set.
For example, in forming the first object set, after selecting candidate objects satisfying the object condition from the total number of experimental objects, a predetermined number of objects may be randomly selected from the candidate objects to form the first object set. And each experimental layer can bind a random salt value, and in the interval division process of each experimental layer, the random salt value can uniformly scatter experimental objects of the experimental layer into different intervals.
For another example, in the process of forming the first object set, after candidate objects meeting object conditions are selected from the total number of experimental objects, a predetermined number of objects with high object behavior similarity may be extracted from the candidate objects to form the first object set, for example, three objects need to be extracted from the objects 1 to 10 to form the first object set, where the objects 1,2, and 4 have high object behavior similarity, and then the objects 1,2, and 4 may be extracted into experimental layers corresponding to the first experiment. The object behaviors include clicking, searching, browsing and other behaviors, and the high similarity of the object behaviors can be, for example, that the clicking amount, searching amount, browsing amount and other behavior indexes of the object are similar. Based on the scheme, objects with similar behaviors can be screened out according to the object behavior indexes to participate in the first experiment, so that more scientific flow distribution and more referential effect can be ensured.
In the embodiment of the disclosure, the first object set may also be selected from the full-scale experimental objects, and in the process of performing sampling from the full-scale objects to form the first object set and distributing the objects to different comparison experimental intervals, the first object set may also be performed in an orthogonal manner. For example, an orthogonal table of a combination method of each of the comparison experiments may be obtained by an orthogonal experiment method, and then a comparison experiment combination corresponding to each of the experiment objects may be determined according to the orthogonal table, and accordingly, an object group (object group may also be referred to as a sub-object set) matched with each of the comparison experiments may also be obtained. And uniformly extracting a predetermined number of objects from each object group of the second experiment to form a first object set. The orthogonality of the experiment may not be affected based on this approach.
Fig. 7 schematically illustrates a schematic diagram of subject distribution according to an embodiment of the present disclosure.
As shown in fig. 7, for example, the existing experiments A, B, C, D and E, experiment a is the first experiment, experiment a is mutually exclusive to the rest of the experiments, and experiments B, C, D and E are not mutually exclusive. Wherein experiments A, B, C, D and E were each divided into 5 control experiments (A1-A5, B1-B5, C1-C5, D1-D5, E1-E5), one control experiment corresponding to every 5 cells from left to right in the figure. The prior full-quantity experimental objects 1 to 25 can determine the corresponding control experimental combination of each experimental object according to an orthogonal experimental method. For example, subject 1 corresponds to the control experimental combination: a1, B1, C1, D1 and E1; subject 6 corresponds to the control experimental combination: a2, B2, C4, D5 and E3; subject 16 corresponds to the control experimental combination: a4, B3, C2, D4 and E5. Accordingly, each of the subjects matched in the control experiment can be obtained, for example, the subjects matched in the control experiment B1 are subjects 1, 10, 15, 20 and 25; subjects matched to control experiment C2 were subjects 2, 9, 15, 16 and 22; subjects matched to control experiment E5 were subjects 5, 8, 12, 16 and 25. In extracting the first set of objects, objects may be extracted uniformly from each group of objects in the second experiment, e.g., one object from each of the 5 groups of objects in experiment B, resulting in first set of objects 1, 6, 11, 16, and 25, and extracted objects 1, 6, 11, 16, and 25 also being located in different groups of experiments C, D and E, respectively. Based on the first object set, the second object set and the object distribution of each subset obtained in the mode, orthogonality of experiments can be met, and the experiments can be completed efficiently and quickly.
In the embodiment of the disclosure, in the process of performing object flow distribution by using pre-configured matching information, an access request is received, hash modulus is performed on an object identifier of a current object, and whether the current object hits a first experiment or a second experiment is calculated by using the hash modulus and according to the matching information, namely, a target experiment in which the current object needs to participate is determined. And judging which control experiment under the target experiment the current object needs to participate in. If the objects of each comparison experiment are randomly allocated in the matching information configuration process, after the target experiment corresponding to the current object is determined, the current object is randomly allocated to one of the comparison experiments. If the object of each comparison experiment is determined by using an orthogonal experiment method in the matching information configuration process, after determining the target experiment corresponding to the current object, the current object can be distributed to the corresponding comparison experiment according to the matching relation between the configured object and each comparison experiment, and the specific experiment branch configuration of the hit experiment can be judged and issued by combining the KV dictionary of orthogonal sampling.
Another aspect of the disclosed embodiments also provides a test data processing apparatus for controlling device execution.
Fig. 8 is a block diagram of a request processing apparatus used to implement an embodiment of the present disclosure.
As shown in fig. 8, the test data processing apparatus 800 includes an acquisition module 810 and a selection module 820.
The obtaining module 810 is configured to obtain an access request from a current object; and
The selection module 820 is configured to select, in response to the access request, a target experiment for the current object from a plurality of experiments based on preset matching information, where the plurality of experiments includes at least one first experiment and a plurality of second experiments, the first experiment is an experiment mutually exclusive to other experiments in the plurality of experiments, and the second experiment is an experiment other than the first experiment in the plurality of experiments.
Wherein, the matching information includes: the method comprises the steps of matching a first object set with a first experiment and matching a second object set with a second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects.
According to an embodiment of the present disclosure, the selection module is further configured to: selecting a first experiment from at least one first experiment as a target experiment in the case that the current object belongs to the first object set; in the case that the current object belongs to the second object set, a plurality of second experiments are taken as target experiments.
According to an embodiment of the disclosure, the request processing apparatus further includes a page module for: generating a display page based on the target experiment; and outputting the display page to the current object.
According to an embodiment of the present disclosure, the request processing apparatus further includes a forming module for: obtaining subject conditions for each first experiment; selecting a plurality of candidate objects meeting the object condition of any one of the first experiments from a plurality of preset objects; a predetermined number of objects are selected from a plurality of candidate objects to form a first set of objects.
According to an embodiment of the present disclosure, the forming module is further configured to perform at least one of: randomly extracting a predetermined number of objects from a plurality of candidate objects to form a first object set; dividing the plurality of candidate objects into a plurality of candidate object sets, and extracting the same number of candidate objects from each candidate object set to form a first object set; an object whose object behavior similarity satisfies a predetermined similarity condition is selected from a plurality of candidate objects to form a first object set.
According to an embodiment of the disclosure, each first experiment is divided into a plurality of first control experiments according to different values of experimental variables; the matching information further includes: and the first object sets are divided to obtain a plurality of first sub-object sets and a plurality of first comparison experiments, wherein the first sub-object sets and the first comparison experiments are in one-to-one correspondence, and objects in any two first sub-object sets have no intersection.
According to an embodiment of the disclosure, each second experiment is divided into a plurality of second control experiments according to different values of experimental variables; the matching information further includes: and the second object set is divided to obtain a plurality of matching relations between the second sub-object sets and the second comparison experiments in a one-to-one correspondence manner.
Any number of modules, sub-modules, units, sub-units, or at least some of the functionality of any number of the sub-units according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be implemented as split into multiple 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-chip, a system-on-substrate, a system-on-package, an Application Specific Integrated Circuit (ASIC), or in any other reasonable manner of hardware or firmware that integrates or encapsulates the circuit, or in any one of or a suitable combination of three of software, hardware, and firmware. Or one or more of the modules, sub-modules, units, sub-units according to embodiments of the present disclosure may be at least partially implemented as computer program modules, which, when executed, may perform the corresponding functions.
It should be noted that, in the embodiment of the present disclosure, the request processing device portion corresponds to the request processing method portion in the embodiment of the present disclosure, and the description of the request processing device portion specifically refers to the request processing method portion and is not described herein again.
According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.
Fig. 9 shows a schematic block diagram of an example electronic device 900 that may be used to implement embodiments of the present disclosure. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 9, the apparatus 900 includes a computing unit 901 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 902 or a computer program loaded from a storage unit 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data required for the operation of the device 900 can also be stored. The computing unit 901, the ROM 902, and the RAM 903 are connected to each other by a bus 904. An input/output (I/O) interface 905 is also connected to the bus 904.
Various components in device 900 are connected to I/O interface 905, including: an input unit 906 such as a keyboard, a mouse, or the like; an output unit 907 such as various types of displays, speakers, and the like; a storage unit 908 such as a magnetic disk, an optical disk, or the like; and a communication unit 909 such as a network card, modem, wireless communication transceiver, or the like. The communication unit 909 allows the device 900 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunications networks.
The computing unit 901 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 901 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 901 performs the respective methods and processes described above, for example, a request processing method. For example, in some embodiments, the request processing method may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 908. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 900 via the ROM 902 and/or the communication unit 909. When the computer program is loaded into the RAM 903 and executed by the computing unit 901, one or more steps of the request processing method described above may be performed. Alternatively, in other embodiments, the computing unit 901 may be configured to perform the request processing method in any other suitable way (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on 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.
To provide for interaction with an object, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a subject; and a keyboard and pointing device (e.g., a mouse or trackball) by which an object can provide input to the computer. Other kinds of devices may also be used to provide for interaction with an object; for example, feedback provided to the subject may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the subject may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., an object computer having a graphical object interface or a web browser through which an object can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel or sequentially or in a different order, provided that the desired results of the technical solutions of the present disclosure are achieved, and are not limited herein.
The above detailed description should not be taken as limiting the scope of the present disclosure. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present disclosure are intended to be included within the scope of the present disclosure.

Claims (15)

1. A request processing method performed by an electronic device, comprising:
obtaining an access request from a current object; and
Responding to the access request, and selecting a target experiment aiming at the current object from a plurality of experiments based on preset matching information, wherein the plurality of experiments comprise at least one first experiment and a plurality of second experiments, the first experiment is mutually exclusive to other experiments in the plurality of experiments, and the second experiment is an experiment except the first experiment in the plurality of experiments;
Wherein the matching information includes: a matching relationship between a first object set and the first experiment and a matching relationship between a second object set and the second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises other objects except the part of objects in the plurality of objects;
wherein the selecting a target experiment for the current subject from a plurality of experiments comprises:
selecting a first experiment from the at least one first experiment as the target experiment under the condition that the current object belongs to a first object set, so that the current object can only participate in the target experiment;
And taking the plurality of second experiments as the target experiment when the current object belongs to a second object set, so that the current object participates in each second experiment in the plurality of second experiments.
2. The method of claim 1, further comprising:
Generating a display page based on the target experiment; and
And outputting the display page to the current object.
3. The method of any of claims 1-2, further comprising: forming the first set of objects, wherein the forming the first set of objects comprises:
obtaining a subject condition for each of the first experiments;
selecting a plurality of candidate objects meeting the object condition of any one first experiment from the preset plurality of objects;
a predetermined number of objects from the plurality of candidate objects are selected to form the first set of objects.
4. The method of claim 3, wherein the selecting a predetermined number of objects from the plurality of candidate objects to form the first set of objects comprises at least one of:
randomly extracting a predetermined number of objects from the plurality of candidate objects to form the first object set;
Selecting objects with object behavior similarity meeting a predetermined similarity condition from the plurality of candidate objects to form the first object set.
5. The method of any one of claims 1 to 2, wherein the at least one first experiment is divided into a plurality of first control experiments according to different values of experimental variables;
The matching information further includes: and the first object sets are divided to obtain a plurality of first sub-object sets and a plurality of first comparison experiments, wherein the first sub-object sets are in one-to-one correspondence with the first comparison experiments, and objects in any two first sub-object sets have no intersection.
6. The method of claim 5, wherein each of the second experiments is divided into a plurality of second control experiments according to different values of experimental variables;
the matching information further includes: and the second object set is divided to obtain a plurality of matching relations between a plurality of second sub-object sets and the plurality of second control experiments in a one-to-one correspondence manner.
7. A request processing apparatus comprising:
The acquisition module is used for acquiring an access request from the current object; and
A selection module, configured to respond to the access request, and select a target experiment for the current object from a plurality of experiments based on preset matching information, where the plurality of experiments includes at least one first experiment and a plurality of second experiments, the first experiment is an experiment mutually exclusive to other experiments in the plurality of experiments, and the second experiment is an experiment in the plurality of experiments except the first experiment;
Wherein the matching information includes: a matching relationship between a first object set and the first experiment and a matching relationship between a second object set and the second experiment, wherein the first object set comprises a part of objects in a preset plurality of objects, and the second object set comprises objects except the part of objects in the plurality of objects;
Wherein the selection module is further configured to:
selecting a first experiment from the at least one first experiment as the target experiment under the condition that the current object belongs to a first object set, so that the current object can only participate in the target experiment;
And taking the plurality of second experiments as the target experiment when the current object belongs to a second object set, so that the current object participates in each second experiment in the plurality of second experiments.
8. The apparatus of claim 7, further comprising a page module to:
Generating a display page based on the target experiment; and
And outputting the display page to the current object.
9. The apparatus of any of claims 7 to 8, further comprising a forming module to:
obtaining a subject condition for each of the first experiments;
selecting a plurality of candidate objects meeting the object condition of any one first experiment from the preset plurality of objects;
a predetermined number of objects from the plurality of candidate objects are selected to form the first set of objects.
10. The apparatus of claim 9, wherein the forming module is further configured to perform at least one of:
randomly extracting a predetermined number of objects from the plurality of candidate objects to form the first object set;
Selecting objects with object behavior similarity meeting a predetermined similarity condition from the plurality of candidate objects to form the first object set.
11. The apparatus of any one of claims 7 to 8, wherein the at least one first experiment is divided into a plurality of first control experiments according to different values of experimental variables;
the matching information further includes: and the first object sets are divided to obtain a plurality of first sub-object sets which are in one-to-one correspondence with the first comparison experiments, and the objects in any two first sub-object sets have no intersection.
12. The apparatus of claim 11, wherein each of the second experiments is divided into a plurality of second control experiments according to different values of experimental variables;
the matching information further includes: and the second object set is divided to obtain a plurality of matching relations between a plurality of second sub-object sets and the plurality of second control experiments in a one-to-one correspondence manner.
13. An electronic device, comprising:
at least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-6.
14. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-6.
15. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any of claims 1-6.
CN202110248657.XA 2021-03-05 2021-03-05 Request processing method, apparatus, device, medium, and program product Active CN112966180B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110248657.XA CN112966180B (en) 2021-03-05 2021-03-05 Request processing method, apparatus, device, medium, and program product

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110248657.XA CN112966180B (en) 2021-03-05 2021-03-05 Request processing method, apparatus, device, medium, and program product

Publications (2)

Publication Number Publication Date
CN112966180A CN112966180A (en) 2021-06-15
CN112966180B true CN112966180B (en) 2024-05-17

Family

ID=76277417

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110248657.XA Active CN112966180B (en) 2021-03-05 2021-03-05 Request processing method, apparatus, device, medium, and program product

Country Status (1)

Country Link
CN (1) CN112966180B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5930497A (en) * 1997-12-11 1999-07-27 International Business Machines Corporation Method and means for generation of realistic access patterns in storage subsystem benchmarking and other tests
US8312137B1 (en) * 2010-01-04 2012-11-13 Google Inc. Live experiment framework
US8738733B1 (en) * 2007-09-25 2014-05-27 Amazon Technologies, Inc. Dynamic control system for managing redirection of requests for content
CN110046296A (en) * 2019-03-12 2019-07-23 平安城市建设科技(深圳)有限公司 Processing method, device, equipment and the storage medium of experimental data
CN110046092A (en) * 2019-03-12 2019-07-23 北京创鑫旅程网络技术有限公司 Test shunt method, device, electronic equipment and computer readable storage medium
CN110808872A (en) * 2019-10-21 2020-02-18 微梦创科网络科技(中国)有限公司 Method and device for realizing flow experiment and electronic equipment

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5930497A (en) * 1997-12-11 1999-07-27 International Business Machines Corporation Method and means for generation of realistic access patterns in storage subsystem benchmarking and other tests
US8738733B1 (en) * 2007-09-25 2014-05-27 Amazon Technologies, Inc. Dynamic control system for managing redirection of requests for content
US8312137B1 (en) * 2010-01-04 2012-11-13 Google Inc. Live experiment framework
CN110046296A (en) * 2019-03-12 2019-07-23 平安城市建设科技(深圳)有限公司 Processing method, device, equipment and the storage medium of experimental data
CN110046092A (en) * 2019-03-12 2019-07-23 北京创鑫旅程网络技术有限公司 Test shunt method, device, electronic equipment and computer readable storage medium
CN110808872A (en) * 2019-10-21 2020-02-18 微梦创科网络科技(中国)有限公司 Method and device for realizing flow experiment and electronic equipment

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SAN中的分布式锁机制;姚念民, 舒继武, 郑纬民;计算机研究与发展;20050216(第02期);338-343页 *
空间科学实验通用地面检测系统研制;于强;王小庆;耿宝明;周海莲;徐自衡;苟文博;;空间科学学报;20160715(04);577-583页 *
网络虚拟电路实验室的Java实现;李凌霞, 刘志镜;计算机辅助设计与图形学学报;20040320(第03期);378-381页 *

Also Published As

Publication number Publication date
CN112966180A (en) 2021-06-15

Similar Documents

Publication Publication Date Title
WO2021129367A1 (en) Method and apparatus for monitoring distributed storage system
CN112527848B (en) Report data query method, device and system based on multiple data sources and storage medium
CN110334074B (en) Data processing method, device, server and storage medium
US20200004785A1 (en) Automatic grouping based on user behavior
US20220156324A1 (en) Graph refactorization method and graph refactorization apparatus
CN109033184B (en) Data processing method and device
CN112905596B (en) Data processing method, device, computer equipment and storage medium
CN112966180B (en) Request processing method, apparatus, device, medium, and program product
CN113312560A (en) Group detection method and device and electronic equipment
CN111159131A (en) Performance optimization method, device, equipment and computer readable storage medium
CN110505276B (en) Object matching method, device and system, electronic equipment and storage medium
CN111552715A (en) User query method and device
CN115794245A (en) Data loading method and device, electronic equipment and storage medium
CN113852840B (en) Video rendering method, device, electronic equipment and storage medium
CN113641670B (en) Data storage and data retrieval method and device, electronic equipment and storage medium
CN112711588B (en) Method and device for multi-table connection
CN113691403A (en) Topological node configuration method, related device and computer program product
CN110768855B (en) Method and device for testing linkmzation performance
US10949232B2 (en) Managing virtualized computing resources in a cloud computing environment
CN112631804A (en) Service call request processing method based on isolation environment and computer equipment
CN110825477A (en) Method, device and equipment for loading graphical interface and storage medium
US11170000B2 (en) Parallel map and reduce on hash chains
KR102185980B1 (en) Table processing method and apparatus
US20190034310A1 (en) Display control method and display control device
US20220335039A1 (en) Data file distribution method and equipment, smart device and computer 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