CN111695746B - Queuing data processing method and queuing data processing method system - Google Patents

Queuing data processing method and queuing data processing method system Download PDF

Info

Publication number
CN111695746B
CN111695746B CN201910184111.5A CN201910184111A CN111695746B CN 111695746 B CN111695746 B CN 111695746B CN 201910184111 A CN201910184111 A CN 201910184111A CN 111695746 B CN111695746 B CN 111695746B
Authority
CN
China
Prior art keywords
value
queuing
activity
data processing
data
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
CN201910184111.5A
Other languages
Chinese (zh)
Other versions
CN111695746A (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.)
China Unionpay Co Ltd
Original Assignee
China Unionpay 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 China Unionpay Co Ltd filed Critical China Unionpay Co Ltd
Priority to CN201910184111.5A priority Critical patent/CN111695746B/en
Publication of CN111695746A publication Critical patent/CN111695746A/en
Application granted granted Critical
Publication of CN111695746B publication Critical patent/CN111695746B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635Processing of requisition or of purchase orders

Abstract

The present invention relates to a queuing data processing method and a queuing data processing system. The queuing data processing method comprises the following steps: a parameter acquisition step of acquiring first to nth related parameters, wherein, the related parameters are data related to queuing data generated during queuing and/or data related to user information, and N is a natural number; activity value a step of calculation, in which, first activity value data is calculated based on the first through nth correlation parameters. In accordance with the present invention, a queuing data processing method and a queuing data processing system which are compatible with fairness and high concurrency can be provided, and can support high concurrency, improve the stability of the system.

Description

