System and method for product optimization
Abstract
A method includes maintaining product sales information according to a data model. The data model includes a consumer-demographics naming convention, a retail-provider-type naming convention, and a product-naming convention. The maintaining includes indexing the product sales information by consumer-demographics information, by retail-provider-type information, and by product-categorization information. The method further includes receiving raw sales information and translating the raw sales information into the data model. In addition, the method includes storing the translated raw sales information as part of the product sales information. Furthermore, the method includes receiving a request for aggregation of at least a portion of the product sales information. The request specifies an intersection of the product-categorization information, the consumer-demographic information, and the retail-provider-type information. The method also includes, responsive to the request, aggregating the at least a portion of the product sales information.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer-program product comprising a non-transitory computer-usable medium having computer-readable program code embodied therein, the computer-readable program code adapted to be executed to implement a method comprising:
multiple-indexing data according to a data model comprising a plurality of distinct naming conventions, the plurality of distinct naming conventions comprising a first naming convention, a second naming convention, and a third naming convention, wherein the first naming convention, the second naming convention and the third naming convention each comprise a plurality of categories; wherein the multiple-indexed data comprises:
information of interest in relation to first data and second data;
first descriptive information in relation to the first data, the first descriptive information categorizing the first data in conformance to the first naming convention;
second descriptive information in relation to the first data, the second descriptive information categorizing the first data in conformance to the second naming convention; and
third descriptive information in relation to the second data, the third descriptive information categorizing the second data in conformance to the third naming convention;
receiving a request for computer analysis of the information of interest in relation to an intersection of the first naming convention and the second naming convention; responsive to the request, aggregating at least a portion of the multiple-indexed data. based at least in part on an intersection of the first descriptive information and the second descriptive information; responsive to the aggregating, identifying an optimal intersection of the first descriptive information, the second descriptive information and the third descriptive information relative to the information of interest; and providing information related to the optimal intersection to a requestor.
2 . The computer-program product of claim 1 , wherein the receiving of the request comprises:
acquiring a category of the first naming convention; and acquiring a category of the second naming convention.
3 . A method comprising:
in a database, multiple-indexing data according to a data model comprising a plurality of distinct naming conventions, the plurality of distinct naming conventions comprising a first naming convention, a second naming convention, and a third naming convention, wherein the first naming convention, the second naming convention and the third naming convention each comprise a plurality of categories; wherein the multiple-indexed data comprises:
information of interest in relation to first data and second data;
first descriptive information in relation to the first data, the first descriptive information categorizing the first data in conformance to the first naming convention;
second descriptive information in relation to the first data, the second descriptive information categorizing the first data in conformance to the second naming convention; and
third descriptive information in relation to the second data, the third descriptive information categorizing the second data in conformance to the third naming convention;
receiving, by a server computer over a computer network, a request for computer analysis of the information of interest in relation to an intersection of the first naming convention and the second naming convention, wherein the receiving of the request comprises acquiring a category of the first naming convention and acquiring a category of the second naming convention; responsive to the request, the server computer aggregating at least a portion of the multiple-indexed data based at least in part on an intersection of the first descriptive information and the second descriptive information, wherein a portion of the aggregated portion of the multiple-indexed data by information related to the information of interest is sorted; responsive to the aggregating, the server computer identifying an optimal intersection of the first descriptive information, the second descriptive information and the third descriptive information relative to the information of interest; and the server computer providing information related to the optimal intersection to a requestor.
4 . The method of claim 3 , the method comprising:
facilitating comparison of the optimal intersection with other data of the multiple-indexed data.
5 . The method of claim 3 , comprising performing a gap analysis.
6 . The method of claim 3 , wherein the first naming convention, the second naming convention, and the third naming convention are each expressed as a tree structure.
7 . The method of claim 6 , wherein at least one naming convention of the plurality of distinct naming conventions comprises a plurality of levels.Join the waitlist — get patent alerts
Track US2023281159A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.