Abstract:
A system performs database management. The system receives a request for a query of a plurality of tables under a join condition on an attribute and determines a uniform mapping that maps a domain of the attribute into a set of numbers, where the domain of the attribute includes all attribute values taken by the attribute in the tables. Then, for a row in a table, the system includes the row into a synopsis of the table if the row includes an attribute value that is mapped by the uniform mapping to a number less than an inclusion probability associated with the table. The system obtains a plurality of synopsis for the tables by repeating the including for all rows in the table and for all tables, and determines, based on the plurality of synopsis, an estimate join size of the tables under the join condition.
Abstract:
A system optimizes a number of shared server processes executing on a processor. The system creates, in a memory, a data array for storing a plurality of performance metric values, each associated with a number of shared server processes. The system selects a value for an optimized number of shared server processes according to a first procedure based on the performance metric, observes a performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric. The system repeats the selecting, observing and storing until at least a predetermined number of contiguous data values are stored in the data array. The system selects the value for the optimized number according to a second procedure based on a slope of the performance metric. The system observes the performance metric associated with the selected optimized number, and stores, in the data array, the observed performance metric.
Abstract:
A system is provided that that generates an optimal item placement for one or more items. The system receives one or more items, where each item includes an item height and an item width. The system further receives a container, where the container comprises a container height and a container width. The system further generates a number of copies for each item and a position within the container for each copy of each item, where each copy of each item is placed at the corresponding position within the container. The system further outputs the number of copies for each item and the position within the container for each copy of each item.
Abstract:
A system is provided that generates a list of most common items and respective item frequencies from a data set that includes a plurality of items. The system creates a first list of items from the data set and monitors an estimate count for each item in the first list, where the first list is sorted by the estimate count. The system further transfers items that exceed a threshold hit count from the first list to a second list. The system further monitors a hit count for the items in the second list, where the items in the second list are sorted by the hit count. The system further transfers the items that are displaced from the second list back to the first list.
Abstract:
A system for optimizing shelf space placement for a product receives decision variables and constraints, and executes a Randomized Search (“RS”) using the decision variables and constraints until an RS solution is below a pre-determined improvement threshold. The system then solves a Mixed-Integer Linear Program (“MILP”) problem using the decision variables and constraints, and using the RS solution as a starting point, to generate a MILP solution. The system repeats the RS executing and MILP solving as long as the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration. The system then, based on the final MILP solution, outputs a shelf position and a number of facings for the product.