CN111325596A - Block chain based high-concurrency online purchase queuing method, equipment and medium - Google Patents
Block chain based high-concurrency online purchase queuing method, equipment and medium Download PDFInfo
- Publication number
- CN111325596A CN111325596A CN202010070954.5A CN202010070954A CN111325596A CN 111325596 A CN111325596 A CN 111325596A CN 202010070954 A CN202010070954 A CN 202010070954A CN 111325596 A CN111325596 A CN 111325596A
- Authority
- CN
- China
- Prior art keywords
- user
- killing
- information
- user terminal
- request message
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000011156 evaluation Methods 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 201000009032 substance abuse Diseases 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012797 qualification Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0607—Regulated
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/25—Integrating or interfacing systems involving database management systems
- G06F16/252—Integrating or interfacing systems involving database management systems between a Database Management System and a front-end application
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Commerce
- G06Q30/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0609—Buyer or seller confidence or verification
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses a block chain-based high-concurrency online purchase queuing method, equipment and a medium, which can receive killing request messages of seconds from user terminals; acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message; acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time; determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain; sending corresponding prompt information to each user terminal according to the arrangement sequence of each user; wherein, the prompt message is used for indicating whether the second killing of the user is successful.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a block chain-based method, device, and medium for queuing purchase on a high-concurrency line.
Background
With the continuous development of technology, the purchase of goods on the internet becomes more and more popular. For the purpose of sales promotion, the network merchant will implement a selling mode of issuing some ultra-low price commodities and all buyers request to buy on the network at the same time, namely what we say is a second-killing mode.
The phenomenon of high concurrency can occur during killing the second, and in order to increase the success rate of killing the second, some users can misuse interface data to kill the second, so that certain unfairness exists.
Disclosure of Invention
The embodiment of the specification provides a block chain-based high-concurrency online purchase queuing method, equipment and a medium, which are used for solving the following technical problems in the prior art: in order to increase the success rate of killing seconds, a user abuses interface data, and unfairness exists in killing seconds.
The embodiment of the specification adopts the following technical scheme:
a blockchain-based high-concurrency online purchase queuing method, the method comprising:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
Optionally, after receiving the killing-by-second request message from each user terminal, the method further includes:
and determining that the time for receiving each second killing request message is within the preset second killing time.
Optionally, the user information includes at least one of: user rating, user credit score.
Optionally, the intelligent contract specifically includes:
determining a value score of the user according to the user information of the killing-per-second user;
and determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user value score of the killing-by-second user and the address information of the user terminal.
Optionally, determining the ranking order of the users according to the time of receiving the killing-by-second request message, the user value score of the killing-by-second user, and the address information of the user terminal, specifically including:
determining the number of user terminals with consistent address information according to the address information of the user terminals;
determining the evaluation score of the killing request message according to the time for receiving the killing request message, the user value score of the killing user and the number of the user terminals with consistent address information;
and determining the arrangement sequence of the users according to the evaluation scores of the killing request messages.
Optionally, the method further comprises: and writing the value scores of the users into the block chain for storage.
Optionally, the address information of the user terminal includes: user terminal location information and/or user terminal IP address.
Optionally, the method further comprises: receiving a redemption request message from a user terminal, wherein the redemption request comprises user information;
determining whether the user successfully kills the second according to the user message;
and sending feedback information to the user terminal under the condition that the user successfully kills the second, wherein the feedback information is used for prompting the user that the commodity is successfully exchanged.
A blockchain based high concurrency online purchase queuing apparatus, comprising:
at least one processor; and the number of the first and second groups,
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:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
A non-transitory computer storage medium for block chain based high concurrency online purchase queuing, storing computer-executable instructions configured to:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
The embodiment of the specification adopts at least one technical scheme which can achieve the following beneficial effects: the method and the device can determine the arrangement sequence of the users according to the user information, the time for receiving the killing request message and the address information of the user terminal, thereby determining whether the second killing of the users succeeds or not, effectively avoiding the problems that the users abuse interface data, have malicious competition and cause unfairness in second killing in order to increase the success rate of second killing, improving the fairness of second killing and enhancing the user experience. Meanwhile, the arrangement sequence of the users is determined based on the intelligent contracts deployed on the block chain, and the fairness of killing seconds is further improved as the intelligent contracts cannot be tampered and have high credibility.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
FIG. 1 is a flow chart of a block chain based method for purchasing queuing on a high concurrent line according to an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of a block chain-based high-concurrency online purchase queuing apparatus according to an embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the present disclosure more apparent, the technical solutions of the present disclosure will be clearly and completely described below with reference to the specific embodiments of the present disclosure and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments obtained by a person skilled in the art without making any inventive step based on the embodiments in the description belong to the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart of a block chain-based method for purchasing queuing on a high-concurrency line according to an embodiment of the present disclosure. As shown in fig. 1, an embodiment of the present specification provides a block chain-based high-concurrency online purchase queuing method, including the following steps:
s101, receiving the second killing request message from each user terminal.
The killing-by-second request message may include information such as commodity information and purchase quantity, which is used to indicate the purchasing behavior of the user.
It should be noted that the above-mentioned killing-by-second request message may be written into the block chain for storage.
S102, determining that the time for receiving each second killing request message is within the preset second killing time.
Since the second killer has a certain time limit, it is necessary to determine whether the time for receiving each second killer request is within a preset second killer time. If the second killing time is within the preset second killing time, determining that the user corresponding to the second killing request has the qualification of participating in second killing; otherwise, the user corresponding to the killing-by-second request has the qualification of participating in killing by the second, the following steps are not executed, and corresponding information can be sent to the user terminal to prompt the user that the commodity is not in the killing-by-second time.
It should be noted that the time of receiving the killing request message may be written into the blockchain for storage.
And S103, acquiring user information of the killing users corresponding to the user terminals.
In some embodiments of the present application, the user information includes at least one of: user rating, user credit score.
It should be noted that the user information of the second killer user may be written into the block chain for storage.
And S104, acquiring the address information of each user terminal sending the killing-by-second request information within the preset killing-by-second time.
In some embodiments of the present application, the address information of the user terminal includes: user terminal location information and/or user terminal IP address.
It should be noted that steps S103 and S104 may be executed simultaneously, or S103 may be executed first and then S104 may be executed, or S104 may be executed first and then S103 may be executed, which is not limited in the embodiment of the present application.
In addition, the address information of the user terminal can be written into the block chain for storage.
And S105, determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second user and the equipment information of the user terminal based on the intelligent contract deployed on the block chain.
It should be noted that, since a plurality of intelligent contracts may be deployed on the blockchain, before step S105 is executed, the corresponding intelligent contract may be determined according to the received kill-second request message.
Further, the intelligent contract specifically includes:
determining the value score of the user according to the user information of the second killing user;
and determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user value score of the killing-by-second user and the address information of the user terminal.
And determining a user value score according to the user grade according to a preset corresponding relation under the condition that the user information only comprises the user grade. For example, it is assumed that the user value score is 60 in the case where the user rank is 3.
Based on the scheme, the user can be evaluated, and the user with poor credit can be effectively avoided.
Similarly, under the condition that the user information only includes the user credit points, the user value scores can be determined according to the user credit points according to the preset corresponding relation. For example, assume that the user value score is 50 points in the range of 80-100 user credit points.
For example, the user rating and the user credit score may be weighted a and B to determine the user value score, for example, the user rating and the user credit score may be weighted a and B, the user rating and the user credit score may be 80 in the case of the user rating being 4, and the user value score may be a × 80+ B × 90 in the range of the user credit score being 200 and the user credit score being 90.
Further, determining the ranking order of the users according to the time of receiving the killing-by-second request message, the user value score of the killing-by-second user, and the address information of the user terminal, specifically comprising:
determining the number of user terminals with consistent address information according to the address information of the user terminals;
determining the evaluation score of the killing request message according to the time for receiving the killing request message, the user value score of the killing user and the number of user terminals with consistent address information;
and determining the arrangement sequence of the users according to the evaluation scores of the killing request messages of each second.
For example, if the time of receiving the second killing request message is C, the corresponding time score is C and the weight is 80%, the user value score of the second killing user is D and the corresponding weight is 10%, the number of the user terminals with consistent address information is E, the corresponding address score is E and the weight is 10%, and then the evaluation score of the second killing request message is C × 80% + D × 10% + E × 10%.
Through the scheme, the number of the user terminals with consistent address information can be evaluated, the situation that a user adopts a plurality of devices to perform robbery at the same time is avoided, and fairness is improved.
In some embodiments of the application, the value scores of the users, the evaluation scores of the killing request messages and the arrangement sequence of the users are written into the block chain for storage, so that the data can be prevented from being tampered, and the authenticity of the data is ensured.
And S106, sending corresponding prompt information to each user terminal according to the arrangement sequence of each user.
The prompt message is used for indicating whether the second killing of the user is successful or not.
In the embodiment of the specification, whether the second killing of the user is successful or not can be determined according to the number of the second killing commodities and the arrangement sequence of the user.
In some embodiments of the present application, the method further comprises:
receiving an exchange request message from a user terminal, wherein the exchange request comprises user information;
determining whether the user successfully kills the second according to the user message;
and sending feedback information to the user terminal under the condition that the user successfully kills the second, wherein the feedback information is used for prompting the user that the commodity is successfully exchanged.
Based on the scheme, whether the user sending the exchange request information kills successfully in seconds can be determined, and the user is prevented from falsely claiming.
Based on the technical scheme, the arrangement sequence of the users can be determined according to the user information, the time for receiving the killing request message and the address information of the user terminal, so that whether the second killing of the users succeeds or not is determined, the problems that the users abuse interface data, have malicious competition and cause unfair second killing in order to increase the success rate of the second killing are effectively solved, the fairness of the second killing is improved, and the user experience is enhanced. Meanwhile, the arrangement sequence of the users is determined based on the intelligent contracts deployed on the block chain, and the fairness of killing seconds is further improved as the intelligent contracts cannot be tampered and have high credibility.
Based on the same idea, some embodiments of the present application further provide a device and a non-volatile computer storage medium corresponding to the above method.
Fig. 2 is a schematic structural diagram of a block chain-based high-concurrency online purchase queuing apparatus according to an embodiment of the present disclosure, as shown in fig. 2, the apparatus includes:
at least one processor; and the number of the first and second groups,
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:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
Some embodiments of the present application provide a non-volatile computer storage medium corresponding to a blockchain-based software production incident archiving of fig. 1, storing computer-executable instructions configured to:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
The embodiments in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device and media embodiments, the description is relatively simple as it is substantially similar to the method embodiments, and reference may be made to some descriptions of the method embodiments for relevant points.
The device and the medium provided by the embodiment of the application correspond to the method one to one, so the device and the medium also have the similar beneficial technical effects as the corresponding method, and the beneficial technical effects of the method are explained in detail above, so the beneficial technical effects of the device and the medium are not repeated herein.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A blockchain-based high-concurrency online purchase queuing method, the method comprising:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
2. The method of claim 1, wherein after receiving the killing-by-seconds request message from each user terminal, the method further comprises:
and determining that the time for receiving each second killing request message is within the preset second killing time.
3. The method of claim 1, wherein the user information comprises at least one of: user rating, user credit score.
4. The method according to claim 2, wherein the intelligent contract is specifically:
determining a value score of the user according to the user information of the killing-per-second user;
and determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user value score of the killing-by-second user and the address information of the user terminal.
5. The method according to claim 4, wherein determining the ranking order of the users according to the time of receiving the killing request message, the user value score of the killing user, and the address information of the user terminal specifically comprises:
determining the number of user terminals with consistent address information according to the address information of the user terminals;
determining the evaluation score of the killing request message according to the time for receiving the killing request message, the user value score of the killing user and the number of the user terminals with consistent address information;
and determining the arrangement sequence of the users according to the evaluation scores of the killing request messages.
6. The method of claim 4, further comprising:
and writing the value scores of the users into the block chain for storage.
7. The method of claim 1, wherein the address information of the user terminal comprises: user terminal location information and/or user terminal IP address.
8. The method of claim 1, further comprising:
receiving a redemption request message from a user terminal, wherein the redemption request comprises user information;
determining whether the user successfully kills the second according to the user message;
and sending feedback information to the user terminal under the condition that the user successfully kills the second, wherein the feedback information is used for prompting the user that the commodity is successfully exchanged.
9. A blockchain-based high concurrency online purchase queuing apparatus, comprising:
at least one processor; and the number of the first and second groups,
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:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
10. A non-transitory computer storage medium storing computer-executable instructions for block chain based high concurrency online purchase queuing, the computer-executable instructions configured to:
receiving a killing-by-second request message from each user terminal;
acquiring user information of a killing-by-second user corresponding to each user terminal, and determining the time for receiving each killing-by-second request message;
acquiring address information of each user terminal sending the killing-by-second request information within preset killing-by-second time;
determining the arrangement sequence of the users according to the time for receiving the killing-by-second request message, the user information of the killing-by-second users and the equipment information of the user terminals on the basis of the intelligent contracts deployed on the block chain;
sending corresponding prompt information to each user terminal according to the arrangement sequence of each user;
wherein, the prompt message is used for indicating whether the second killing of the user is successful.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010070954.5A CN111325596A (en) | 2020-01-21 | 2020-01-21 | Block chain based high-concurrency online purchase queuing method, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010070954.5A CN111325596A (en) | 2020-01-21 | 2020-01-21 | Block chain based high-concurrency online purchase queuing method, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111325596A true CN111325596A (en) | 2020-06-23 |
Family
ID=71173261
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010070954.5A Pending CN111325596A (en) | 2020-01-21 | 2020-01-21 | Block chain based high-concurrency online purchase queuing method, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111325596A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801753A (en) * | 2021-02-09 | 2021-05-14 | 深圳市富途网络科技有限公司 | Page display method, device and medium |
| CN113128731A (en) * | 2021-05-18 | 2021-07-16 | 中国银行股份有限公司 | Commemorative coin reservation pushing and transaction processing system and method based on 5G message |
| CN113313278A (en) * | 2021-06-30 | 2021-08-27 | 中国银行股份有限公司 | Commemorative coin reservation method based on block chain, user terminal and block chain link point |
| CN113783924A (en) * | 2021-04-15 | 2021-12-10 | 北京沃东天骏信息技术有限公司 | Method and device for processing access request |
| CN115086395A (en) * | 2022-04-28 | 2022-09-20 | 国网山东省电力公司泰安供电公司 | Property management system |
-
2020
- 2020-01-21 CN CN202010070954.5A patent/CN111325596A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112801753A (en) * | 2021-02-09 | 2021-05-14 | 深圳市富途网络科技有限公司 | Page display method, device and medium |
| CN112801753B (en) * | 2021-02-09 | 2024-04-23 | 深圳市富途网络科技有限公司 | Page display method, device and medium |
| CN113783924A (en) * | 2021-04-15 | 2021-12-10 | 北京沃东天骏信息技术有限公司 | Method and device for processing access request |
| CN113128731A (en) * | 2021-05-18 | 2021-07-16 | 中国银行股份有限公司 | Commemorative coin reservation pushing and transaction processing system and method based on 5G message |
| CN113313278A (en) * | 2021-06-30 | 2021-08-27 | 中国银行股份有限公司 | Commemorative coin reservation method based on block chain, user terminal and block chain link point |
| CN115086395A (en) * | 2022-04-28 | 2022-09-20 | 国网山东省电力公司泰安供电公司 | Property management system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111325596A (en) | Block chain based high-concurrency online purchase queuing method, equipment and medium | |
| CN110992020A (en) | Data processing method based on intelligent contract, related node and storage medium | |
| CN104574162A (en) | Virtual product trading method and device | |
| CN106161824B (en) | Method and device for determining liveness of communication number | |
| CN109711936A (en) | A kind of Tea Industry platform trading algorithms and device | |
| CN112967119A (en) | Bidding method, device and medium based on block chain | |
| CN111353784A (en) | Transfer processing method, system, device and equipment | |
| CN111104463A (en) | Block chain-based carbon emission management method, equipment and medium | |
| CN111652670A (en) | Game asset transaction method, device and medium based on block chain | |
| CN112330373A (en) | User behavior analysis method and device and computer readable storage medium | |
| CN111861085A (en) | Block chain-based tin craft supplier evaluation method, equipment and medium | |
| CN111062764A (en) | Block chain-based electronic equity transaction method, equipment and medium | |
| CN107169854B (en) | Data processing method and device | |
| CN110990881A (en) | Community group purchase platform, equipment and medium based on block chain | |
| CN110943903B (en) | Information processing method and device | |
| CN110990888A (en) | Block chain-based second-hand transaction platform evaluation method, equipment and medium | |
| CN111127041A (en) | Block chain-based detection sample management method, equipment and medium | |
| CN110503467B (en) | Cross-platform consumer group acquisition method and device | |
| CN104700283B (en) | Data processing method and commodity selling apparatus | |
| CN111612392A (en) | Logistics monitoring method and system based on block chain | |
| CN111159654A (en) | Block chain-based digital album retail method, equipment and medium | |
| CN111047365A (en) | Method, device and medium for managing advertisement bidding information based on block chain | |
| CN113450198A (en) | Financial statement generation method, device and system based on alliance chain | |
| CN110990895A (en) | Block chain-based fast-selling product supply chain excitation method and device and medium | |
| CN110413499A (en) | Information on services monitoring method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200814 Address after: Room 1-2301, Building 7, North District, Shandong Design and Creative Industry Park, No. 868 Tangye West Road, Licheng District, Jinan City, Shandong Province, 250102 Applicant after: SHANDONG INSPUR QUALINK TECHNOLOGY Co.,Ltd. Address before: Room 3110, S01 building, Langchao building, No. 1036, Langchao Road, high tech Zone, Jinan City, Shandong Province 250101 Applicant before: Shandong Aicheng Network Information Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |