Browse hierarchies customized for rules based custom catalogs

• US 8,332,428 B2
• Filed: 09/13/2010
• Issued: 12/11/2012
• Est. Priority Date: 06/18/2001
• Status: Expired due to Term

• Current Assignee: Versata Development Group, Inc. (ESW Capital, LLC)
• Original Assignee: Versata Development Group, Inc. (ESW Capital, LLC)
• Inventors: Bonneau, Scott, Nonemacher, Michael, Weinrib, Jeremy
• Primary Examiner(s): Colbert, Ella
• Application Number:
  US12/880,724
• Publication Number:
  US 20110060732A1
• Time in Patent Office: 820 Days
• Field of Search: 707/609, 707/705, 707/763, 707/769, 707/776, 707/778, 707/781, 707/782, 707/786, 707/797, 705/26, 705/26.1, 705/27, 705/27.1, 709/202, 709/229, 345/762, 345/853, 345/854, 711/4, 715/853
• US Class Current: 707/772
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/954 Navigation, e.g. using categorised browsing
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0603 Catalogue ordering
• CPC Class Codes: G06Q 30/0609 Buyer or seller confidence or verification
• CPC Class Codes: G06Q 30/0633 Lists, e.g. purchase orders, compilation or processing
• CPC Class Codes: G06Q 30/0641 Shopping interfaces
• CPC Class Codes: G06Q 40/06 Asset management; Financial planning or analysis

Abstract

An arbitrary number of custom catalogs for an arbitrary number of customers can be published from a single database of seller catalog data. Custom browse hierarchies can be generated for each of the custom catalogs. The custom catalogs are subsets of the catalog database, and are generated in accordance with a set of rules that defines the scope of the content of the custom catalog. The rule sets define a series of sequential searches by which a subset of the product SKUs contained in the database are returned. A primary hierarchy is maintained that can have a scope coextensive with the primary database. Custom browse hierarchies can be pruned to render their scope approximately coextensive with each subset. The custom catalog subsets and the custom browse hierarchies are generated periodically through a virtual publication process.

Claims

1. A method of generating a plurality of custom browse hierarchies each representative of a unique subset of items, said method comprising:

for each leaf node of a primary hierarchy representative of the items;

establishing a search rule that comprises an aggregation of constraints specified by the leaf node and its ancestors; and

executing code in a data processing system in accordance with the search rule to identify all of the unique subsets that contain at least one of the items meeting the aggregation of constraints; and

executing code in a data processing system to create a custom browse hierarchy for each of the unique subsets, said creating further comprising retaining in the custom browse hierarchy only those leaf nodes, and their ancestors, from the primary hierarchy for which the unique subset has been identified by said identifying.

2. The method of claim 1 wherein each of the unique subsets are identified by a different subset ID, each of the items are stored in a database and each of the items comprising each of the unique subsets is stored in an entry of a subset ID table, the entry further containing the subset ID that identifies the unique subset to which the item belongs, said identifying further comprising:

executing a search of the database to identify each of the items in the database that meet the constraints; and

for each of the items identified by said executing a search, performing a table join between the identified item and the subset ID table to return a lust of all subset IDS that are stored in an entry of the subset ID table with the identified item.

3. The method of claim 2 wherein said retaining further comprises:

for each leaf node of the primary hierarchy;

locating a next unprocessed leaf node of the primary hierarchy;

retrieving the returned list of all subset IDs for the next unprocessed leaf node; and

cloning the next unprocessed leaf node and its ancestors into the custom browse hierarchy if the subset ID identifying the unique subset is contained in the returned list of all subset IDs for the unprocessed leaf node.

4. The method of claim 2 wherein said executing a search further comprises:

translating the search rule to a database query;

issuing the database query to a database server coupled to the database; and

wherein the database server executes the search and performs the table join in accordance with the database query.

5. The method of claim 4 wherein said translating the search rule to a database query is performed by an application program being executed on an application server.

6. The method of claim 2 wherein the items are products or services, and the items are represented by catalog data stored in the database, the catalog data comprising a unique product identifier, one or more attributes, a unique value for each of the attributes, and associated descriptive information.

7. The method of claim 2 wherein said creating further comprises identifying each custom browse hierarchy with the subset ID used to identify the unique subset for which the custom browse hierarchy identified by the subset ID for display on a terminal having access to the database in response to a request identified by the subset ID.

8. The method of claim 7 wherein said providing further comprises:

formatting the created custom browse hierarchy as one or more web pages; and

transmitting the web pages over the Internet for display on the terminal using a web browser.

9. The method of claim 7 further comprising:

formatting one or more copies of the created custom browse hierarchy; and

exporting each formatted copy to an entity associated with the subset ID.

10. The method of claim 1 wherein each of the unique subsets of items comprises a custom catalog, and wherein the custom browse hierarchy generated for each of the unique subsets is operable to browse the custom catalog.

11. A computer system for generating a plurality of custom browse hierarchies each representative of a unique subset of items, said computer system comprising:

a memory storing program instructions executable by a processor for;

for each leaf node of a primary hierarchy representative of the items;

establishing a search rule that comprises an aggregation of constraints specified by the leaf node and its ancestors; and

identifying all of the unique subsets that contain at least one of the items meeting the aggregation of constraints; and

creating a custom browse hierarchy for each of the unique subsets, said creating further comprising retaining in the custom browse hierarchy only those leaf nodes, and their ancestors, from the primary hierarchy for which the unique subset has been identified by said identifying.