Queuing data processing method and queuing data processing method system
Technical Field
The invention relates to the computer technology, in particular to a queuing data processing method and a queuing data processing system for realizing high concurrency.
Background
Merchants selling on the network offer "seconds to kill" for promotions. The "second kill" activity is typically first come first, resulting in user-up, system stuck, or by setting a threshold, only processing requests within the threshold, ignoring later requests, and user transaction timeout. These situations not only tend to cause problems with the system, but also give a poor experience to the user.
For example, in "twenty-two" like activities, events such as downtime of the system due to too many transaction requests often occur, not only creating a poor experience for the user, but also affecting the merchant or sales platform.
Disclosure of Invention
In view of the above problems, the present invention aims to propose a queuing data processing method and a queuing data processing system which are simple in queuing logic and improve concurrent processing capacity of a server.
The queuing data processing method according to one aspect of the present invention is characterized in that the queuing data processing method is used for performing data processing on queuing data which are queued to a server by a user through a client, and the method comprises the following steps:
a parameter acquisition step of acquiring first to nth related parameters, wherein the related parameters are data related to queuing data generated at the time of queuing and/or data related to user information, and N is a natural number; and
an activity value calculation step of calculating first activity value data based on the first to nth correlation parameters.
Optionally, in the parameter obtaining step, a random number corresponding to the current queuing, a contribution value of the user and a ranking value of the current queuing of the user are obtained, and in the activity value calculating step, first activity value data is calculated based on the random number, the contribution value and the ranking value.
Optionally, after the activity value calculation step, further includes:
and a step of anti-cheating verification, in which second activity value data is calculated based on the random number, the contribution value and the ranking value, whether the first activity value data and the second activity value data are the same or not is compared, and if the first activity value data and the second activity value data are the same, the anti-cheating phenomenon is judged to be absent and verification is passed.
Optionally, the activity value calculating step is implemented at a server, and calculates the first activity value data based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
Optionally, the activity value calculating step is implemented at a client, and the first activity value data is calculated based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
the anti-cheating verification step is implemented at a server and the second activity value data is calculated based on the following formula:
a second activity value δ2=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
Optionally, the ranking value is generated based on the order value in which the users are queued and the total number of users engaged in the activity.
The queuing data processing system of the present invention is a queuing data processing system for performing data processing on queuing data queued from a client to a server, the queuing data processing system comprising:
a parameter acquisition module for acquiring first to Nth related parameters, wherein the related parameters are data related to queuing data generated during queuing and/or data related to user information, and N is a natural number; and
and an activity value calculation module that calculates first activity value data based on the first to nth correlation parameters.
The queuing data processing system of the invention is characterized in that the queuing data processing system is used for processing the queuing data which are queued to the server through the client by the user,
the server side comprises:
the ordering module is used for receiving the requests queued from the user and providing order values according to the received request order;
the activity management module is used for generating a random number corresponding to the queuing and generating and managing a contribution value corresponding to the user;
an activity value calculation module, configured to obtain a ranking value of the current user queue based on the sequence value, and calculate first activity value data based on the random number, the contribution value, and the ranking value; and
and the database is used for storing the random number, the sorting value, the contribution value and the first activity value data.
Optionally, the activity value calculation module calculates the first activity value data based on the following formula:
first activity value δ=random number α x a% + contribution value β x b% + ranking value γ x c%, wherein a%, b%, c% are weights.
Optionally, the activity value calculation module generates the ranking value based on the order value queued by the users and the total number of users engaged in the activity.
The queuing data processing system of the present invention is a queuing data processing system for performing data processing on queuing data queued from a client to a server, the queuing data processing system comprising: the client side and the service side are connected with each other,
the server side comprises:
the ordering module is used for receiving the requests queued from the user and providing order values according to the received request order;
the activity management module is used for generating a random number corresponding to the queuing and generating and managing a contribution value corresponding to the user; and
a database for storing the random number, the ranking value and the contribution value,
the client comprises:
and the activity value calculation module is used for acquiring the random number, the sequence value and the contribution value from the server, acquiring a sequence value based on the sequence value, and calculating first activity value data based on the random number, the sequence value and the contribution value.
Optionally, the server further includes:
and the anti-cheating module is used for obtaining a sorting value based on a sequence value, calculating second activity value data based on the random number, the contribution value and the sorting value, comparing whether the first activity value data and the second activity value data obtained from the client are identical, and judging that no cheating phenomenon exists and passing verification if the first activity value data and the second activity value data are identical.
Optionally, the activity value calculation module calculates the first activity value data based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
the anti-cheating module calculates the second activity value data based on the following formula:
a second activity value δ2=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
Optionally, the ranking value is generated based on the order value in which the users are queued and the total number of users engaged in the activity.
The computer-readable medium of the present invention, on which a computer program is stored, is characterized in that,
the computer program, when executed by a processor, implements the queuing data processing method described above.
The computer device of the invention comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, and is characterized in that the processor executes the computer program to realize the queuing data processing method.
According to the invention, a queuing data processing method and a queuing data processing system which are both fairness and high concurrency can be provided. By obtaining the queuing order from the ranking of the activity values δ by the random number α×a++the contribution value β×b++the ranking value γ×c+=the activity value δ, and further performing anti-cheating processing on the activity value δ for which the activity qualification is obtained, it is possible to prevent the occurrence of the cheating phenomenon.
The queuing data processing method and the queuing data processing system can further ensure fairness of new and old users, support high concurrency and improve stability of the system. In addition, most of calculation is completed at the client, server pressure is dispersed, and the probability of downtime of the system is reduced. On the other hand, queuing logic is simple, and the concurrency processing capacity of the server is improved.
Other features and advantages of the methods and apparatus of the present invention will be apparent from or elucidated with reference to the drawings, taken in conjunction with the accompanying drawings, and the detailed description which follows in conjunction with the accompanying drawings, serve to illustrate certain principles of the invention.
Drawings
Fig. 1 is a schematic flow chart showing a queuing data processing method of the present invention.
Fig. 2 is a block diagram showing the configuration of a queuing data processing system according to a first embodiment of the present invention.
Fig. 3 is a flowchart showing a queuing data processing method according to a first embodiment of the present invention.
FIG. 4 is a block diagram showing the construction of a queuing data processing system according to a second embodiment of the present invention.
Fig. 5 is a flowchart showing a queuing data processing method according to a second embodiment of the present invention.
Detailed Description
The following presents a simplified summary of the invention in order to provide a basic understanding of the invention. It is not intended to identify key or critical elements of the invention or to delineate the scope of the invention.
Fig. 1 is a schematic flow chart showing a queuing data processing method of the present invention.
The queuing data processing method of the present invention is used for performing data processing on queuing data which is queued to a server by a user through a client, as shown in fig. 1, and comprises the following steps:
parameter acquisition step S100: acquiring first to Nth related parameters, wherein the related parameters are data related to queuing data generated during queuing and/or data related to user information, and N is a natural number; and
an activity value calculation step S200: first activity value data is calculated based on the first through nth correlation parameters.
Here, as the relevant parameter, data related to queuing data generated at the time of queuing and/or data related to user information are used. Examples of the "data related to the queuing data generated during queuing" include the order of queuing, the time when queuing starts, the number of random numbers generated by the actions of queuing after queuing, and the like. The "data related to user information" may be, for example,: and calculating the contribution value according to the conditions of the time, consumption limit, daily sign-in, participating in activities and the like of the user holding the product or joining the merchant website.
The activity calculating step S200 may be implemented at the client, and the calculated first activity value data may be directly provided to the user; alternatively, the activity calculating step S200 may be implemented at the server, and the calculated first activity value data may be sent to the user or provided to the user according to the user request.
As one embodiment of the activity calculating step S200, for example, a random number and a ranking value may be acquired as "data related to queuing data generated at the time of queuing", a contribution value is acquired as data related to user information, and the first activity value data is calculated based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γ x c%.
Of course, the present invention is not limited to the calculation method of the above formula, and various kinds of conversion may be performed, and a different calculation formula may be used to obtain the first activity value δ1, for example, a method of taking a modulus, taking a weighted average, or the like may be used.
In the case where the activity calculation step S200 is implemented at the client, it is preferable to further include, after the step:
and a counter-cheating verification step S300 (not shown) of calculating second activity value data based on the first to nth correlation parameters, comparing whether the first activity value data and the second activity value data are identical, and if they are identical, judging that there is no cheating phenomenon and passing the verification.
As one embodiment, the activity value calculation step S200 is implemented at the client, and calculates the first activity value data δ1 based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
and, the anti-cheating verification step S300 is implemented at the server side, and the second activity value data δ2 is calculated based on the following formula:
a second activity value δ2=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
Next, a queuing data processing system of the present invention will be briefly described. The queuing data processing system of the present invention is used for performing data processing on queuing data which are queued to a server by a user through a client, and the queuing data processing system is provided with:
a parameter acquisition module for acquiring first to Nth related parameters, wherein the related parameters are data related to queuing data generated during queuing and/or data related to user information, and N is a natural number; and
and an activity value calculation module that calculates first activity value data based on the first to nth correlation parameters.
Hereinafter, a detailed embodiment of the queuing data processing method and the queuing data processing system according to the present invention will be described.
First, a queuing data processing method and a queuing data processing system according to a first embodiment of the present invention will be described.
Fig. 2 is a block diagram showing the configuration of a queuing data processing system according to a first embodiment of the present invention. Next, a queuing data processing system according to a first embodiment of the present invention is described with reference to fig. 2.
As shown in fig. 2, the queuing data processing system according to the first embodiment of the present invention includes a server 100 and a client 200.
Wherein, the server 100 includes:
a ranking module 110 for receiving requests queued from users and providing a ranking value in the order of the received requests;
the activity management module 120 is configured to generate a random number corresponding to the queuing and generate and manage a contribution value corresponding to the user;
a database 130 for storing the random number, the ranking value, and the contribution value;
the anti-cheating module 140 is configured to obtain a ranking value based on a sequence value, calculate second activity value data based on the random number, the contribution value and the ranking value, compare whether the first activity value data and the second activity value data obtained from the client are identical, and if the first activity value data and the second activity value data are identical, judge that no cheating phenomenon exists and pass verification; and
the first communication module 150 is configured to communicate with the client.
The client 200 includes:
an activity value calculation module 210 that obtains the random number, the order value, and the contribution value from the server, obtains an order value based on the order value, and calculates first activity value data based on the random number, the order value, and the contribution value; and
and the second communication module 220 is configured to communicate with the client.
Wherein the activity value calculation module 210 calculates the first activity value data based on the following formula:
first activity value δ1=random number α×a++contribution value β×b++ranking value γ×c), where a%, b%, c% are weights.
Wherein the anti-cheating module 140 calculates the second activity value data δ2 based on the following formula:
a second activity value δ2=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
The random number α, the contribution value β, and the ranking value γ will be described below.
The random number α may also be referred to as a lucky value α, which may be randomly assigned by the server, e.g. the user registers participation in the event with the server via the client, and the server assigns a random number. If the activity purpose is to attract new users, a pool of lucky values (or a pool of random number parameters of the new users) can be set for the new users individually; if a pool of lucky values (or a pool of random number parameters of the old user) is separately set for feeding back the old user, by setting two or more different random number parameters Chi Laisheng into random numbers here, for example, the random numbers can be flexibly generated according to the requirement request, for example, in the case of the new and old users, the fairness of the new and old users can be ensured.
The contribution value β may be, for example, a user continuously using the product, and the server increases its contribution value according to a rule, where the contribution value rule may be configured, such as checking in every day, participating in an activity, and so on, to accumulate the contribution value.
The ranking value γ is generated based on the order value of the user queuing and the total number of users participating in the activity, and the ranking value γ=the total number of users adding the activity-the order value. When the user participates in the activity to queue, the user submitting request server only needs to return a sequence value and the specified total number of the users participating in the activity, so that the sequencing value gamma can be obtained.
In addition, each value corresponds to a weight a, b, c, which may be configured according to the purpose of each activity.
Next, a queuing data processing method according to a first embodiment of the present invention will be described with reference to fig. 3.
As shown in fig. 3, in step S1, a user registers participation in an activity with the server 100 through the client 200, submits a request to the server 100, the activity management module 120 of the server 100 records user information, generates a lucky value α, and returns the lucky value α, a contribution value β, and weights of the respective values to the activity value calculation module 210 of the client 200. When the activity starts, in step S2, the user submits a request to the server 100 through the client 200, the ranking module 110 returns the sequence value and the activity registration total to the activity value calculation module 210 of the client 200, and in step S3, the activity value calculation module 210 calculates the ranking value γ and then calculates the activity value δ1. The user may view his own activity value δ1 at the client 200.
In step S4, the client submits a transaction request, specifically, after the client 200 calculates the activity value δ, the client submits the request information such as the user information, the activity value δ1, the signature, etc., to the server 100. After the server 100 verifies the signature in step S5, it replies "the activity accepted successfully, please query the sorting result later". After the request receiving period is finished, in step S6, the server 100 ranks the activity values δ1, according to the computed rank of the first activity value δ1, obtains the queuing order, records the request information and the ranking result, and performs anti-cheating verification by the anti-cheating module 140 for the request for obtaining the activity qualification in step S7, where the anti-cheating module 140 computes the activity value δ2, if the activity value δ2 is different from the activity value δ1, the anti-cheating verification is not passed, and in step S8, the ranking is invalid, and if the activity value δ2 is the same as the activity value δ1, the ranking is valid by the anti-cheating verification in step S8. In step S9, the client 200 periodically or the user actively initiates the ranking result query, and in step S10, the ranking result is checked, and the server 100 returns the client 200 ranking result (for example, the range of activity values hitting the activity qualification, the activity value δ of the user, etc.), the ranking status (if the anti-cheating check is not passed, it is invalid), etc. The check ordering result specifically includes, for example: checking whether the ordering result message is qualified for the activity, whether the ordering is effective, if the ordering is ineffective or the activity qualification is not obtained, displaying that the activity qualification is not obtained by the client, and if the ordering is effective and hit, displaying that the activity qualification is obtained by the client, and continuing the next activity. The user who is qualified for the activity can continue to participate in the activity in step S11, and the user who is not qualified for the activity ends the activity in step S12 and can also clearly know the sorting positions thereof, thereby being able to enhance the user experience.
Next, a queuing data processing method and a queuing data processing system according to a second embodiment of the present invention will be described.
The anti-cheating module may be omitted in the second embodiment. For example, when a user submits a transaction request, the server records request information, synchronously responds that the activity is accepted successfully and the ordering result is queried later, and on the other hand, the server asynchronously calculates the activity value delta, and the client periodically tasks or the user actively queries the ordering result.
FIG. 4 is a block diagram showing the construction of a queuing data processing system according to a second embodiment of the present invention.
As shown in fig. 4, the queuing data processing system of the second embodiment includes a server 300 and a client 400.
The server 300 includes:
a ranking module 310 for receiving requests queued from users and providing a ranking value in the order of the received requests;
the activity management module 320 is configured to generate a random number corresponding to the queuing and generate and manage a contribution value corresponding to the user;
an activity value calculation module 330, configured to obtain a ranking value of the current user queue based on the sequence value, and calculate first activity value data based on the random number, the contribution value, and the ranking value;
a database 340 for storing the random number, the ranking value, the contribution value, and the first activity value data; and
the first communication module 350 is configured to communicate with a client.
The client 400 has a second communication module 410.
Wherein the activity value calculation module 330 generates the ranking value based on the order value of the user queuing and the total number of users participating in the activity, i.e. ranking value γ=total number of users adding the activity-order value. And, the activity value calculation module 330 calculates the first activity value data based on the following formula:
first activity value δ=random number α x a% + contribution value β x b% + ranking value γ x c%, wherein a%, b%, c% are weights.
Fig. 5 is a flowchart showing a queuing data processing method according to a second embodiment of the present invention.
Next, a queuing data processing method according to a second embodiment of the present invention will be described with reference to fig. 5.
As shown in fig. 5, in step S20, the user registers participation in the event with the server 100 through the client 400, submits a request to the server 300 in step S21, the event management module 320 of the server 300 verifies the signature, records the user information, and generates the lucky value α, and in step S23, the event value calculation module 330 sorts the event values δ according to the lucky value α, the contribution value β, and the sorting value γ, and in step S24, the sorting of the event values δ can obtain the queuing order. Recording the ranking result in step S25 (e.g., storing in database 340), checking the ranking result in step S27, (checking the details of the ranking result being the same as in the first embodiment), if the user qualified for the activity can continue to participate in the activity in step S28 based on the ranking result, the user not qualified for the activity ends the activity in step S29 and can also clearly know the ranking position thereof, thereby enabling the user experience to be improved.
As described above, the invention provides a queuing data processing method and a queuing data processing system which are both fairness and high concurrency. The queuing order is obtained by ranking the random numbers α×a++the contribution values β×b++the ranking values γ×c+=the activity values δ.
Further, the anti-cheating process is performed on the activity value δ for which the activity qualification is obtained, and the occurrence of the cheating phenomenon can be prevented.
Further according to the queuing data processing method and the queuing data processing system of the present invention, the random numbers are respectively generated for different levels of users (for example, old users and new users) by setting up two or more random number parameter pools, thereby being capable of ensuring balance and fairness among the various levels of users.
In addition, most of calculation is completed at the client, server pressure is dispersed, probability of downtime of the system is reduced, and system stability is improved.
On the other hand, in the present invention, the queuing logic adopted is simple (the ranking value γ=the total number of active users-the ranking value), and therefore, the concurrency processing capability of the server is improved.
The invention also provides a computer readable medium having stored thereon a computer program, characterized in that the computer program, when executed by a processor, implements the queuing data processing method described above.
The invention also provides a computer device comprising a memory, a processor and a computer program stored on the memory and operable on the processor, characterized in that the processor implements the queuing data processing method described above when executing the computer program.
The above examples mainly illustrate the queuing data processing method and queuing data processing system of the present invention. Although only a few specific embodiments of the present invention have been described, those skilled in the art will appreciate that the present invention may be embodied in many other forms without departing from the spirit or scope thereof. Accordingly, the present examples and embodiments are to be considered as illustrative and not restrictive, and the invention is intended to cover various modifications and substitutions without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (8)

