CN111667350A - Auction method, device, system, computer equipment and readable storage medium - Google Patents

Auction method, device, system, computer equipment and readable storage medium Download PDF

Info

Publication number
CN111667350A
CN111667350A CN202010491459.1A CN202010491459A CN111667350A CN 111667350 A CN111667350 A CN 111667350A CN 202010491459 A CN202010491459 A CN 202010491459A CN 111667350 A CN111667350 A CN 111667350A
Authority
CN
China
Prior art keywords
auction
transaction
target
product
time point
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.)
Withdrawn
Application number
CN202010491459.1A
Other languages
Chinese (zh)
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.)
Hefei Longtotem Information Tecnology Co ltd
Hefei Dragon Totem Information Technology Co Ltd
Original Assignee
Hefei Longtotem Information Tecnology 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 Hefei Longtotem Information Tecnology Co ltd filed Critical Hefei Longtotem Information Tecnology Co ltd
Priority to CN202010491459.1A priority Critical patent/CN111667350A/en
Publication of CN111667350A publication Critical patent/CN111667350A/en
Withdrawn legal-status Critical Current

Links

Images

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
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/08Auctions
    • 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Technology Law (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention is suitable for the field of computers, and provides an auction method, an auction device, an auction system, auction computer equipment and a readable storage medium, wherein the auction method comprises the following steps: releasing target auction product information, wherein the target auction product information at least comprises auction information; before the auction begins, if a auction request of a target auction product is received, carrying out auction transaction with a corresponding auction party; and determining the auction completion state of the target auction product according to the completion condition of the auction transaction. The auction period is shortened by carrying out auction transaction with the auction party before the auction begins, the auction process is simplified, a large amount of auction services in the auction system can be quickly digested, the auction system resources are prevented from being occupied for a long time in a large amount, and the utilization rate of the system resources of the auction system is greatly improved; meanwhile, the auction method automatically processes data linkage and resource allocation in the auction process, and greatly reduces the time and labor cost consumed by the auction service and management thereof.

Description

Auction method, device, system, computer equipment and readable storage medium
Technical Field
The invention belongs to the field of computers, and particularly relates to an auction method, an auction device, an auction system, auction computer equipment and a readable storage medium.
Background
The traditional auction is a spot transaction mode that an auctioneer specially engaged in auction service accepts the entrustment of a buyer, displays the goods to be auctioned to the buyer according to a certain rule and rule at a specified time and place, publicly calls for bidding for buying, and finally the auctioneer sells the goods to the buyer with the highest bid price.
With the development of internet/communication technology, a large number of auction services are gradually transferred to the online, but the current online auction system has long auction period and complicated auction process, so that the large number of auction services are difficult to be paid in late, even the auction services still do not get paid after multiple auctions, and the auction services occupy a large number of system resources for a long time, resulting in low resource utilization rate of the auction system.
Disclosure of Invention
The embodiment of the invention aims to provide an auction method, aiming at solving the problem of low resource utilization rate of the existing auction system.
The embodiment of the invention is realized by providing an auction method applied to an auction server, wherein the auction method comprises the following steps:
releasing target auction product information, wherein the target auction product information at least comprises auction information;
before the auction begins, if a auction request of a target auction product is received, carrying out auction transaction with a corresponding auction party;
and determining the auction completion state of the target auction product according to the completion condition of the auction transaction.
Another object of an embodiment of the present invention is to provide an auction apparatus for an auction server, the auction apparatus including:
the issuing unit is used for issuing target auction product information, and the target auction product information at least comprises auction information;
the transaction unit is used for carrying out auction transaction with a corresponding auction party if receiving an auction request of a target auction product before the auction begins;
and the auction state determining unit is used for determining the auction completion state of the target auction product according to the finish condition of the auction transaction.
Another object of an embodiment of the present invention is to provide an auction system, including: an auction server, and a first terminal and a second terminal which can communicate with the auction server;
wherein the auction server is configured to perform the steps of the auction method;
the first terminal is used for logging in the auction server to set and confirm the information of the target auction product;
the second terminal is used for logging in the auction server to initiate a auction request aiming at the target auction product and carrying out auction transaction with the server.
It is a further object of embodiments of the present invention to provide a computer device, comprising a memory and a processor, the memory having stored therein a computer program, which, when executed by the processor, causes the processor to perform the steps of the auction method.
It is a further object of an embodiment of the present invention to provide a computer-readable storage medium, on which a computer program is stored, which, when executed by a processor, causes the processor to execute the steps of the auction method.
According to the auction method provided by the embodiment of the invention, the auction period is shortened by carrying out the auction transaction with the auction party before the auction begins, the auction process is simplified, a large amount of auction services in the auction system can be quickly digested, further, the system resources are prevented from being occupied for a long time in a large amount, and the utilization rate of the system resources of the auction system is greatly improved; meanwhile, the auction method automatically processes data linkage and resource allocation in the auction process, and greatly reduces the time and labor cost consumed by the auction service and management thereof.
Drawings
FIG. 1 is a diagram of an application environment of an auction method provided by one embodiment;
FIG. 2 is a flow diagram of a method for auction, according to an embodiment;
FIG. 3 is a flow diagram of one refinement of step S206 of the auction method provided by one embodiment;
FIG. 4 is a flow diagram of one refinement of step S204 of the auction method provided by one embodiment;
FIG. 5 is a block diagram of an auction device according to an embodiment;
FIG. 6 is a block diagram of the architecture of an auction system provided by one embodiment;
FIG. 7 is a block diagram showing an internal configuration of a computer device according to an embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
It will be understood that, as used herein, the terms "first," "second," and the like may be used herein to describe various elements, but these elements are not limited by these terms unless otherwise specified. These terms are only used to distinguish one element from another. For example, a first xx script may be referred to as a second xx script, and similarly, a second xx script may be referred to as a first xx script, without departing from the scope of the present application.
Fig. 1 is a diagram illustrating an application environment of an auction method in an embodiment, as shown in fig. 1, which is applied to an auction system. The auction system includes a terminal 110 and a server 120. The terminal 110 and the server 120 are connected through a network.
The terminal 110 may be a desktop terminal or a mobile terminal, and the mobile terminal may be at least one of a mobile phone, a tablet computer, a notebook computer, and the like. The server 120 may be implemented by an independent server or a server cluster composed of a plurality of servers, or may be a cloud server providing basic cloud computing services such as a cloud server, a cloud database, a cloud storage, and a CDN.
It is understood that the terminal 110 mentioned in the embodiment of the present application may specifically be a terminal corresponding to a user participating in an auction. Wherein, the terminal 110 establishes a communication link with the server 120 through the network, thereby realizing interaction related to the auction service. The terminals 110 may specifically include a first terminal and a second terminal based on the role in the auction; the first terminal may be understood as the terminal initiating the auction and the second terminal may be understood as the terminal participating in the auction and/or the auction. In the auction and auction service for the same auction item, the user entities corresponding to the first terminal and the second terminal should be different, that is, one user cannot be both an auction initiator of a specific auction item and an auction/auctioneer of the specific auction item.
It can be understood that different users participate in the auction through different terminals 110, and a user as an auction initiator may upload target auction product information to the server 120 through the first terminal, or set the target auction product information prestored in the server 120, or import the target auction product information from other servers to the server 120, and finally issue the target auction product information through the server 120, where the target auction product information at least should include auction information to explain relevant rules and relevant service parameters of the auction link; a period of time before the start of the auction is set as a auction link, and other users can participate in the auction service through the second terminal according to the target auction information issued by the server 120 in the period of time; and if the server 120 receives the auction request, the server 120 performs the auction transaction with the corresponding auction party, determines the auction completion state of the target auction product according to the completion condition of the auction transaction, declares the auction service of the target auction product to be completed once the auction transaction is successful, and the subsequent auction links will not continue any more, and the server 120 issues the message, so that the user can know the current auction and auction dynamics through the terminal 110.
As shown in fig. 2, in one embodiment, an auction method is provided, and this embodiment is mainly illustrated by applying this method to the server 120 in fig. 1. Referring to fig. 2, the auction method specifically includes the following steps:
step S202, target auction product information is issued, and the target auction product information at least comprises auction information.
The target auction product can be any auction product currently entering an auction link, and the target auction product information comprises the following information of the corresponding auction product: auction item names, commodity categories, commodity basic information, auction information and the like. The target auction item information is directly or indirectly set by the user, the user serving as the auction initiator can upload the target auction item information to the server through the terminal, or set the target auction item information prestored in the server, or import the target auction item information from other servers to the server, and the method is not limited in particular.
In one case, after the target auction item information is set, the server may generate an auction announcement presentation page (similar to an electronic contract) in association with the set template.
For the categories of goods, in some cases, it may be further classified into major categories, minor categories, for example, the major category corresponds to "intellectual property", the minor category corresponds to "trademark", "patent", "copyright", and the like; if the types of the commodities are complicated, the commodities can be further subdivided into large groups and small groups, for example, the large groups correspond to 'communication field patents', and the small groups correspond to '5G technical patents'; the classification level can be increased or decreased according to actual needs, and is not particularly limited.
For basic information of the commodity, in some cases, it is used to describe the basic situation of the item to be auctioned; taking patents as examples of auction products, the basic information of the products can include: patent type (e.g., patent invention, utility patent, or design patent), patent number, patent name, legal status (e.g., examination history, litigation history, right assignment status, assignment history, etc.), etc.; taking a trademark as an example of an auction product, the commodity information may include: brand type, trademark number, brand name, legal status, etc. For the entity auction product, the basic commodity information can also comprise information such as a picture and technical specification description of the product. It can be understood that the basic information of the commodity can be set according to actual needs as long as the basic information conforms to the laws and regulations, social welfare and the real meaning expression of the party.
For auction information, in some cases, it may include: deposit, attack price, added price amplitude value, reserve price, attack time, end time and other information.
The deposit, in some cases, this parameter may not be zero; as optimization, in the auction system corresponding to the auction method of the embodiment, users participating in auction must pay the deposit through a designated payment channel, and the system establishes a corresponding deposit bill for the users; the user can apply for refunding the deposit, and the deposit is directly refunded in the original way; in this embodiment, the deposit is the basis for the user to participate in the auction, and only if the deposit is paid can the user participate in the auction.
The starting price, in some cases, is the price of the first displayed target auction item.
The value of the bid amplitude, in some cases the lowest value of the increase in the bid per time, is used to normalize the bidding behavior, preventing the user from robbing goods at an extremely low value of the bid.
The reserve price, in some cases, may be empty, or unlimited, or may be empty or the auction price may be higher than this price to make a deal, preventing the auction initiator from bidding too low for attracting the auction user, resulting in a very low maximum price.
The attack time, in some cases the auction start time, is also referred to as the preset attack time point.
The end time, in some cases, is expired if no one bids or the bids are not higher than the reserve price, the auction is regarded as a flow, the flow state is changed into a flow, the auction initiator decides whether to modify the information to reissue, and the flow times are recorded.
In one embodiment, a user participates in an auction service through a terminal, wherein the terminal participating in the auction service of a target auction product at least comprises a first terminal and a second terminal, the first terminal logs in a server through an application/program associated with an auction system by using a first user identifier, and the setting and issuing operation of information of the target auction product is carried out; the second terminal logs on to the server with a second user identification through an application/program associated with the auction system and participates in the auction and the auction operation. The first terminal and the second terminal can communicate and interact with the server through the application/program.
In some cases, the application/program associated with the auction system may be: WEB, WEB applications/programs; or a desktop application/program or a program/application on a third party platform (e.g., a WeChat applet, a third party application on a Payment treasure, etc.), particularly without limitation.
In one embodiment, the target auction item information is displayed after the target auction item information is released. If the user directly enters the auction link, the user can participate in the auction at any time before the end of the auction, and the deposit requirement is only required to be met before the user participates in the auction; when the starting time is up, the user can see the current highest price through the terminal auction bid, the bid is not lower than the current highest price, and the difference price is integral multiple of the added price amplitude value. When the termination time is up, the auction is ended, the system judges whether the price is higher than the reserve price, if so, the auction is successful; as optimization, at the end of the auction process, the system must confirm that none of the highest bidders have the same price; if the solution can not be solved, press the first beat. After the auction succeeds, the user and the system pay through an appointed channel, after the payment, the delivery procedure is handled, and the manager or the system automatically changes the status of the auction products into the transaction completion.
In this embodiment, the target auction item information further includes auction information, where the auction information may include parameters such as time and price for implementing auction, and the user may participate in auction transaction according to the auction information.
In one embodiment, the auction information at least comprises an auction price and an auction time limit, wherein the auction price describes the price of the target auction product in the auction link, and the auction time limit describes the requirement of the auction transaction execution time; the auction system (mainly a server) corresponding to the auction method in the embodiment can ensure the accurate and orderly connection of the auction link and the auction link through the reasonable management of the auction price and the payment time limit, and avoid the whole auction system from falling into a disordered and disordered state. In some cases, the price for the auction can be null, and if the price for the auction is null, the system can not execute the link for the auction but directly enter the link for the auction; if the auction price is not empty, the system triggers the auction link before the auction link begins. In some cases, the system is provided with a qualified participant verification module so as to perform qualification verification on the user participating in the candid photograph, for example, the candid photograph participating link needs to meet the requirement of deposit, and the user is only allowed to be admitted to participate the candid photograph after the system judges that the user meets the requirement of deposit. In addition, in the process of the robbery shooting, the system needs to control the payment time limit, the robber needs to complete the payment within the required payment time limit, otherwise, the robber defaults to goods; further, if the goods are in default, the system can collect the deposit as default according to the agreement. If the robber pays the tail money within the payment time limit, the robber successfully beats.
And step S204, before the auction starts, if a auction request of the target auction product is received, carrying out auction transaction with the corresponding auction party.
In this example, if the user connects to the server through the terminal and sets the auction price in the target auction item information, the server needs to pre-position the auction link in the current round of auction service for the target auction item, that is, whether the auction link needs to be executed is determined according to the execution result of the auction link.
The time status, so-called "before the start of the auction", is monitored in real time by the server.
In some cases, "before the start of the auction" means "before the preset activation time point", that is, the auction transaction can be performed only before the preset activation time point, and, preferably, the auction link is set to be spaced from the auction link by a designated time (e.g., several hours or several days) to ensure the normal order of the auction link; specifically, the method can be implemented by reasonably setting the starting time and the ending time of the quick shooting, for example, the starting time point of the quick shooting is set to be earlier than the preset starting time point, and the payment operation needs to be completed before the starting time point of the quick shooting.
In other cases, "before the start of an auction" means "before the time point of initiation of the first auction bid," wherein the time point of initiation of the first auction bid means the time point after the entry into the auction link and the first auction bid by the terminal, in which case there is a partial overlap of the auction link and the auction link, but in which case the auction transaction of the auctioneer is not protected, and the auction transaction of the auctioneer is declared to have failed as long as the auction bid is placed by the auctioneer. However, in any case, the auction request for the target auction item can only be initiated before the preset auction time corresponding to the target auction item, and received by the server, and the server will close the receiving channel of the auction request after the preset auction time.
In one embodiment, the corresponding party to be auctioned is an end user, which logs in to the server through an application/program associated with the auction system and participates in the operations of auction and auction; the auction request of the target auction product at least comprises a user identifier and a target auction product identifier corresponding to the auctioning party. And after receiving the auction request aiming at the target auction product, the server establishes a transaction channel with the corresponding auction party to carry out auction transaction.
And step S206, determining the auction completion state of the target auction product according to the completion condition of the auction transaction.
Wherein the execution result of the preemptive auction transaction comprises successful preemptive auction transaction and unsuccessful preemptive auction transaction; wherein, the unsuccessful transaction of the pre-shoot further comprises the failure of the pre-shoot transaction, the cancellation of the pre-shoot transaction and the like; the cancellation of the auction transaction can be actively cancelled by the user or initiated by the system, for example, the system performs forced cancellation when the preset starting time point or the initiation time point of the first auction bid is reached.
In one embodiment, as shown in fig. 3, for step S206, the method specifically includes the following steps:
step S302, if the auction transaction is successful before the auction begins, determining that the auction state of the target auction product is auction completion;
step S304, if the auction transaction is not successful before the auction begins, determining that the auction state of the target auction product is not temporarily finished.
If the process goes to step S302, that is, the auction is completed, the server issues an auction completion message, and the auction link of the target auction product will not be executed.
If the process goes to step S304, namely the auction is temporarily not finished, the server issues a message that the auction is unsuccessful, or at least sends the message that the auction is unsuccessful to the user terminal participating in the auction link; the server then further adjusts the system data to enter the auction process.
In one embodiment, the traditional online auction system has the problems of long auction period and complex auction process, and further has the problems of long-term occupation of auction system resources and consumption of a large amount of time and labor cost of auction managers; the auction method comprises the following steps that a auction link is positioned before the auction link, users participating in auction can directly preempt a target auction product in a first-time mode in the auction link, and if the target auction product is successfully preempted before the auction begins, the target auction product cannot enter the auction link and the auction ends; if the auction is not successfully performed when the auction begins, entering a normal auction link. On the one hand, the setting of the auction control component/the auction link can overcome the defects in the traditional auction system, if the auction is successful, the auction is simplified on the flow, the auction period can be greatly shortened, and the auction link involve complex data resource management and time rule adjustment and calculation. On the other hand, for an auction initiator who does not want the target auction product to be pulled high in price in the auction link or is anxious to trade the target auction product (as long as the target auction product reaches the psychological price), the auction method corresponding to the auction system provided by the embodiment undoubtedly provides a fast and efficient trading mode, and user experience is greatly improved.
In one embodiment, the auction information at least includes an auction price and a payment time limit, wherein the auction price describes a price of the target auction product in the auction link, and the auction time limit describes a requirement of the auction transaction execution time. On this basis, with reference to fig. 4, in step S204, the step of "performing a auction transaction with the corresponding auction party if a auction request of the target auction item is received" further includes the following steps:
step S402, receiving a auction request of the target auction product;
step S404, a transaction channel is established with the corresponding party for preemptive shooting, and payment operation is executed with the corresponding party for preemptive shooting based on the price for preemptive shooting;
step S406, if the payment operation is completed within the payment time limit, the transaction of the emergency photography is completed; if the payment operation is not completed within the payment time limit, the transaction fails to be taken.
Step S404 describes a process of preemptive transaction, where the transaction channel refers to a temporary and virtual communication channel for transaction that is established between the server and the corresponding preemptive party (when payment is made by a third party, the third party payment system may also be included). And if the corresponding party performs payment confirmation or correctly inputs a payment password and the like at the terminal of the party in the process of the preemptive shooting within the payment time limit, the preemptive shooting transaction is finished, otherwise, the preemptive shooting transaction fails.
In some cases, the payment time limit is set to a first payment time limit, a second payment time limit, or a third payment time limit; the first payment time limit, the second payment time limit and the third payment time limit respectively correspond to three different payment modes, and actually correspond to three different capture modes; in some cases, the payment time limit is a server preset parameter, which cannot be set by a user; in other cases, the payment time limit is a settable parameter on the server, and the user can log in the server for selection and setting before issuing the target auction item information through the terminal.
Specifically, in some cases, the starting time point of the first payment time limit, the second payment time limit, or the third payment time limit is set as the time point of establishing a transaction channel with the corresponding capture party; in some cases, the starting point in time of the first payment time limit, the second payment time limit, or the third payment time limit is set to a point in time after the point in time of establishing a transaction channel with the corresponding counterparty, but before a preset point in time of initiation.
Wherein, the first payment time limit is a payment time limit with a set time length, namely a fixed time length payment time limit from a starting time point. In some cases, if the current payment time limit adopts the first payment time limit, if it is determined that the ending time point of the current payment time limit will exceed the preset start time point, the actual auction starting time point is adjusted to be after the ending time point of the current payment time limit, i.e., if the server calculates/judges that the current payment time limit will exceed the preset start time, the actual auction starting time is postponed. In some cases, if the current payment time limit adopts a first payment time limit, if it is determined that the termination time point of the first payment time limit will exceed the preset start time point, the preset start time point is taken as the termination time point of the current payment time limit, that is, if the server calculates/judges that the current payment time limit will exceed the preset start time point, the termination point of the current payment time limit is automatically adjusted, and a user in the process of the snapshot is prompted, and the user in the process of the snapshot needs to complete payment before the preset start time point.
The ending time point of the second payment time limit is a preset starting time point, or is a set time point before the preset starting time point; i.e. the second payment period is a fixed expiry time payment period.
Wherein, the termination time point of the third payment time limit is the initiation time point of the first auction bid; wherein, the starting time point of the first auction bid means: entering an auction link, and enabling the first auction user to bid through a terminal, wherein the time of the auction link is partially overlapped with that of the auction link, but in the situation, the auction transaction of the auction user is not protected, and the auction transaction of the auction user is declared to fail as long as the auction user bids. However, in any case, the auction request for the target auction item can only be initiated before the preset auction time corresponding to the target auction item, and received by the server, and the server will close the receiving channel of the auction request after the preset auction time.
In some embodiments, in step S204, the step of "performing a auction transaction with a corresponding auction party if a auction request of the target auction item is received" further includes the following steps:
step S502, if a plurality of auction requests aiming at the target auction items are received, the auction requests and the corresponding auction parties execute auction transactions in sequence according to the sequence of the initiation time or the receiving time of the auction requests until the successful auction transactions occur before the start of the auction or the current time reaches a preset auction starting time point.
It should be noted that the auction request for the target auction product can only be initiated before the preset auction time corresponding to the target auction product, and is received by the server, and the server closes the receiving channel of the auction request when the preset auction time is exceeded.
In some cases, in the auction link, the server may receive a plurality of auction requests for the target auction product, and for this, the server may execute auction transactions with the auction parties corresponding to the respective auction requests in sequence according to the time sequence of initiation of the auction requests, in this case, the auction requests for the target auction product at least should further include a time identifier (for example, timestamp information) when the user initiates the auction requests through the terminal, and an actual time corresponding to the time identifier should correspond to a standard time of a country or a region or a world time service center.
In some cases, in the process of the snapshot, the server may receive a plurality of snapshot requests for the target item, and for this, the server may execute the snapshot transaction with the snapshot parties corresponding to the respective snapshot requests in sequence according to the receiving time sequence of the snapshot requests, where the receiving time of the snapshot request, that is, the time when the snapshot request is received by the server, may be automatically monitored by the server.
In this embodiment, "before starting the auction" refers to "before the preset starting time point," that is, the auction transaction can only be executed before the preset starting time point, and may also refer to "before the starting time point of the first auction bid," which is not limited specifically. The server performs the transaction with the requesting party corresponding to the first auction request one by one according to the time sequence until the first successful auction transaction occurs, and then stops the transaction with the requesting party corresponding to the other auction requests.
In one embodiment, the auction method further comprises the steps of:
step S602, in the process of receiving the auction request for the target auction product and conducting the auction transaction with the corresponding auction party, closing the receiving channel of the auction request for the target auction product until the current auction transaction is finished.
Specifically, the server can only perform the auction transaction with one auction party once for the target auction product, and in the process of performing the auction transaction with one auction party, the server can close the receiving channel of the auction request of the target auction product, and at this time, other auction requests for the target auction product cannot be received by the server until the current auction transaction is finished; certainly, after the current auction transaction is finished, the server further needs to confirm whether the auction transaction is successful, if the transaction is successful, the auction is finished, the server does not receive other auction requests any more, if the transaction is not successful, and the server confirms that the current time does not reach the preset auction starting time point, the server releases the receiving channel of the auction requests, continues to respond to the next auction request for the target auction product according to the time sequence to carry out the auction transaction with the next auction request; before the auction begins, the server repeats the above process until a successful auction transaction occurs or the current time reaches a preset auction time point.
According to the embodiment, the data processing amount of the server in the process of the snapshot transaction can be reduced, and the situation that other snapshot requests occupy too much system cache region resources can be avoided.
In one embodiment, the auction method further comprises the steps of:
step S702, discarding other auction requests aiming at the target auction product until the current auction transaction is finished in the process of receiving the auction request aiming at the target auction product and carrying out auction transaction with the corresponding auction party.
Specifically, the server can only perform the auction transaction with one auction party once for the target auction product, and in the process of performing the auction transaction with one auction party, the server discards other auction requests for the target auction product after receiving the other auction requests until the current auction transaction is finished; certainly, after the current auction transaction is finished, the server further needs to confirm whether the auction transaction is successful, if the transaction is successful, the auction is finished, the server does not receive other auction requests any more, if the transaction is not successful, and the server confirms that the current time does not reach the preset auction starting time point, the server continues to respond to the next auction request for the target auction product according to the time sequence to carry out auction transaction with the target auction product; before the auction begins, the server repeats the above process until a successful auction transaction occurs or the current time reaches a preset auction time point.
According to the embodiment, the data processing amount of the server in the process of the snapshot transaction can be reduced, and the situation that other snapshot requests occupy too much system cache region resources can be avoided.
In some cases of this embodiment, in the execution process of step S702, the preemptive party corresponding to the other preemptive request sends the preemptive transaction queuing information; after other snapshot requests are abandoned, the server sends out snapshot transaction queuing information to the corresponding snapshot party, and the information is used for informing the user that the current executed snapshot request exists so as to enable the user to reasonably formulate a snapshot strategy according to actual conditions; further, if the current snapshot transaction is completed and the transaction is not successful, the server may further issue or initiate notification information to the requester who initiated the snapshot request, so as to inform that the snapshot can be performed again.
In one embodiment, the auction method further comprises the steps of:
step S802, receiving and caching other auction requests aiming at the target auction product in the process of receiving the auction request aiming at the target auction product and carrying out auction transaction with the corresponding auction party.
Specifically, the server can only perform the auction transaction with one auction party once for the target auction product, and the server caches other auction requests for the target auction product after receiving the other auction requests in the process of performing the auction transaction with one auction party; after the current auction transaction is finished, the server further confirms whether the auction transaction is successful or not, if the transaction is successful, the auction is finished, the server does not receive other auction requests any more, and releases the cached auction requests; if the transaction is not successful, and the server confirms that the current time does not reach the preset starting time point, the server continues to respond to the next auction request for the target auction product according to the time sequence (if the cache region has cached auction requests, the cache region reads the requests one by one according to the time sequence, and if the cache region does not have cached auction requests, the server waits for receiving subsequent other auction requests) and carries out auction transaction with the other auction requests; before the auction begins, the server repeats the above process until a successful auction transaction occurs or the current time reaches a preset auction time point.
In some cases of this embodiment, in the execution process of step S802, a preemptive transaction queuing information is sent to the preemptive party corresponding to the other preemptive request; after other snapshot requests are cached, the server sends snapshot transaction queuing information to the corresponding snapshot party, and the information is used for informing the user that the current executed snapshot request exists so as to enable the user to reasonably formulate a snapshot strategy according to actual conditions; the mode fully ensures the trading principle of first-time-first-time.
In an embodiment, in step S204, the specific link of "performing the snapshot transaction with the corresponding snapshot party" may further be: and if the auction request of the target auction item is determined to meet the set requirement, directly determining that the auction transaction with the corresponding auction party is successfully executed.
Specifically, in this embodiment, the auction party and the server may perform the payment operation in other time periods, and during the auction process, the auction party only needs to initiate the auction request, and the server confirms the auction request, as long as the auction request meets the set requirement, for example, if the deposit or security deposit in the account of the auction request reaches the set amount, the auction transaction is directly confirmed to be successful; or, the server can directly confirm that the snapshot transaction is successful as long as the server confirms that the snapshot request meets the time requirement (for example, the first snapshot request is initiated in the snapshot link).
In one embodiment, the auction method further comprises:
the method comprises the steps that pre-shot transaction information is issued in a preset block chain network;
specifically, the auction transaction information includes target auction item information and related transaction data corresponding to the successful auction transaction; the snapshot transaction information is stored by means of the block chain, so that the security of the snapshot transaction data is greatly improved.
According to the auction method provided by the embodiment, the auction period is shortened by carrying out the auction transaction with the auction party before the auction begins, the auction process is simplified, a large amount of auction services in the auction system can be quickly digested, system resources are prevented from being occupied for a long time in a large amount, and the utilization rate of the system resources of the auction system is greatly improved; meanwhile, the auction method automatically processes data linkage and resource allocation in the auction process, and greatly reduces the time and labor cost consumed by auction service management.
As shown in fig. 5, in an embodiment, an auction device is provided, which may be integrated in the server 120, and specifically may include an issuing unit 220, a trading unit 240, and an auction status determining unit 260.
The issuing unit 220 is configured to issue target auction item information, where the target auction item information at least includes auction information;
a trading unit 240, configured to perform a auction transaction with a corresponding auction party if a auction request of a target auction item is received before an auction starts;
and the auction state determining unit 260 is used for determining the auction completion state of the target auction product according to the completion condition of the auction transaction.
The auction device provided by the embodiment shortens the auction period by carrying out the auction transaction with the auction party before the auction begins, simplifies the auction process, can quickly digest a large amount of auction services in the auction system, further avoids the system resources from being occupied for a long time and in a large amount, and greatly improves the utilization rate of the system resources of the auction system; meanwhile, the auction method automatically processes data linkage and resource allocation in the auction process, and greatly reduces the time and labor cost consumed by auction service management.
As shown in FIG. 6, in one embodiment, an auction system is provided, comprising: an auction server 120, and a first terminal 112, a second terminal 114 that can communicate with the auction server;
wherein the auction server is configured to perform the steps of the auction method of any one of the above embodiments;
the first terminal 112 is used for logging in the auction server 120 to set and confirm the information of the target auction product;
the second terminal 114 is configured to log in the auction server 120, so as to initiate a auction request for a target auction product, and perform a auction transaction with the server 120.
The number of the second terminals 114 is one or more than two, and corresponds to the user terminals actually participating in the snapshot transaction.
According to the auction system provided by the embodiment, the auction period is shortened by carrying out the auction transaction with the auction party before the auction begins, the auction process is simplified, a large amount of auction services in the auction system can be quickly digested, system resources are prevented from being occupied for a long time in a large amount, and the utilization rate of the system resources of the auction system is greatly improved; meanwhile, the auction method automatically processes data linkage and resource allocation in the auction process, and greatly reduces the time and labor cost consumed by auction service management.
FIG. 7 is a diagram illustrating an internal structure of a computer device in one embodiment. The computer device may specifically be the server 120 in fig. 1. As shown in fig. 7, the computer apparatus includes a processor, a memory, a network interface, an input device, and a display screen (the display screen may be absent) connected via a system bus. Wherein the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program that, when executed by the processor, causes the processor to implement the auction method. The internal memory may also have stored therein a computer program that, when executed by the processor, causes the processor to perform an auction method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 7 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, the auction equipment provided herein may be embodied in the form of a computer program that is executable on a computer device such as that shown in FIG. 7. The memory of the computer device may store various program modules constituting the auction apparatus, such as the distribution unit 220, the trading unit 240, and the auction status determination unit 260 shown in fig. 5. The respective program elements, modules constitute computer programs that cause the processor to execute the steps in the auction method of the respective embodiments of the present application described in the present specification.
For example, the computer device shown in fig. 7 may perform step S202 through the distribution unit 220 in the auction apparatus shown in fig. 5. The computer device may perform step S204 through the transaction unit 240. The computer device may perform step S206 through the auction status determination unit 260.
In one embodiment, a computer device is proposed, the computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program:
releasing target auction product information, wherein the target auction product information at least comprises auction information;
before the auction begins, if a auction request of a target auction product is received, carrying out auction transaction with a corresponding auction party;
and determining the auction completion state of the target auction product according to the completion condition of the auction transaction.
In one embodiment, a computer readable storage medium is provided, having a computer program stored thereon, which, when executed by a processor, causes the processor to perform the steps of:
releasing target auction product information, wherein the target auction product information at least comprises auction information;
before the auction begins, if a auction request of a target auction product is received, carrying out auction transaction with a corresponding auction party;
determining the auction completion state of the target auction product according to the completion condition of the auction transaction
It should be understood that, although the steps in the flowcharts of the embodiments of the present invention are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in various embodiments may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
The technical features of the embodiments described above may be arbitrarily combined, and for the sake of brevity, all possible combinations of the technical features in the embodiments described above are not described, but should be considered as being within the scope of the present specification as long as there is no contradiction between the combinations of the technical features.
The above-mentioned embodiments only express several embodiments of the present invention, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present invention. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the inventive concept, which falls within the scope of the present invention. Therefore, the protection scope of the present patent shall be subject to the appended claims.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.

Claims (15)

1. An auction method, comprising:
releasing target auction product information, wherein the target auction product information at least comprises auction information;
before the auction begins, if a auction request of a target auction product is received, carrying out auction transaction with a corresponding auction party;
and determining the auction completion state of the target auction product according to the completion condition of the auction transaction.
2. The auction method according to claim 1, wherein the auction information at least comprises the auction price and the payment time limit.
3. The auction method according to claim 2, wherein the process of conducting a auction transaction with a corresponding auction party upon receiving a auction request for the target auction item comprises:
receiving a auction request of the target auction product;
establishing a transaction channel with the corresponding party to be robbed and executing payment operation with the corresponding party to be robbed based on the price to be robbed;
if the payment operation is completed within the payment time limit, the emergency-shooting transaction is completed; if the payment operation is not completed within the payment time limit, the transaction fails to be taken.
4. The auction method according to claim 1 or 3, wherein if a request for a quick auction of the target auction item is received, a quick auction transaction is performed with a corresponding quick auction party, further comprising:
and if a plurality of auction requests aiming at the target auction products are received, sequentially executing auction transactions with corresponding auction parties according to the sequence of the initiation time or the receiving time of the auction requests until successful auction transactions occur before the start of the auction or the current time reaches a preset auction starting time point.
5. The auction method according to claim 4, further comprising:
in the process of receiving the auction request aiming at the target auction product and carrying out auction transaction with the corresponding auction party:
closing a receiving channel of the auction request aiming at the target auction product until the current auction transaction is finished; or
Discarding other auction requests aiming at the target auction product until the current auction transaction is finished; or
And receiving and caching other auction requests aiming at the target auction product.
6. The auction method according to claim 5, wherein said discarding other auction requests for said target auction item; or receiving and caching other auction requests aiming at the target auction product, wherein the execution process of the two steps further comprises the following steps:
and sending the preemptive shoot transaction queuing information to the preemptive shooting parties corresponding to the other preemptive shoot requests.
7. The auction method according to claim 2 or 3, wherein the payment time limit is set to a first payment time limit, a second payment time limit, or a third payment time limit;
the starting time point of the first payment time limit, the second payment time limit or the third payment time limit is set as the time point of establishing a transaction channel with the corresponding capture party, or is set as a time point after the time point of establishing the transaction channel with the corresponding capture party but before the preset capture starting time point;
the first payment time limit is a payment time limit with a set duration;
the termination time point of the second payment time limit is a preset starting time point, or is a set time point before the preset starting time point;
the ending time point of the third payment time limit is the initiating time point of the first auction bid.
8. The auction method according to claim 7, wherein if the current payment time limit adopts a first payment time limit, if it is determined that the termination time point of the current payment time limit will exceed a preset attack time point, then:
adjusting the actual auction starting time point to be behind the termination time point of the current payment time limit; or
And taking the preset starting time point as the termination time point of the current payment time limit.
9. The auction method according to claim 1, wherein said determining an auction completion status of a target auction item according to a completion of said auction transaction comprises:
if the auction transaction is successful before the auction begins, determining that the auction state of the target auction product is auction completion;
and if the auction transaction is not successful before the auction begins, determining that the auction state of the target auction product is not temporarily finished, and entering an auction mode.
10. The auction method according to claim 1, wherein the auction method for the corresponding auction party comprises:
and if the auction request of the target auction item is determined to meet the set requirement, directly determining that the auction transaction with the corresponding auction party is successfully executed.
11. The auction method according to claim 1, further comprising:
and issuing the preemptive shot transaction information in a preset block chain network.
12. An auction device, characterized in that the auction device comprises:
the issuing unit is used for issuing target auction product information, and the target auction product information at least comprises auction information;
the transaction unit is used for carrying out auction transaction with a corresponding auction party if receiving an auction request of a target auction product before the auction begins;
and the auction state determining unit is used for determining the auction completion state of the target auction product according to the finish condition of the auction transaction.
13. An auction system, comprising: an auction server, and a first terminal and a second terminal which can communicate with the auction server;
wherein the auction server is configured to perform the steps of the auction method according to any one of claims 1 to 11;
the first terminal is used for logging in the auction server to set and confirm the information of the target auction product;
the second terminal is used for logging in the auction server to initiate a auction request aiming at the target auction product and carrying out auction transaction with the server.
14. A computer arrangement, characterized by a memory and a processor, in which a computer program is stored which, when being executed by the processor, causes the processor to carry out the steps of the auction method according to any one of claims 1 to 11.
15. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, causes the processor to carry out the steps of the auction method according to any of claims 1 to 11.
CN202010491459.1A 2020-06-02 2020-06-02 Auction method, device, system, computer equipment and readable storage medium Withdrawn CN111667350A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010491459.1A CN111667350A (en) 2020-06-02 2020-06-02 Auction method, device, system, computer equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010491459.1A CN111667350A (en) 2020-06-02 2020-06-02 Auction method, device, system, computer equipment and readable storage medium

Publications (1)

Publication Number Publication Date
CN111667350A true CN111667350A (en) 2020-09-15

Family

ID=72383663

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010491459.1A Withdrawn CN111667350A (en) 2020-06-02 2020-06-02 Auction method, device, system, computer equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN111667350A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113095913A (en) * 2021-04-29 2021-07-09 支付宝(杭州)信息技术有限公司 Block chain-based shopping method
CN113159900A (en) * 2021-04-29 2021-07-23 支付宝(杭州)信息技术有限公司 Block chain-based shopping method
WO2022257740A1 (en) * 2021-06-07 2022-12-15 支付宝(杭州)信息技术有限公司 Blockchain-based transaction method

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113095913A (en) * 2021-04-29 2021-07-09 支付宝(杭州)信息技术有限公司 Block chain-based shopping method
CN113159900A (en) * 2021-04-29 2021-07-23 支付宝(杭州)信息技术有限公司 Block chain-based shopping method
WO2022257740A1 (en) * 2021-06-07 2022-12-15 支付宝(杭州)信息技术有限公司 Blockchain-based transaction method
US11615078B2 (en) 2021-06-07 2023-03-28 Alipay (Hangzhou) Information Technology Co., Ltd. Blockchain-based transaction methods

Similar Documents

Publication Publication Date Title
CN111667350A (en) Auction method, device, system, computer equipment and readable storage medium
CN110428257B (en) Password cracking task processing method, equipment and storage medium
CN110557403B (en) Resource allocation method and device based on block chain, storage medium and node equipment
US20150186890A1 (en) Method, Device And System For Data Processing
CN111612453A (en) Decentralized transaction method and device based on block chain and electronic equipment
CN110597916A (en) Data processing method and device based on block chain, storage medium and terminal
CN110956500B (en) Method and system for reducing advertisement request time consumption in advertisement real-time bidding system
CN111523817A (en) Order business processing method, device, equipment and medium based on big data
CN115641180A (en) Request processing method, related device and equipment
CN113435943A (en) Rights and interests processing method and device based on block chain
CN111681053A (en) Receiving and paying chain construction method and device, computer equipment and readable storage medium
CN110610322A (en) Clue data processing method, device and equipment based on block chain and storage medium
CN110262892A (en) A kind of ticketing service dissemination method based on distributed storage data-link, device and data-link node
CN113935749A (en) Fair credible commodity reputation evaluation method based on Ether house intelligent contract
CN111861685A (en) Payroll distribution method, device, computer equipment and readable storage medium
CN111311102A (en) Resource ratio adjusting method, device, equipment and computer readable storage medium
CN115222390A (en) Security check method, device, equipment and storage medium
CN112884460A (en) Method and device for generating transfer transaction message under automatic repayment scene
CN111709728A (en) Virtual resource splitting deduction replacing method and device, computer equipment and storage medium
CN111061573A (en) Resource transfer method, device, electronic equipment and storage medium
CN111061558A (en) Method, device, computer equipment and storage medium for processing virtual resource data
CN111583002A (en) Data processing method, data processing device, electronic equipment and storage medium
CN110930607A (en) Transaction result judgment method and device, computer equipment and storage medium
US20210042295A1 (en) Blockchain-based data management method and related system
CN113469788B (en) Multi-channel data processing method, device, computer equipment and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WW01 Invention patent application withdrawn after publication

Application publication date: 20200915

WW01 Invention patent application withdrawn after publication