Combining disparate purchases into a single purchase order for billing and shipment

Abstract
An order is placed by a purchaser at a client system and received by a server system. The server system receives purchaser information including identification of the purchaser, payment information, and shipment information from the client system. The server system then assigns a client identifier to the client system and associates the assigned client identifier with the received purchaser information. The server system sends to the client system the assigned client identifier. The client system receives and stores the assigned client identifier. In response to an order indication, the client system sends to the server system a request to purchase the identified item. The server system receives the request and combines at least one previous purchase associated with the client identifier of the client system to generate a single order for billing and shipment.
Description
TECHNICAL FIELD

The present invention relates to a computer method and system for placing an order and, more particularly, to a method and system for ordering items over the Internet.


BACKGROUND OF THE INVENTION

The Internet comprises a vast number of computers and computer networks that are interconnected through communication links. The interconnected computers exchange information using various services, such as electronic mail, Gopher, and the World Wide Web (“WWW”). The WWW service allows a server computer system (i.e., Web server or Web site) to send graphical Web pages of information to a remote client computer system. The remote client computer system can then display the Web pages. Each resource (e.g. computer or Web page) of the WWW is uniquely identifiable by a Uniform Resource Locator (“URL”). To view a specific Web page, a client computer system specifies the URL for that Web page in a request (e.g., a HyperText Transfer Protocol (“HTTP”) request). The request is forwarded to the Web server that supports that Web page. When that Web server receives the request, it sends that Web page to the client computer system. When the client computer system receives that Web page, it typically displays the Web page using a browser. A browser is a special-purpose application program that effects the requesting of Web pages and the displaying of Web pages.


Currently, Web pages are typically defined using HyperText Markup Language (“HTML”). HTML provides a standard set of tags that define how a Web page is to be displayed. When a user indicates to the browser to display a Web page, the browser sends a request to the server computer system to transfer to the client computer system an HTML document that defines the Web page. When the requested HTML document is received by the client computer system, the browser displays the Web page as defined by the HTML document. The HTML document contains various tags that control the displaying of text, graphics, controls, and other features. The HTML document may contain URLs of other Web pages available on that server computer system or other server computer systems.


The World Wide Web is especially conducive to conducting electronic commerce. Many Web servers have been developed through which vendors can advertise and sell product. The products can include items (e.g., music) that are delivered electronically to the purchaser over the Internet and items (e.g., books) that are delivered through conventional distribution channels (e.g., a common carrier). A server computer system may provide an electronic version of a catalog that lists the items that are available. A user, who is a potential purchaser, may browse through the catalog using a browser and select various items that are to be purchased. When the user has completed selecting the items to be purchased, the server computer system then prompts the user for information to complete the ordering of the items. This purchaser-specific order information may include the purchaser's name, the purchaser's credit card number, and a shipping address for the order. The server computer system then typically confirms the order by sending a confirming Web page to the client computer system and schedules shipment of the items.


Since the purchaser-specific order information contains sensitive information (e.g., a credit card number), both vendors and purchasers want to ensure the security of such information. Security is a concern because information transmitted over the Internet may pass through various intermediate computer systems on its way to its final destination. The information could be intercepted by an unscrupulous person at an intermediate system. To help ensure the security of the sensitive information, various encryption techniques are used when transmitting such information between a client computer system and a server computer system. Even though such encrypted information can be intercepted, because the information is encrypted, it is generally useless to the interceptor. Nevertheless, there is always a possibility that such sensitive information may be successfully decrypted by the interceptor. Therefore, it would be desirable to minimize the sensitive information transmitted when placing an order.


The selection of the various items from the electronic catalogs is generally based on the “shopping cart” model. When the purchaser selects an item from the electronic catalog, the server computer system metaphorically adds that item to a shopping cart. When the purchaser is done selecting items, then all the items in the shopping cart are “checked out” (i.e., ordered) when the purchaser provides billing and shipment information. In some models, when a purchaser selects any one item, then that item is “checked out” by automatically prompting the user for the billing and shipment information. Although the shopping cart model is very flexible and intuitive, it has a downside in that it requires many interactions by the purchaser. For example, the purchaser selects the various items from the electronic catalog, and then indicates that the selection is complete. The purchaser is then presented with an order Web page that prompts the purchaser for the purchaser-specific order information to complete the order. That Web page may be prefilled with information that was provided by the purchaser when placing another order. The information is then validated by the server computer system, and the order is completed. Such an ordering model can be problematic for a couple of reasons. If a purchaser is ordering only one item, then the overhead of confirming the various steps of the ordering process and waiting for, viewing, and updating the purchaser-specific order information can be much more than the overhead of selecting the item itself. This overhead makes the purchase of a single item cumbersome. Also, with such an ordering model, each time an order is placed sensitive information is transmitted over the Internet. Each time the sensitive information is transmitted over the Internet, it is susceptible to being intercepted and decrypted.


SUMMARY OF THE INVENTION

An embodiment of the present invention provides a method and system for ordering an item from a client system. The client system is provided with an identifier that identifies a customer. The client system displays information that identifies the item and displays an indication of an action (e.g., a single action such as clicking a mouse button) that a purchaser is to perform to order the identified item. In response to the indicated action being performed, the client system sends to a server system the provided identifier and a request to order the identified item. The server system uses the identifier to identify additional information needed to generate an order for the item and then generates the order.


