当前位置: 首页 > 图文教程 > 网络编程 > ASP > 制作我们自己的Ebay(拍卖系统)(2)

ASP
嵌入式Web视频点播系统实现方法
GB与BIG5内码转换COM原代码
金额阿拉伯数字转换为中文的存储过程
利用 WSH 作定时工作流程
用InstallShield 进行 ASP 软件的打包和自动安装
服务器获得客户端时间的方法
关于如何读出图片的高度与长度的总结
按下回车键指向下一个位置的一个函数
一个不错的随机函数
一套加解密字符串的函数
一段加密函数(base64)
一段加密函数
使用asp实现支持附件的邮件系统(三)
使用asp实现支持附件的邮件系统(二)
使用asp实现支持附件的邮件系统(一)
检查当前目录下是否存在指定的文件,如果存在就重新命名
MD5加密的javascript实现例子
如何在服务器端调用winzip命令行对上传的多个文件打包压缩
MD5不可逆加密算法的ASP实现实例
看人家用使用InstallShield制作ASP安装程序(6)

ASP 中的 制作我们自己的Ebay(拍卖系统)(2)


出处:互联网   整理: 软晨网(RuanChen.com)   发布: 2009-11-03   浏览: 183 ::
收藏到网摘: n/a

  Chris Payne

September 11, 2000

Before we go jumping into code and databases, let's take a moment and examine the needs and strategies, as
well as the different types of auctions.

First of all, there are many different types of auctions (which we'll discuss in the next section), so
you'll have to decide what your needs are, and adjust accordingly. I'll outline the needs for our auction
here, and we'll reference these as we progress. First, let's get some definitions out of the way:


Buyer/Bidder - The person who places a bid, and wants to buy an item.
Item/Lot - One listing in the auction (can be several actual items, but will be represented by one
listing).
Proxy bidding - A buyer places a maximum bid to never be exceeded. The actual bid then is simply the last
highest winning bid plus the minimum increment. The actual bid will be increased automatically when outbid
until the max is reached.
Seller - The person who listed the item to be sold.
Winning bid - The price a buyer pays to win an item.
And now our assumptions:

"Second Price auction:" Bidders may place proxy bids. The winners will then end up paying the lowest
winning bid for the item(s).
We will only allow single lots to be sold. This means we will not allow groups of lots to be sold together
(you won't be able to sell items A and B together). However, you can sell a bunch of items as one lot
(i.e. 100 pencils in lot A).
Once an auction is over, it is over. In some auctions, if a bid is placed within a certain amount of time
(i.e. 5 seconds) before the end of an auction, the auction is extended for some time. We will not do that
here.
Number of items. In the case that two people bid the same thing, the person who bid for more items will
win, regardless of who bid first. If both buyers bid for the same number of items, the earliest bid will
win.
Proxy bidding rounds. One round will be defined as when the auction engine cycles through all users and
adjusts bids accordingly, based on the current high bid and the buyer's maximum bid. A round will commence
once a buyer places a bid on a lot, and will proceed in the order the bids were placed. If at the end of
the round, a resolution is not achieved, we will start over from the beginning.
There are also two other types of auctions that we will not use here, but may be good for reference.


Winning Bid Auction - The winning buyer gets the requested lots for the price they bid. If there are
multiple winners, everyone gets the price they bid.
Clear Price Auction - The winning buyers get the requested lots for the lowest winning bid.
Now that we've outlined our needs, let's take a look at the database structure behind the auction.