1. A queuing data processing method, characterized in that the queuing data processing method is used for processing queuing data which are queued to a server by a user through a client, the method is realized by the client and the server and comprises the following steps:
a parameter obtaining step, wherein a client obtains a random number corresponding to the current queuing, a contribution value of the user and a ranking value of the current queuing of the user from a server;
an activity value calculation step, wherein a client calculates first activity value data based on the random number, the contribution value and the ranking value and directly provides the first activity value data to a user through the client, wherein a queuing order is obtained based on the first activity value data; and
and a step of anti-cheating verification, in which the server calculates second activity value data based on the random number, the contribution value and the sorting value, compares whether the first activity value data and the second activity value data are identical, and judges that no cheating phenomenon exists and passes the verification if the first activity value data and the second activity value data are identical.
2. A queuing data processing method as claimed in claim 1 wherein,
the activity value calculating step is implemented at a client and calculates the first activity value data based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
3. A queuing data processing method as claimed in claim 1 or 2 wherein,
the ranking value is generated based on the order value of the user's queuing and the total number of users engaged in the activity.
4. A queuing data processing system for performing data processing on queuing data queued by a user to a server through a client, the queuing data processing system comprising: the client side and the service side are connected with each other,
the server side comprises:
the ordering module is used for receiving the requests queued from the user and providing order values according to the received request order; and
the activity management module is used for generating a random number corresponding to the queuing and generating and managing a contribution value corresponding to the user;
a database for storing the random number, the ranking value, and the contribution value; and
an anti-cheating module that obtains a ranking value based on the order value, calculates second activity value data based on the random number, the contribution value, and the ranking value, compares whether the first activity value data and the second activity value data obtained from the client are identical, determines that no cheating phenomenon exists if the two are identical, and passes a check,
the client comprises:
and the activity value calculation module is used for acquiring the random number, the sequence value and the contribution value from the server, acquiring a sequence value based on the sequence value, and calculating first activity value data based on the random number, the sequence value and the contribution value, wherein the first activity value data is directly provided for a user through a client, and queuing sequence is obtained based on the first activity value data.
5. A queuing data processing system as claimed in claim 4 wherein,
the activity value calculation module calculates the first activity value data based on the following formula:
first activity value δ1=random number α x a% + contribution value β x b% + ranking value γc%,
wherein a%, b% and c% are weights.
6. A queuing data processing system as claimed in claim 4 or 5 wherein,
the ranking value is generated based on the order value of the user's queuing and the total number of users engaged in the activity.
7. A computer readable medium having a computer program stored thereon, characterized in that,
the computer program, when executed by a processor, implements a queuing data processing method according to any one of claims 1 to 3.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the queuing data processing method of any of claims 1-3 when the computer program is executed by the processor.
CN201910184111.5A 2019-03-12 2019-03-12 Queuing data processing method and queuing data processing method system Active CN111695746B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910184111.5A CN111695746B (en) 2019-03-12 2019-03-12 Queuing data processing method and queuing data processing method system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910184111.5A CN111695746B (en) 2019-03-12 2019-03-12 Queuing data processing method and queuing data processing method system