The server system receives and stores the additional information for customers using various computer systems so that the server system can generate such orders. The server system stores the received additional information in association with an identifier of the customer and provides the identifier to the client system. When requested by the client system, the server system provides information describing the item to the requesting client system. When the server system receives a request from a client system, the server system combines the additional information stored in association with the identifier included in the request to effect the ordering of the item.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1A-1C illustrate single-action ordering in one embodiment of the present invention.



FIG. 2 is a block diagram illustrating an embodiment of the present invention.



FIG. 3 is a flow diagram of a routine that enables single-action ordering for a customer.



FIG. 4 is a flow diagram of a routine to generate a Web page in which single-action ordering is enabled.



FIG. 5 is a flow diagram of a routine which processes a single-action order.



FIG. 6 is a flow diagram of a routine for generating a single-action order summary Web page.



FIG. 7 is a flow diagram of a routine that implements an expedited order selection algorithm.



FIGS. 8A-8C illustrate a hierarchical data entry mechanism in one embodiment.





DETAILED DESCRIPTION OF THE INVENTION

The present invention provides a method and system for single-action ordering of items in a client/server environment. The single-action ordering system of the present invention reduces the number of purchaser interactions needed to place an order and reduces the amount of sensitive information that is transmitted between a client system and a server system. In one embodiment, the server system assigns a unique client identifier to each client system. The server system also stores purchaser-specific order information for various potential purchasers. The purchaser-specific order information may have been collected from a previous order placed by the purchaser. The server system maps each client identifier to a purchaser that may use that client system to place an order. The server system may map the client identifiers to the purchaser who last placed an order using that client system. When a purchaser wants to place an order, the purchaser uses a client system to send the request for information describing the item to be ordered along with its client identifier. The server system determines whether the client identifier for that client system is mapped to a purchaser. If so mapped, the server system determines whether single-action ordering is enabled for that purchaser at that client system. If enabled, the server system sends the requested information (e.g., via a Web page) to the client computer system along with an indication of the single action to perform to place the order for the item. When single-action ordering is enabled, the purchaser need only perform a single action (e.g., click a mouse button) to order the item. When the purchaser performs that single action, the client system notifies the server system. The server system then completes the order by adding the purchaser-specific order information for the purchaser that is mapped to that client identifier to the item order information (e.g., product identifier and quantity). Thus, once the description of an item is displayed, the purchaser need only take a single action to place the order to purchase that item. Also, since the client identifier identifies purchaser-specific order information already stored at the server system, there is no need for such sensitive information to be transmitted via the Internet or other communications medium.



FIGS. 1A-1C illustrate single-action ordering in one embodiment of the present invention. FIG. 1A illustrates the display of a Web page describing an item that may be ordered. This example Web page was sent from the server system to the client system when the purchaser requested to review detailed information about the item. This example Web page contains a summary description section 101, a shopping cart section 102, a single-action ordering section 103, and a detailed description section 104. One skilled in the art would appreciate that these various sections can be omitted or rearranged or adapted in various ways. In general, the purchaser need only be aware of the item or items to be ordered by the single action and of the single action needed to place the order. The summary description and the detailed description sections provide information that identifies and describes the item(s) that may be ordered. The shopping cart section provides the conventional capability to add the described item to a shopping cart. The server system adds the summary description, the detailed description, and the shopping cart sections to each Web page for an item that may be ordered. The server system, however, only adds the single-action ordering section when single-action ordering is enabled for that purchaser at that client system. (One skilled in the art would appreciate that a single Web page on the server system may contain all these sections but the single-action ordering section can be selectively included or excluded before sending the Web page to the client system.) This example single-action ordering section allows the purchaser to specify with a single click of a mouse button to order the described item. Once the purchaser clicks the mouse button, the item is ordered, unless the purchaser then takes some action to modify the order. The single-action ordering section contains a single-action ordering button 103a, purchaser identification subsection 103b, and single-action ordering information subsections 103c and 103d. The purchaser information subsection displays enough information so that the purchaser can verify that the server system correctly recognizes the purchaser. To reduce the chances of sensitive information being intercepted, the server system sends only enough information so that the purchaser is confident that the server system correctly identified the purchaser but yet not enough information to be useful to an unscrupulous interceptor. The additional information subsections allow the purchaser to obtain various settings or obtain more information related to the single-action ordering. If the purchaser wants to verify the shipping address, the purchaser can select the “check shipping address” label. In response to this selection, the server system may require the purchaser to perform a “login” so that the identity of the purchaser can be verified before the shipping information is viewed or modified. The server system then sends a Web page to the client system for display and possible modification of the shipping address. In this way, the transmitting of the sensitive shipping address can be avoided unless requested by the verified purchaser.


When the purchaser selects the single-action ordering button, the client system sends a message to the server system requesting that the displayed item be ordered. After the server system processes the message, the server system provides to the client system a new Web page that confirms receipt of the single-action order. FIG. 1B illustrates the display of a Web page confirming a single-action order. The confirming Web page contains essentially the same information as the Web page describing the item (i.e., FIG. 1A) except that an order confirmation section 105 is displayed at the top of the Web page. The order confirmation section confirms that the order has been placed and provides an opportunity for the purchaser to review and change the single-action order. Alternatively, the confirming Web page can be identical to the Web page describing the item (i.e., FIG. 1A), except that the single-action ordering button is replaced with a message confirming the order.


If a single-action ordering is not currently enabled for the client system but could be enabled, then the server system can generate a Web page like FIG. 1A, except that the single-action ordering button 103a is replaced by a single-action ordering enable button. Such a replacement button could contain text instructing the purchaser to click on the button to enable single-action ordering. When the purchaser clicks on that button, the server system would send the Web page of FIG. 1A to be displayed. Single-action ordering can be enabled whenever the server system has stored sufficient purchaser-specific order information for that client system to complete a single-action order. If the server system does not have sufficient information, then when the purchaser selects the single-action ordering button, the server system can provide a Web page to collect the additional information that is needed. The server system may require the purchases to “login” so that the identify of the purchaser can be verified before the single-action ordering is enabled.


