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

ASP
ASP+XML实例演练编程代码
asp下利用XMLHTTP 从其他页面获取数据的代码
asp下实现IP限制函数代码
asp下IP地址分段计算函数
asp身份证验证代码函数
用Asp隐藏文件路径,实现防盗链 的代码
ASP生成柱型体,折线图,饼图源代码提供了
用asp实现网址和邮件地址的转换函数
asp下最简洁的多重查询的解决方案
asp下用datediff实现计算两个时间差的函数
asp下实现记录集内随机取记录的代码
asp下轻松实现将上传图片到数据库的代码
[原创]站长感慨asp编程究竟何去何从
fso asp生成静态html的代码
ASP版实现cookies注入加速工具
ASP实现网页打开任何类型文件都提示保存的方法附代码
asp下使用数组存放数据的代码
一句话 asp木马加密版 彻底突破杀毒软件
asp清空application的方法
使用asp下的adodb.stream 下载文件而不是打开

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


出处:互联网   整理: 软晨网(RuanChen.com)   发布: 2009-11-03   浏览: 140 ::
收藏到网摘: 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.