Publications (2)

Publication Number Publication Date
CN111695746A CN111695746A (en) 2020-09-22
CN111695746B true CN111695746B (en) 2024-04-09

Family

ID=72474683

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910184111.5A Active CN111695746B (en) 2019-03-12 2019-03-12 Queuing data processing method and queuing data processing method system

Country Status (1)

Country Link
CN (1) CN111695746B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114926935A (en) * 2022-05-07 2022-08-19 中国银行股份有限公司 Negotiation signing queuing number-taking method and device and computer equipment

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7565651B1 (en) * 2000-05-25 2009-07-21 Oracle International Corporation Parallel task scheduling system for computers
CN102480407A (en) * 2010-11-24 2012-05-30 盛乐信息技术(上海)有限公司 Method for allowing user to fairly enter into queue by random number
CN105491085A (en) * 2014-09-16 2016-04-13 阿里巴巴集团控股有限公司 Method and device for on-line requesting for queuing
CN107426448A (en) * 2016-05-23 2017-12-01 上海神计信息系统工程有限公司 A kind of automatic calling allocation method being lined up based on dynamic priority
CN108564426A (en) * 2018-01-08 2018-09-21 上海陆家嘴国际金融资产交易市场股份有限公司 Finance product buys method, apparatus, equipment and computer readable storage medium at competitive price

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7565651B1 (en) * 2000-05-25 2009-07-21 Oracle International Corporation Parallel task scheduling system for computers
CN102480407A (en) * 2010-11-24 2012-05-30 盛乐信息技术(上海)有限公司 Method for allowing user to fairly enter into queue by random number
CN105491085A (en) * 2014-09-16 2016-04-13 阿里巴巴集团控股有限公司 Method and device for on-line requesting for queuing
CN107426448A (en) * 2016-05-23 2017-12-01 上海神计信息系统工程有限公司 A kind of automatic calling allocation method being lined up based on dynamic priority
CN108564426A (en) * 2018-01-08 2018-09-21 上海陆家嘴国际金融资产交易市场股份有限公司 Finance product buys method, apparatus, equipment and computer readable storage medium at competitive price