To help minimize shipping costs and purchaser confusion, the server system may combine various single-action orders into a multiple-item order. For example, if a purchaser orders one item using the single-action ordering and five minutes later orders another item using the single-action ordering, then those orders may be cost effectively combined into a single order for shipping. The server system combines the single-action orders when their expected ship dates are similar. For example, if one item is immediately available and the other item will be available in one day, then the two single-action orders may be cost-effectively combined. However, if the other item will not be available for two weeks, then the two single-item orders would not be combined. FIG. 1C illustrates the display of a Web page representing four single-action orders that have been combined into two separate multiple-item orders based on the availability of the items. The order information 106 indicates that item 1 and item 2, which will be available in three or fewer days, have been combined into one order. The order information 107 indicates that items 3 and 4, which will not be available within one week, are combined into a separate order. In one embodiment, the server system may combine single-action orders that are placed within a certain time period (e.g., 90 minutes). Also, the server system may combine or divide orders when the orders are scheduled for shipment based on the then current availability of the items ordered. This delayed modification of the orders is referred to as “expedited order selection” and is described below in detail.



FIG. 2 is a block diagram illustrating an embodiment of the present invention. This embodiment supports the single-action ordering over the Internet using the World Wide Web. The server system 210 includes a server engine 211, a client identifier/customer table 212, various Web pages 213, a customer database 214, an order database 215, and an inventory database 216. The server engine receives HTTP requests to access Web pages identified by URLs and provides the Web pages to the various client systems. Such an HTTP request may indicate that the purchaser has performed the single action to effect single-action ordering. The customer database contains customer information for various purchasers or potential purchasers. The customer information includes purchaser-specific order information such as the name of the customer, billing information, and shipping information. The order database 215 contains an entry for each order that has not yet been shipped to a purchaser. The inventory database 216 contains a description of the various items that may be ordered. The client identifier/customer table 212 contains a mapping from each client identifier, which is a globally unique identifier that uniquely identifies a client system, to the customer last associated with that client system. The client system 220 contains a browser and its assigned client identifier. The client identifier is stored in a file, referred to as a “cookie.” In one embodiment, the server system assigns and sends the client identifier to the client system once when the client system first interacts with the server system. From then on, the client system includes its client identifier with all messages sent to the server system so that the server system can identify the source of the message. The server and client systems interact by exchanging information via communications link 230, which may include transmission over the Internet.


One skilled in the art would appreciate that the single-action ordering techniques can be used in various environments other than the Internet. For example, single-action ordering can also be in an electronic mail environment in which an item is described in an electronic mail message along with an indication of the single action that is to be performed to effect the ordering of the item. Also, various communication channels may be used such as local area network, wide area network, or point-to-point dial up connection. Also, a server system may comprise any combination of hardware or software that can generate orders in response to the single action being performed. A client system may comprise any combination of hardware or software that can interact with the server system. These systems may include television-based systems or various other consumer products through which orders may be placed.



FIG. 3 is a flow diagram of a routine that enables single-action ordering for a customer. To enable single-action ordering, a server system needs to have information about the customer that is equivalent to the purchaser-specific order information. The server system can obtain this information in various ways. First, the server system could ask the customer if they would like to have single-action ordering enabled. If so, then the server system could prompt the customer using a Web page for the purchaser-specific order information. Second, the server system could also save the purchaser-specific order information collected when an order is placed conventionally. The server system could, either automatically or with the customer's assent, enable single-action ordering. In step 301, the server system retrieves the client identifier that was sent by the client system. In step 302, the server system updates the client identifier/customer table to indicate that the generated client identifier has been associated with that customer. In step 303, the server system sets a flag indicating that single-action ordering is enabled for that client identifier and that customer combination. That flag may be stored in the client identifier/customer table. In step 304, the server system supplies a confirming Web page to the client system. The next time a purchaser attempts to order an item, the client system will supply its client identifier to the server system. If single-action ordering is enabled for that purchaser, the server system will assume that the purchaser is the customer associated with that client identifier in the client identifier/customer table. Thus, a purchaser may not want to allow the server system to enable single-action ordering if there is a possibility that someone else may use that same client system.



FIG. 4 is a flow diagram of a routine to generate a Web page in which single-action ordering is enabled. When single-action ordering is enabled, the server system generates a Web page describing an item as is conventionally done and then adds a single-action ordering section. In one embodiment, the server system adds partial purchaser-specific order information to the section. This information may include the customer's name, a shipping address moniker selected by the purchaser (e.g., “at home”), and the last five digits of a credit card number or a nickname selected by the purchaser. Such partial information should be the minimum information sufficient to indicate to the purchaser whether or not the server system is using the correct purchaser-specific order information. In step 401, the server system generates a standard shopping cart-type Web page for the item. In step 402, if the single-action ordering flag has been set for the client identifier and customer combination, then the server system continues at step 403, else the server system completes. In step 403, the server system adds the single-action section to the Web page and completes.



