US 8,332,428 B2 · Browse hierarchies customized for rules based custom catalogs

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.

Claims30

Dependent claims

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.

3 more elements

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.

4 more elements

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.

3 more elements

Dependencies are inferred from the claim text.

Browse hierarchies customized for rules based custom catalogs

Life of this patent

Browse hierarchies customized for rules based custom catalogs

Life of this patent

Abstract

Claims30