12. The computer system of claim 11 wherein each of the unique subsets are identified by a different subset ID, each of the items are stored in a database and each of the items comprising each of the unique subsets is stored in an entry of a subset ID table, the entry further containing the subset ID that identifies the unique subset to which the item belongs, said program instructions further for:

executing a search of the database to identify each of the items in the database that meet the constraints; and

for each of the items identified by said executing a search, performing a table join between the identified item and the subset ID table to return a list of al subset IDs that are stored in an entry of the subset ID table with the identified item.

13. The computer system of claim 12 wherein said program instructions are further executable by the for process for:

for each leaf node of the primary hierarchy;

locating a next unprocessed leaf node of the primary hierarchy;

retrieving the returned list of all subset IDs for the next unprocessed leaf node; and

cloning the next unprocessed leaf node and its ancestors into the custom browse hierarchy if the subset ID identifying the unique subset is contained in the returned list of all subset IDs for the unprocessed leaf node.

14. The computer system of claim 12 wherein said program instructions for executing a search further comprise comprise program instructions for:

translating the search rule to a database query;

issuing the database query to a database server coupled to the database; and

wherein the database server executes the search and performs the table join in accordance with the database query.

15. The computer system of claim 12 wherein the items are products or services, and the items are represented by catalog data stored in the database, the catalog data comprising a unique product identifier, one or more attributes, a unique value for each of the attributes, and associated descriptive information.

16. The computer system of claim 12 wherein said program instructions for creating are further executable by the processor for identifying each custom browse hierarchy with the subset ID used to identify the unique subset for which the custom browse hierarchy identified by the subset ID for display on a terminal having access to the database in response to a request identified by the subset ID.

17. The computer system of claim 16 wherein said program instructions for providing are further executable by the processor for:

formatting the created custom browse hierarchy as one or more web pages; and

transmitting the web pages over the Internet for display on the terminal using a web browser.

18. The computer system of claim 16 further comprising program instructions stored in the memory and executable by the processor for:

formatting one or more copies of the created custom browse hierarchy; and

exporting each formatted copy to an entity associated with the subset ID.

19. The computer system of claim 11 wherein said computer system comprises an application server.

20. The computer system of claim 11 wherein each of the unique subsets of items comprises a custom catalog, and wherein the custom browse hierarchy generated for each of the unique subsets is operable to browse the custom catalog.

21. A non-transitory, computer readable medium having code stored therein and executable by a processor to generated a custom browse hierarchy representative of a unique subset of items by:

for each leaf node of a primary hierarchy representative of the items;

establishing a search rule that comprises an aggregation of constraints specified by the leaf node and its ancestors; and

identifying all of the unique subsets that contain at least one of the items meeting the aggregation of constraints; and

creating a custom browse hierarchy for the unique subset, said creating further comprising retaining in the custom browse hierarchy only those leaf nodes, and their ancestors, from the primary hierarchy for which the unique subset has been identified by said identifying.

22. The non-transitory, computer readable medium of claim 21 wherein the unique subset is identified by a unique subset ID, each of the items is stored in a database and each of the items comprising the unique subset is stored in an entry of a subset ID table, the entry further containing the subset ID that identifies the unique subset, said identifying further comprising:

executing a search of the database to identify each of the items in the database that meet the constraints; and

for each of the items identified by said executing a search, performing a table join between the identified item and the subset ID table to return a list of all subset IDs that are stored in an entry of the subset ID table with the identified item.

23. The non-transitory, computer readable medium of claim 22 wherein said retaining further comprises:

for each leaf node of the primary hierarchy;

locating a next unprocessed leaf node of the primary hierarchy;

retrieving the returned list of all subset IDs for the next unprocessed leaf node; and

cloning the next unprocessed leaf node and its ancestors into the custom browse hierarchy if the subset ID identifying the unique subset is contained in the returned list of all subset IDs for the unprocessed leaf node.

24. The non-transitory, computer readable medium of claim 22 wherein said executing a search further comprises:

translating the search rule to a database query;

issuing the database query to a database server coupled to the database; and

wherein the database server executes the search and performs the table join in accordance with the database query.

25. The non-transitory, computer readable medium of claim 24 wherein said translating the search rule to a database query is performed by an application program being executed on an application server.

26. The non-transitory, computer readable medium of claim 22 wherein the items are products or services, and the items are represented by catalog data stored in the database, the catalog data comprising a unique product identifier, one or more attributes, a unique value for each of the attributes, and associated descriptive information.

27. The non-transitory, computer readable medium of claim 21 wherein each of the unique subsets of items comprises a custom catalog, and wherein the custom browse hierarchy generated for each of the unique subsets is operable to browse the custom catalog.

28. The non-transitory, computer readable medium of claim 21 wherein said creating further comprises identifying each custom browse hierarchy with the subset ID used to identify the unique subset for which the custom browse hierarchy identified by the subset ID for display on a terminal having access to the database in response to a request identified by the subset ID.

29. The non-transitory, computer readable medium of claim 28 wherein said providing further comprises:

formatting the created custom browse hierarchy as one or more web pages; and

transmitting the web pages over the Internet for display on the terminal using a web browser.

30. The non-transitory, computer readable medium of claim 28 further comprising:

formatting one or more copies of the created custom browse hierarchy; and

exporting each formatted copy to an entity associated with the subset ID.