FIG. 5 is a flow diagram of a routine which processes a single-action order. When a purchaser performs the single action needed to place an order, the client system notifies the server system. The server system then combines the purchaser-specific order information for the customer associated with the client system with the item order information to complete the order. The single-action order may also be combined with other single-action orders and possibly with other conventionally placed orders to reduce shipping costs. In one embodiment, single-action orders can be combined if they are placed within a certain time period of each other (e.g., 90 minutes). This routine illustrates the combining of the single-action orders into a short-term order (e.g., available to be shipped in less than a week) and a long-term order (e.g., available to be shipped in more than a week). One skilled in the art would appreciate that the single-action orders can be combined in various ways based on other factors, such as size of shipment and intermediate-term availability. In step 501, if the item is expected to be shipped in the short term, then the server system continues at step 502, else the server system continues at step 505. In step 502, if a short-term order has already been opened for the purchaser, then the server system continues at step 504, else the server system continues at step 503. In step 503, the server system creates a short-term order for the purchaser. In step 504, the server system adds the item to the short-term order and continues at step 508. In step 505, if a long-term order has already been opened for the purchaser, then the server system continues at step 507, else the server system continues at step 506. In step 506, the server system creates a long-term order for the purchaser. In step 507, the server system adds the item to the long-term order. In step 508, the server system generates and sends the confirmation and completes.



FIG. 6 is a flow diagram of a routine for generating a single-action order summary Web page. This Web page (e.g., FIG. 1C) gives the user the opportunity to view and modify the short-term and long-term single-action orders. In step 601, the server system adds the standard single-action order information to the Web page. In step 602, if a short-term order is open, then the server system adds the short-term order to the Web page in step 603. In step 604, if a long-term order is open, then the server system adds the long-term order information to the Web page in step 605 and completes.



FIG. 7 is a flow diagram of a routine that implements an expedited order selection algorithm. The goal of the expedited order selection algorithm is to minimize the number of orders sent to each destination so that shipping costs are reduced. A destination may be a specific shipping address plus a specific purchaser's billing details. Orders that are sent to the same destination are known as “sibling orders.” The algorithm has two stages. In the first stage, the algorithm schedules for shipment the orders for destinations for which all the sibling orders are filled. An order is filled when all its items are currently in inventory (i.e., available) and can be shipped. For each group of sibling orders, the algorithm combines those sibling orders into a single combined order so that only one order is currently scheduled for shipment to each destination. In the second stage, the algorithm combines and schedules groups of sibling orders for which some of the sibling orders are not filled or partially filled. The algorithm may split each partially filled sibling order into a filled sibling order and a completely unfilled sibling order. The algorithm then combines all the filled sibling orders into a single combined order and schedules the combined order for shipment. If any group has only one sibling order and that order is partially filled, then the algorithm in one embodiment does not split that order to avoid making an extra shipment to that destination.


During the second stage, the algorithm may select and schedule groups of sibling orders in a sequence that is based on the next fulfillment time for an item in the group. The next fulfillment time for a group of sibling orders is the minimum expected fulfillment time of the items in that group of sibling orders. For example, if a group of sibling orders has seven items that are not yet fulfilled and their expected fulfillment times range from 3 days to 14 days, then the next fulfillment time for that group is 3 days. The algorithm first schedules those groups of sibling orders with the largest next fulfillment time. For example, if 6 groups have next fulfillment times of 3, 5, 7, 10, 11, and 14 days, respectively, then the algorithm first selects and schedules the sibling orders in the group with the next fulfillment time of 14 days, followed by the group with the next fulfillment time of 11 days, and so on. By delaying the scheduling of groups with short next fulfillment times, the algorithm increases the chances of additional items becoming available (because of the shortness of the next fulfillment time) and thus combined with the scheduled order.


Steps 701-703 represent the first stage of the expedited order selection algorithm, and steps 704-706 represent the second stage of the expedited selection order algorithm. In steps 701-703, the algorithm loops selecting groups in which all sibling orders are filled and combining the orders. In step 701, the algorithm selects the next group with all sibling orders that are filled. In step 703, if all such groups have already been selected, then the algorithm continues with the second stage in step 704, else the algorithm continues at step 703. In step 703, the algorithm combines and schedules the orders in the selected group and loops to step 701. In step 704, the algorithm selects the next group of sibling orders that has the largest next fulfillment time. In step 705, if all such groups have already been selected, then the algorithm is done, else the algorithm continues at step 706. In step 706, the algorithm combines and schedules the orders in the selected group and loops to step 704. When the expedited order selection algorithm is being performed, new orders and new inventory may be received. Whenever such new orders and new inventory is received, then the algorithm restarts to schedule and combine the new orders as appropriate.


Although the algorithm has been described as having two stages, it could be implemented in an incremental fashion where the assessment of the first and second stages are redone after each order is scheduled. One skilled in the art would recognize that there are other possible combinations of these stages which still express the same essential algorithm.



