Web price optimizer of multiple-item package orders for e-commerce on the internet and method of use

• US 7,058,598 B1
• Filed: 04/30/2000
• Issued: 06/06/2006
• Est. Priority Date: 04/30/2000
• Status: Expired due to Term

• Current Assignee: X Corp. (f/k/a Twitter, Inc.) (X Holdings Corp.)
• Original Assignee: International Business Machines Corporation
• Inventors: Wang, Xin, Chen, Kai
• Primary Examiner(s): Smith, Jeffrey A.
• Application Number:
  US09/560,930
• Time in Patent Office: 2,228 Days
• Field of Search: 705/26, 705/27, 707/7
• US Class Current: 705/26.62
• CPC Class Codes: G06Q 30/06 Buying, selling or leasing transactions
• CPC Class Codes: G06Q 30/0625 Directed, with specific intent or strategy
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing
• CPC Class Codes: G06Q 30/0641 Shopping interfaces

Abstract

Disclosed is an Internet-based method that enables users to search and browse for information (such as price) about a plurality of items (such as books) available for sale on the Internet, compare prices for the items individually or considered as a package, and optimize the package price. In a preferred embodiment, the invention searches for the lowest price and second lowest price for the desired items from Internet Web sites and databases, records the data in two matrices, and employs algorithms that implement certain set operations, including Cartesian product and set union, to optimize the result for all items.

Claims

1. A method of searching for, calculating and displaying an approximately optimized rank of prices of a plurality of designated items in a package on the Internet, the method comprising the steps of:

establishing an Internet Web site, the site operating as a computer interface for a user who wishes to search for and approximately optimize prices of at least two designated items a package of the items;

receiving a search request for the plurality of items from the user uses communications equipment and software to access the Web site to obtain prices about the plurality of items;

executing a multiple, simultaneous computer search on the Internet for prices of the items offered at a plurality of Internet stores for all of the items designated in the search request;

establishing a first matrix in a pre-computation algorithm, and receiving and storing in the first matrix data representing the lowest and second lowest prices retrieved in the search for each of the items from the stores;

establishing a second matrix, and receiving and storing in the second matrix data representing each store that carries all items for sale;

calculating, using algorithms including Cartesian product and set union operations performed on the data stored in the first and second matrices, an approximately optimized rank of all of the items considered as a package; and

displaying the approximately optimized rank to the user in table format.

2. The method of claim 1 in which the prices are prices posted at Internet stores that offer the items for sale.

3. The method of claim 1 in which the rank is a list of stores that offer the items for sale, arranged in ascending order of price per item or group of items.

4. The method of claim 3 in which each store in the list is displayed to the user together with a hyperlink to the store that offers each item or group for sale at the lowest price for that item or group.

5. The method of claim 3 in which the rank is calculated by performing algorithms including Cartesian product and set union operations on the data stored in the first and second matrices, the first matrix comprising a matrix of elements, each element representing the lowest and second lowest prices at which the stores are offering an item for sale, and the second matrix comprising a matrix of elements, representing a store that carries all items for sale.

6. The method of claim 5 in which the rank is calculated using the following set operations on the first and second matrices:

select lowest price from {S1a, S1b} X {S2a, S2b} X {S3a, S3b} X {S4a, S4b}X {S5a, S5b} X . . . X {Sna, Snb} ∪

{(1, 1, 1, 1, . . . ,

     1), (2, 2, 2, 2, . . . ,

     2), (3, 3, 3, 3, . . .

     3), . . . ;

(M, M, M M, . . . M)}, where n=number of items;

Sna=store with best price for item n;

Snb=store with second price for item n;

X=Cartesian product;

∪

=set union;

(1, 1, 1, 1, . . . ,

     1)=first store found that carries all n items;

(2, 2, 2, 2, . . . ,

     2)=second store found that carries all n items, etc.; and

(M, M, M, M, . . . , M)=last store found that carries all n items.

7. The method of claim 1 in which the items are consumer items.

8. The method of claim 7 which in the consumer items consist of one or more of the following types:

books, magazines, music CDs, DVDs, software and videotapes.

9. The method of claim 8, in which the items are books, and the books may be searched by title, author'"'"'s name, keyword or ISBN number.

10. The method of claim 1, in which the steps of executing the search, establishing the first and second matrices, calculating the rank and displaying the rank are performed during a single Web session.

11. The method of claim 1, in which the displayed table format includes a grouping of the items by store.

12. The method of claim 1, in which the prices are either purchase prices or rental prices.

13. A method of executing commands in a computer to perform searching, calculating, comparing, approximately optimizing, ranking and displaying operations for multiple items in a package desired to be purchased over the Internet, the method comprising the steps of:

establishing an Internet Web site, the site operating as a computer interface for a user who wishes to search for and approximately optimize prices of at least two designated items in a package of the items;

receiving a search request for the plurality of items from the user who uses communications equipment and software to access the Web site to obtain prices about the plurality of items;