Also Published As

Publication number Publication date
CN111695746A (en) 2020-09-22

Similar Documents

Publication Publication Date Title
JP7116219B2 (en) A System for Giving Individual Goals for Multi-Sport Activities
US6824462B2 (en) Method and system for evaluating skills of contestants in online coding competitions
AU2009282190B2 (en) Object identification in images
Johnston A framework for developing a quality strategy in a customer processing operation
CN108066989B (en) Random matching team forming method and device and application server
JP5373956B1 (en) Information processing apparatus, information processing method, and information processing program
CN109508799A (en) Order allocation method, device and electronic equipment
CN111695746B (en) Queuing data processing method and queuing data processing method system
CN110070431A (en) User is counter to cheat implementation method, device, computer equipment and storage medium
CN110706134B (en) Credit contract item processing method and device
WO2008117115A2 (en) Multi-tiered career progression system and method
CN113780415B (en) User portrait generating method, device, equipment and medium based on applet game
JP2003033575A (en) Operation managing system for net contest type simulation games combining e mail for portable terminal
US20150278938A1 (en) Social community income distribution method
US20230186734A1 (en) Systems, methods, and media for an electronic skill games platform
WO2020031316A1 (en) Stadium seat sharing system, method, and program
JP2003141417A (en) Commodity sales supporting system
CN111988361A (en) Task pushing method, task pushing device and server
JP2005044006A (en) Content sharing method and device
JP2012141745A (en) Bid management device and bid management method

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