FIGS. 8A-8C illustrate a hierarchical data entry mechanism in one embodiment. When collecting information from a user, a Web page typically consists of a long series of data entry fields that may not all fit onto the display at the same time. Thus, a user needs to scroll through the Web page to enter the information. When the data entry fields do not fit onto the display at the same time, it is difficult for the user to get an overall understanding of the type and organization of the data to be entered. The hierarchical data entry mechanism allows a user to understand the overall organization of the data to be entered even though the all data entry fields would not fit onto the display at the same time. FIG. 8A illustrates an outline format of a sample form to be filled in. The sample form contains various sections identified by letters A, B, C, and D. When the user selects the start button, then section A expands to include the data entry fields for the customer name and address. FIG. 8B illustrates the expansion of section A. Since only section A has been expanded, the user can view the data entry fields of section A and summary information of the other sections at the same time. The user then enters data in the various data entry fields that are displayed. Upon completion, the user selects either the next or previous buttons. The next button causes section A to be collapsed and section B to be expanded so that financial information may be entered. FIG. 8C illustrates the expansion of section B. If the previous button is selected, then section A would collapse and be displayed as shown in FIG. 8A. This collapsing and expanding is repeated for each section. At any time during the data entry, if an error is detected, then a Web page is generated with the error message in close proximity (e.g., on the line below) to the data entry field that contains the error. This Web page is then displayed by the client system to inform the user of the error. In addition, each of the data “entry” fields may not be editable until the user clicks on the data entry field or selects an edit button associated with the data entry field. In this way, the user is prevented from inadvertently changing the contents of an edit field. When the user clicks on a data entry field, a new Web page is presented to the user that allows for the editing of the data associated with the field. When editing is complete, the edited data is displayed in the data “entry” field. Because the fields of the form are thus not directly editable, neither “named-submit” buttons nor Java are needed. Also, the form is more compact because the various data entry options (e.g., radio button) are displayed only on the new Web page when the field is to be edited.


Although the present invention has been described in terms of various embodiments, it is not intended that the invention be limited to these embodiments. Modification within the spirit of the invention will be apparent to those skilled in the art. For example, the server system can map a client identifier to multiple customers who have recently used the client system. The server system can then allow the user to identify themselves by selecting one of the mappings based preferably on a display of partial purchaser-specific order information. Also, various different single actions can be used to effect the placement of an order. For example, a voice command may be spoken by the purchaser, a key may be depressed by the purchaser, a button on a television remote control device may be depressed by the purchaser, or selection using any pointing device may be effected by the purchaser. Although a single action may be preceded by multiple physical movements of the purchaser (e.g., moving a mouse so that a mouse pointer is over a button), the single action generally refers to a single event received by a client system that indicates to place the order. Finally, the purchaser can be alternately identified by a unique customer identifier that is provided by the customer when the customer initiates access to the server system and sent to the server system with each message. This customer identifier could be also stored persistently on the client system so that the purchaser does not need to re-enter their customer identifier each time access is initiated. The scope of the present invention is defined by the claims that follow.

Claims
  • 1. A computer-implemented method in a client system for ordering items, the method comprising: receiving, from a server system, by a computer of a client system a client identifier of the client system;persistently storing the client identifier at the client system; andfor each item of a plurality of items: providing for display, at the client system, information identifying the item and an indication of a single action that is to be performed to place an order of the identified item, wherein the single action is an only action required by the client system to complete the order of the identified item without requiring the client system to confirm the order following performance of the single action; andin response to the single action being performed, sending to the server system a request to order the identified item and the client identifier, the request to order being a single-action order request indicated by the single action and the client identifier identifying account information of a user;wherein the sending causes the server system to determine how to combine and to combine into a single order the single-action order request indicated by the single action and one or more previous single-action order requests associated with the client identifier.
  • 2. The method of claim 1 wherein the single order includes single-action order requests placed within a certain time interval of each other.
  • 3. The method of claim 1 wherein the single order includes single-action order requests placed within a time interval of 90 minutes of other single-action orders.
  • 4. The method of claim 1 wherein the single order includes combining single-action order requests based on availability of the items.
  • 5. The method of claim 4 wherein the availability of items is categorized as short-term or long-term, wherein short-term corresponds to orders available to be shipped in less than one week from the request to order and long-term corresponds to orders available to be shipped in more than one week from the request to order.
  • 6. The method of claim 4 wherein the availability is categorized as short-term or long-term, wherein short-term corresponds to orders in inventory and available to be shipped upon sending of the request to order and long-term corresponds to orders not available to be shipped upon sending of the request to order.
  • 7. The method of claim 1 wherein the client system and the server system communicate via the Internet.
  • 8. The method of claim 1 wherein the single action is clicking a mouse button for a cursor positioned over a predefined area of the displayed information.
  • 9. The method of claim 1 wherein providing for display includes providing partial information supplied by the server system corresponding to the identity of the user of the client system.
  • 10. The method of claim 1, wherein providing for display includes providing partial shipping information supplied by the server system.
  • 11. The method of claim 1, wherein providing for display includes providing partial payment information supplied by the server system.
  • 12. The method of claim 1, wherein the single order further comprises one or more additional orders associated with the client identifier of the client system.
  • 13. The method of claim 1, wherein the single order includes sibling single-action order requests corresponding to orders with a common destination.
  • 14. A computer-implemented method in a server system for receiving item orders, the method comprising: transmitting, from a server system, to a computer of a client system a client identifier of the client system for persistent storage at the client system;for each item of a plurality of items: providing for display, at the client system, information identifying the item and an indication of a single action that is to be performed to place an order of the identified item, wherein the single action is an only action required by the client system to complete the order of the identified item without requiring the client system to confirm the order following performance of the single action; andreceiving, in response to the single action being performed at the client system, a request to order the identified item and the client identifier, the request to order being a single-action order request indicated by the single action and the client identifier identifying account information of a user; anddetermining how to combine and combining, at the server system, into a single order the single action order request indicated by the single action and one or more previous single-action order requests associated with the client identifier in response to receiving the single-action order request.
  • 15. The method of claim 14, wherein the combining into the single order includes combining single-action order requests received at the server system within a certain time interval of each other.
  • 16. The method of claim 14 wherein the combining into the single order includes combining single-action order requests received at the server system within a time interval of 90 minutes of each other.
  • 17. The method of claim 14, wherein the combining into the single order includes combining single-action order requests based on availability of the items.
  • 18. The method of claim 17, wherein the availability of items is categorized as short-term or long-term, wherein short-term corresponds to orders available to be shipped in less than one week from the request to order and long-term corresponds to orders available to be shipped in more than one week from the request to order.
  • 19. The method of claim 17, wherein the availability is categorized as short-term, or long-term, wherein short-term corresponds to orders in inventory and available to be shipped upon sending of the request to order and long-term corresponds to orders not available to be shipped upon sending of the request to order.
  • 20. The method of claim 14, wherein the client system and the server system communicate via the Internet.
  • 21. The method of claim 14, wherein the single action is receiving a notification of a performance corresponding to clicking a mouse button for a cursor positioned over a predefined area of the displayed information.
  • 22. The method of claim 14, wherein the single order further comprises one or more additional orders associated with the client identifier of the client system.
  • 23. The method of claim 14, wherein the single order combines sibling single-action order requests corresponding to orders with a common destination.
  • 24. The method of claim 14, wherein the combining into the single order further comprises: combining at a first stage those of the single-action order request indicated by the single action and the one or more previous single-action order requests in which all items are available for shipping into one or more groups of sibling orders for delivery to a common destination; andcombining at a second stage those of the single-action order request indicated by the single action and the one or more previous single-action order requests in which not all items are available for shipping into one or more groups of sibling orders for later delivery.
  • 25. The method of claim 1, wherein, following performance of the single action, the user is provided a limited period of time during which he can still perform a second action to cancel the order.
  • 26. The method of claim 14, wherein the server system does not transmit over the internet any sensitive information of the user or the client system.
  • 27. The method of claim 1, wherein the client system receives a confirmation that confirms that the order has been placed via the single-action order request and provides an opportunity for the user to review and change the order that was placed.
  • 28. The method of claim 1, wherein an additional action is required only if the user wants to change or cancel the order that was placed.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 09/318,447, filed on May 25, 1999, which is a continuation of U.S. patent application Ser. No. 08/928,951, filed Sep. 12, 1997 (now U.S. Pat. No. 5,960,411), which applications are incorporated by reference herein in their entireties.