executing a multiple, simultaneous computer search on the Internet for prices of the items offered at a plurality of Internet stores for all of the items designated in the search request;

establishing a first matrix in a pre-computation algorithm, and receiving and storing in the first matrix data representing the lowest and second lowest prices retrieved in the search for each of the items from the stores;

establishing a second matrix, and receiving and storing in the second matrix data representing each store that carries all items for sale;

calculating, using algorithms including Cartesian product and set union operations performed on the data stored in the first and second matrices, an approximately optimized rank of all of the items considered as a package; and

displaying the approximately optimized ranks to the user in table format.

14. The method of claim 13 in which the prices are prices posted at Internet stores that offer the items for sale.

15. The method of claim 13 in which the rank is a list of stores that offer the items for sale, arranged in ascending order of price per item or group of items.

16. The method of claim 15 in which each store in the list is displayed to the user together with a hyperlink to the store that offers each item or group for sale at the lowest price for that item or group.

17. The method of claim 15 in which the rank is calculated by performing algorithms including Cartesian product and set union operations on the data stored in the first and second matrices, the first matrix comprising a matrix of elements, each element representing the lowest and second lowest prices at which the stores are offering an item for sale, and the second matrix comprising a matrix of elements, each element representing a store that carries all items for sale.

18. The method of claim 17 in which the rank is calculated using the following set operations on the first and second matrices:

select lowest price from {S1a, S1b} X {S2a, S2b} X {S3a, S3b} X {S4a, S4b} X {S5a, S5b} X . . . X {Sna, Snb} ∪

{(1, 1, 1, 1, . . .

     1), (2, 2, 2, 2, . . . ,

     2), (3, 3, 3, 3, . . .

     3), . . . , (M, M, M, M, . . . , M)}, where n number of items;

Sna=store with best price for item n;

Snb store with second best price for item n;

X=Cartesian product;

∪

=set union;

(1, 1, 1, . . . ,

     1), first store found that carries all n items;

(2, 2, 2, 2, . . . ,

     2)=second store found that carries all n items, etc.; and

(M, M, M, M, . . . , M)=last store found that carries all n items.

19. The method of claim 13 in which the items are consumer items.

20. The method of claim 19 in which the consumer items consist of one or more of the following types:

books, magazines, music CDs, DVDs, software and videotapes.

21. An article of manufacture comprising a computer readable medium containing executable instructions which, when executed in a computer, cause the computer to perform method steps for executing commands to perform operations comprising the steps of:

operating an Internet Web site, the site operating as computer interface for a user who wishes to search for and approximately optimize prices of at least two designated items in a package of the items;

receiving a search request for the plurality of the items from the user who uses communications equipment and software to access the Web site to obtain prices about the plurality of items;

executing a multiple, simultaneous computer search on the Interne for prices of the items offered at a plurality of Internet stores for all of the items designated in the search request;

establishing a first matrix in a pre-computation algorithm, and receiving and storing in the first matrix data representing the lowest and second lowest prices retrieved in the search for each of the items from the stores;

establishing a second matrix, and receiving and storing in the second matrix data representing each store that carries all items for sale;

calculating, using algorithms including Cartesian product and set union operations performed on the data stored in the first and second matrices, an approximately optimized rank of all of the items considered as a package; and

displaying the approximately optimized rank to the user in table format.

22. The method of claim 21 in which the prices are prices posted at Internet stores that offer the items for sale.

23. The method of claim 21 in which the rank is a list of stores that offer the items for sale, arranged in ascending order of price per item or group of items.

24. The method of claim 23 in which each store in the list is displayed to the user together with a hyperlink to the store that offers each item or group for sale at the lowest price for that item or group.

25. The method of claim 23 in which the rank is calculated by performing algorithms including Cartesian product and set union operations on the data stored in the first and second matrices, the first matrix comprising a matrix of elements, each element representing the lowest and second lowest prices at which the stores are offering an item for sale, and the second matrix comprising a matrix of elements, each element representing a store that carries all items for sale.

26. The method of claim 25 in which the rank is calculated using the following set operations on the first and second matrices:

select lowest price from {S1a, S1b} X {S2a, S2b} X {S3a, S3b} X {S4a, S4b} X {S5a, S5b} X . . . X {Sna, Snb} ∪

{(1, 1, 1, 1, . . .

     1), (2, 2, 2, 2, . . . ,

     2), (3, 3, 3, 3, . . .

     3), (M, M, M, M, . . . , M)}, where n=number of items;

Sna=store with best price for item n;

Snb=store with second best price for item n;

X=Cartesian product;

∪

=set union;

(1, 1, 1, 1, . . . ,

     1)=first store found that carries all n items;

(2, 2, 2, 2, . . . ,

     2)=second store found that carries all n items, etc.; and

(M, M, M, M . . . , M)=last store found that carries all n items.

27. The method of claim 21 in which the items are consumer items.

28. The method of claim 27 in which the consumer items consist of one or more of the following types:

books, magazines, music CDs, DVDs, software and videotapes.