US Referenced Citations (270)
Number Name Date Kind
4305059 Benton Dec 1981 A
4371979 Vesterling Feb 1983 A
4525779 Davids et al. Jun 1985 A
4528643 Freeny, Jr. Jul 1985 A
4529870 Chaum Jul 1985 A
4555781 Baldry et al. Nov 1985 A
4578530 Zeidler Mar 1986 A
4734858 Schlafly Mar 1988 A
4739310 Yamamoto Apr 1988 A
4755940 Brachtl Jul 1988 A
4759063 Chaum Jul 1988 A
4759064 Chaum Jul 1988 A
4775935 Yourick Oct 1988 A
4795890 Goldman Jan 1989 A
4799156 Shavit Jan 1989 A
4812628 Boston et al. Mar 1989 A
4827508 Shear May 1989 A
4832204 Handy et al. May 1989 A
4891503 Jewell Jan 1990 A
4922521 Krikke et al. May 1990 A
4926480 Chaum May 1990 A
4935870 Burk, Jr. et al. Jun 1990 A
4937863 Robert et al. Jun 1990 A
4947028 Gorog Aug 1990 A
4947430 Chaum Aug 1990 A
4949380 Chaum Aug 1990 A
4972318 Brown et al. Nov 1990 A
4977595 Ohta et al. Dec 1990 A
4982346 Girouard et al. Jan 1991 A
4987593 Chaum Jan 1991 A
4991210 Chaum Feb 1991 A
4992940 Dworkin Feb 1991 A
4996711 Chaum Feb 1991 A
5025373 Keyser, Jr. et al. Jun 1991 A
5057915 Von Kohorn Oct 1991 A
5061053 Hirakawa Oct 1991 A
5063507 Lindsey et al. Nov 1991 A
5077607 Johnson et al. Dec 1991 A
5105184 Pirani et al. Apr 1992 A
5168446 Wiseman Dec 1992 A
5204897 Wyman Apr 1993 A
5208748 Flores et al. May 1993 A
5220501 Lawlor et al. Jun 1993 A
5227874 Von Kohorn Jul 1993 A
5247575 Sprague et al. Sep 1993 A
5260999 Wyman Nov 1993 A
5276736 Chaum Jan 1994 A
5283734 Von Kohorn Feb 1994 A
5285383 Lindsey et al. Feb 1994 A
5303393 Noreen et al. Apr 1994 A
5305195 Murphy Apr 1994 A
5311584 Bogart et al. May 1994 A
5311594 Penzias May 1994 A
5319542 King, Jr. et al. Jun 1994 A
5321751 Ray et al. Jun 1994 A
5329589 Fraser et al. Jul 1994 A
5336870 Hughes et al. Aug 1994 A
5339392 Risberg et al. Aug 1994 A
5341429 Stringer et al. Aug 1994 A
5347632 Filepp et al. Sep 1994 A
5351186 Bullock et al. Sep 1994 A
5351293 Michener et al. Sep 1994 A
5383113 Kight et al. Jan 1995 A
5414833 Hershey et al. May 1995 A
5422821 Allen et al. Jun 1995 A
5442791 Wrabetz et al. Aug 1995 A
5444192 Shetye et al. Aug 1995 A
5448633 Jamaleddin Sep 1995 A
5451998 Hamrick Sep 1995 A
5452203 Moore Sep 1995 A
5457797 Butterworth et al. Oct 1995 A
5467269 Flaten Nov 1995 A
5469206 Strubbe et al. Nov 1995 A
5485369 Nicholls et al. Jan 1996 A
5513117 Small Apr 1996 A
5515268 Yoda May 1996 A
5521631 Budow et al. May 1996 A
5535229 Hain, Jr. et al. Jul 1996 A
5544322 Cheng et al. Aug 1996 A
5550734 Tarter et al. Aug 1996 A
5555496 Tackbary Sep 1996 A
5557516 Hogan Sep 1996 A
5557518 Rosen Sep 1996 A
5557798 Skeen et al. Sep 1996 A
5560008 Johnson et al. Sep 1996 A
5577209 Boyle et al. Nov 1996 A
5583937 Ullrich et al. Dec 1996 A
5590197 Chen et al. Dec 1996 A
5592378 Cameron et al. Jan 1997 A
5594910 Filepp et al. Jan 1997 A
5596642 Davis et al. Jan 1997 A
5596643 Davis et al. Jan 1997 A
5603031 White et al. Feb 1997 A
5604802 Holloway Feb 1997 A
5611040 Brewer et al. Mar 1997 A
5613012 Hoffman et al. Mar 1997 A
5621456 Florin et al. Apr 1997 A
5621797 Rosen Apr 1997 A
5623547 Jones et al. Apr 1997 A
5627940 Rohra et al. May 1997 A
5640501 Turpin Jun 1997 A
5640577 Scharmer Jun 1997 A
5642418 Farris et al. Jun 1997 A
5642419 Rosen Jun 1997 A
5646992 Subler Jul 1997 A
5655174 Hirst Aug 1997 A
5664111 Nahan et al. Sep 1997 A
5666493 Wojcik et al. Sep 1997 A
5675507 Bobo, II Oct 1997 A
5677955 Doggett et al. Oct 1997 A
5692132 Hogan Nov 1997 A
5694546 Reisman Dec 1997 A
5694551 Doyle et al. Dec 1997 A
5704044 Tarter et al. Dec 1997 A
5708780 Levergood et al. Jan 1998 A
5710887 Chelliah Jan 1998 A
5715314 Payne et al. Feb 1998 A
5715399 Bezos Feb 1998 A
5719941 Swift Feb 1998 A
5724424 Gifford Mar 1998 A
5724472 Abecassis Mar 1998 A
5727163 Bezos Mar 1998 A
5729594 Klingman Mar 1998 A
5737729 Denman Apr 1998 A
5740252 Minor et al. Apr 1998 A
5745681 Levine et al. Apr 1998 A
5754939 Herz et al. May 1998 A
5758126 Daniels et al. May 1998 A
5761648 Golden et al. Jun 1998 A
5774670 Montulli Jun 1998 A
5774870 Storey Jun 1998 A
5774873 Berent et al. Jun 1998 A
5784565 Lewine Jul 1998 A
5790793 Higley Aug 1998 A
5793972 Shane Aug 1998 A
5794006 Sanderman Aug 1998 A
5794219 Brown Aug 1998 A
5809144 Sirbu et al. Sep 1998 A
5809483 Broka et al. Sep 1998 A
5812668 Weber Sep 1998 A
5812769 Graber et al. Sep 1998 A
5812931 Yuen Sep 1998 A
5813006 Polnerow et al. Sep 1998 A
5815665 Teper et al. Sep 1998 A
5819034 Joseph et al. Oct 1998 A
5826241 Stein et al. Oct 1998 A
5826242 Montulli Oct 1998 A
5831860 Foladare et al. Nov 1998 A
5835896 Fisher et al. Nov 1998 A
5845260 Nakano et al. Dec 1998 A
5845265 Woolston Dec 1998 A
5848399 Burke Dec 1998 A
5850446 Berger et al. Dec 1998 A
5857175 Day et al. Jan 1999 A
5860862 Junkin Jan 1999 A
5862220 Perlman Jan 1999 A
5862241 Nelson Jan 1999 A
5862325 Reed et al. Jan 1999 A
RE36116 McCarthy Feb 1999 E
5870715 Belitz et al. Feb 1999 A
5870716 Sugiyama et al. Feb 1999 A
5870717 Wiecha Feb 1999 A
5878141 Daly et al. Mar 1999 A
5887062 Maeda et al. Mar 1999 A
5889863 Weber Mar 1999 A
5890137 Koreeda Mar 1999 A
5893076 Hafner et al. Apr 1999 A
5893080 McGurl et al. Apr 1999 A
5897622 Blinn et al. Apr 1999 A
5898919 Yuen Apr 1999 A
5899980 Wilf et al. May 1999 A
5901214 Shaffer et al. May 1999 A
5903878 Talati et al. May 1999 A
5905942 Stoel et al. May 1999 A
5905975 Ausubel May 1999 A
5909023 Ono et al. Jun 1999 A
5909203 Browning et al. Jun 1999 A
5909492 Payne et al. Jun 1999 A
5920642 Merjanian Jul 1999 A
5920696 Brandt et al. Jul 1999 A
5926168 Fan Jul 1999 A
5943424 Berger et al. Aug 1999 A
5946665 Suzuki et al. Aug 1999 A
5948040 DeLorme et al. Sep 1999 A
5949044 Walker et al. Sep 1999 A
5960069 Felger Sep 1999 A
5960411 Hartman et al. Sep 1999 A
5960412 Tackbary et al. Sep 1999 A
5963915 Kirsch Oct 1999 A
5963924 Williams et al. Oct 1999 A
5966705 Koneru et al. Oct 1999 A
5970472 Allsop et al. Oct 1999 A
5970474 LeRoy et al. Oct 1999 A
5971273 Vallaire Oct 1999 A
5973692 Knowlton et al. Oct 1999 A
5974418 Blinn et al. Oct 1999 A
5983198 Mowery Nov 1999 A
5983199 Kaneko Nov 1999 A
5983200 Slotznick Nov 1999 A
5983208 Haller et al. Nov 1999 A
5987132 Rowney Nov 1999 A
5991739 Cupps et al. Nov 1999 A
5995626 Nishioka et al. Nov 1999 A
5995943 Bull et al. Nov 1999 A
5999914 Blinn et al. Dec 1999 A
6009413 Webber et al. Dec 1999 A
6014634 Scroggie et al. Jan 2000 A
6018724 Arent Jan 2000 A
6021398 Ausubel Feb 2000 A
6021399 Demers et al. Feb 2000 A
6026376 Kenney Feb 2000 A
6035283 Rofrano Mar 2000 A
6044205 Reed et al. Mar 2000 A
6049785 Gifford Apr 2000 A
6058373 Blinn et al. May 2000 A
6078906 Huberman Jun 2000 A
6085168 Mori et al. Jul 2000 A
6085170 Tsukuda Jul 2000 A
6088717 Reed et al. Jul 2000 A
6101482 DiAngelo et al. Aug 2000 A
6101483 Petrovich et al. Aug 2000 A
6108673 Brandt et al. Aug 2000 A
6122625 Rosen Sep 2000 A
6125172 August et al. Sep 2000 A
6125352 Franklin et al. Sep 2000 A
6138106 Walker et al. Oct 2000 A
6141666 Tobin Oct 2000 A
6144945 Garg et al. Nov 2000 A
6149055 Gatto Nov 2000 A
6151582 Huang et al. Nov 2000 A
6154738 Call Nov 2000 A
6167378 Webber, Jr. Dec 2000 A
6167380 Kennedy et al. Dec 2000 A
6182072 Leak et al. Jan 2001 B1
6192407 Smith et al. Feb 2001 B1
6193155 Walker et al. Feb 2001 B1
6195649 Gifford Feb 2001 B1
6202052 Miller Mar 2001 B1
6205437 Gifford Mar 2001 B1
6230202 Lewine May 2001 B1
6266650 Sugaya et al. Jul 2001 B1
6269361 Davis et al. Jul 2001 B1
6301661 Shambroom Oct 2001 B1
6336100 Yamada Jan 2002 B1
6345288 Reed et al. Feb 2002 B1
6373950 Rowney Apr 2002 B1
6379251 Auxier et al. Apr 2002 B1
6385655 Smith May 2002 B1
6397387 Rosin et al. May 2002 B1
6449599 Payne Sep 2002 B1
6484150 Blinn et al. Nov 2002 B1
6484153 Walker et al. Nov 2002 B1
6490567 Gregory Dec 2002 B1
6493742 Holland et al. Dec 2002 B1
6539548 Hendricks et al. Mar 2003 B1
6577734 Etzel et al. Jun 2003 B1
6594692 Reisman Jul 2003 B1
6615226 Hartman et al. Sep 2003 B1
6732369 Schein et al. May 2004 B1
6757710 Reed Jun 2004 B2
6769009 Reisman Jul 2004 B1
7006989 Bezos et al. Feb 2006 B2
7016863 Kamakura et al. Mar 2006 B1
7265853 Kara et al. Sep 2007 B1
20010014884 Dillard et al. Aug 2001 A1
20020019776 Simpson Feb 2002 A1
20020178089 Bezos et al. Nov 2002 A1
20020194087 Spiegel et al. Dec 2002 A1
20050114218 Zucker et al. May 2005 A1
20070106570 Hartman et al. May 2007 A1
Foreign Referenced Citations (40)
Number Date Country
730431 Oct 1997 AU
199889488 Jan 1999 AU
2186113 Sep 1995 CA
2222229 Jul 1998 CA
0680185 Nov 1995 EP
0720090 Jul 1996 EP
0828223 Mar 1998 EP
0845747 Jun 1998 EP
0855659 Jul 1998 EP
0855687 Jul 1998 EP
0883076 Dec 1998 EP
0902381 Mar 1999 EP
2315579 Feb 1998 GB
61-195457 Aug 1986 JP
02-207645 Aug 1990 JP
04-153795 May 1992 JP
05-101078 Apr 1993 JP
06-068106 Mar 1994 JP
06-141100 May 1994 JP
3018299 Sep 1995 JP
08-506941 Jul 1996 JP
08 263729 Oct 1996 JP
09-006849 Jan 1997 JP
09-114783 May 1997 JP
09-138725 May 1997 JP
09-154108 Jun 1997 JP
09-179912 Jul 1997 JP
09-220882 Aug 1997 JP
09-259018 Oct 1997 JP
WO 9516971 Jun 1995 WO
WO 9530961 Nov 1995 WO
WO 9613013 May 1996 WO
WO 9617466 Jun 1996 WO
WO 9631826 Oct 1996 WO
WO 9634491 Oct 1996 WO
WO 9636928 Nov 1996 WO
WO 9638799 Dec 1996 WO
WO 9642041 Dec 1996 WO
WO 9817042 Apr 1998 WO
WO 9821679 May 1998 WO
Related Publications (1)
Number Date Country
20070106570 A1 May 2007 US
Continuations (2)
Number Date Country
Parent 09318447 May 1999 US
Child 11618452 US
Parent 08928951 Sep 1997 US
Child 09318447 US